J. Wijsen and R. Meersman. On the complexity of mining temporal trends. In R. Ng, editor, 1997 ACM SIGMOD Int. Workshop on Research Issues on Data Mining and Knowledge Discovery, Technical Report 97-07, pages 77--84. The University of British Columbia, Dept. of Computer Science, 1997.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Complexity of Mining Quantitative Association Rules - Wijsen, Meersman (1998) (3 citations) Self-citation (Wijsen Meersman) (Correct)
....Faloutsos and Lin, 1995; Park et al. 1995; Savasere et al. 1995; Brin et al. 1997) Nevertheless, a complexity analysis is important, as it can give us important indications about the tractability of the problem in hand, which may complement algorithm design techniques. In a previous paper (Wijsen and Meersman, 1997), we have already studied the complexity of discovering a particular type of temporal dependencies. Temporal dependencies are interesting, but (quantitative) association rules are by far more prevalent in the data mining literature. Quantitative association rules were defined by Srikant and ....
J. Wijsen and R. Meersman. On the complexity of mining temporal trends. In R. Ng, editor, 1997 ACM SIGMOD Int. Workshop on Research Issues on Data Mining and Knowledge Discovery, Technical Report 97-07, pages 77--84. The University of British Columbia, Dept. of Computer Science, 1997.
Temporal FDs on Complex Objects - Wijsen (1998) Self-citation (Wijsen) (Correct)
....; 6= This allows, for example, expressing that If the rank of an employee increases, then his her salary must increase as well. Using TFDs, one can only express that If the rank of an employee changes, then his her salary must change as well. A first result of this extension appears in [Wijsen and Meersman 1997]. ACKNOWLEDGMENTS The anonymous referees provided many helpful comments on a previous draft. 40 Delta J. Wijsen APPENDIX A. THE SET OF CHRONOLOGIES IS A COMPLETE LATTICE In this appendix, we prove that the set of all chronologies, ordered by set inclusion, is a complete lattice. We make use ....
Wijsen, J. and Meersman, R. 1997. On the complexity of mining temporal trends. In R. Ng Ed., 1997 ACM SIGMOD Int. Workshop on Research Issues on Data Mining and Knowledge Discovery, Technical Report 97-07 (1997), pp. 77--84. The University of British Columbia, Dept. of Computer Science.
Discovery of Association Rules in Temporal Databases - Tansel, Ayan (1998) (Correct)
No context found.
Wijsen, J., and Meersman, R. 1997. On the Complexity of Mining Temporal Trends. In Proceedings of SIGMOD'97 Workshop on Research Issues on Data Mining and Knowledge Discovery, SanJose, Claifornia.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC