Levelwise search and borders of theories in knowledge discovery

Data Mining and Knowledge Discovery

Volumn 1, Issue 3, 1997, Pages 241-258

  Mannila, Heikki ^a   Toivonen, Hannu ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Association rules; Episodes; Hypergraph transversals; Integrity constraints; Theory of knowledge discovery

Indexed keywords

EID: 21944442464     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009796218281     Document Type: Article

References (5)

1. Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD '93). Washington, D.C., pp. 207-216.
2. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., and Verkamo, A.I. 1996. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, (Eds.), Menlo Park, CA: AAAI Press, pp. 307-328.
3. Bell, S. 1995. Discovery and maintenance of functional dependencies by independencies. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD '95). Montréal, Canada, pp. 27-32.
4. Berge, C. 1973. Hypergraphs. Combinatorics of Finite Sets (third edition). Amsterdam: North-Holland.
5. Brin, S., Motwani, R., and Silverstein, S. 1997. Beyond market baskets: Generalizing association rules to correlations. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD '97). Tucson, AZ., pp. 265-276.