Discovering frequent closed itemsets for association rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1540, Issue , 1998, Pages 398-416

  Pasquier, Nicolas ^a   Bastide, Yves ^a   Taouil, Rafik ^a   Lakhal, Lotfi ^a  

^a UNIVERSITÉ BLAISE PASCAL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASSOCIATION RULES; DATABASE SYSTEMS;

CLOSURE MECHANISMS; CORRELATED DATA; DATA MINING ALGORITHM; DATA MINING PROBLEMS; FREQUENT CLOSED ITEMSETS; FREQUENT ITEMSET; INFORMATION LOSS; LATTICE FRAMEWORK;

DATA MINING;

EID: 84911977993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (20)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD Int’l Conference on Management of Data, pages 207-216, May 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proceedings of the 20th Int’l Conference on Very Large Data Bases, pages 478-499, June 1994. Expanded version in IBM Research Report RJ9839..
3. R. J. Bayardo. Efficiently mining long patterns from databases. Proceedings of the ACM SIGMOD Int’l Conference on Management of Data, pages 85-93, June 1998.
4. G. Birkhoff. Lattices theory. In Coll. Pub. XXV, volume 25. American Mathematical Society, 1967. Third edition.
5. S. Brin, R. Motwani, J. D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. Proceedings of the ACM SIGMOD Int’l Conference on Management of Data, pages 255-264, May 1997.
6. M.-S. Chen, J. Han, and P. S. Yu. Data mining: An overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering, 8(6):866-883, December 1996.
7. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1994. Fourth edition.
8. V. Duquenne and L.-L. Guigues. Famille minimale d’implication informatives résultant d’un tableau de données binaires. Math. Sci. Hum., 24(95):5-18, 1986.
9. B. Ganter and K. Reuter. Finding all closed sets: A general approach. In Order, pages 283-290. Kluwer Academic Publishers, 1991.
10. D. Lin and Z. M. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. Proceedings of the 6th Int’l Conference on Extending Database Technology, pages 105-119, March 1998.
11. M. Luxenburger. Implications partielles dans un contexte. Math. Inf. Sci. Hum., 29(113):35-55, 1991.
12. H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241-258, 1997.
13. H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering association rules. Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, pages 181-192, July 1994.
14. A. M. Mueller. Fast sequential and parallel algorithms for association rules mining: A comparison. Technical report, Faculty of the Graduate School of The University of Maryland, 1995.
15. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Pruning closed itemset lattices for association rules. Proceedings of the BDA French Conference on Advanced Databases, October 1998. To appear.
16. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in larges databases. Proceedings of the 21th Int’l Conference on Very Large Data Bases, pages 432-444, September 1995.
17. H. Toivonen. Sampling large databases for association rules. Proceedings of the 22nd Int’l Conference on Very Large Data Bases, pages 134-145, September 1996.
18. H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hatonen, and H. Mannila. Pruning and grouping discovered association rules. ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pages 47-52, April 1995.
19. R. Wille. Concept lattices and conceptual knowledge systems. Computers and Mathematics with Applications, 23:493-515, 1992.
20. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. Proceedings of the 3rd Int’l Conference on Knowledge Discovery in Databases, pages 283-286, August 1997.