Dense itemsets

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 683-688

  Seppänen, Jouni K ^a   Mannila, Heikki ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

Error tolerance; Frequent itemsets

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; DATABASE SYSTEMS; ERROR ANALYSIS; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY;

DATA MATRICES; DATA SETS; ERROR TOLERANCE; FREQUENT ITEMSETS;

DATA MINING;

EID: 12244308132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014140     Document Type: Conference Paper

References (20)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD '93, pages 207-216, 1993.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, chapter 12, pages 307-328. AAAI Press, 1996.
3. E. Bingham, H. Mannila, and J. K. Seppänen. Topics in 0-1 data. In D. Hand, D. Keim, and R. Ng, editors, Proc. KDD-2002, pages 450-455, 2002.
4. J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. In PKDD-2000, volume 1910 of LNCS, pages 75-85. Springer, 2000.
5. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Knowledge Discovery and Data Mining, pages 254-260, 1999.
6. A. Bykowski, J. K. Seppänen, and J. Hollmén. Model-independent bounding of Boolean formulae in binary data. In M. Klemettinen, R. Meo, F. Giannotti, and L. De Raedt, editors, Knowledge Discovery in Inductive Databases (KDID-02), First International Workshop, pages 20-31, Helsinki, Finland, 2002. University of Helsinki Department of Computer Science Report B-2002-7.
7. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In T. Elomaa, H. Mannila, and H. Toivonen, editors, Proc. PKDD-2002, volume 2431 of LNCS, pages 74-85. Springer-Verlag, 2002.
8. R. Duda and P. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
9. F. Geerts, B. Goethals, and T. Mielikäinen. Mining tiles and tilings. Manuscript in preparation.
10. B. Goethals and M. J. Zaki, editors. Proc. Workshop on Frequent Itemset Mining Implementations (FIMI-03), volume 90 of CEUR-WS, Melbourne, Florida, 2003. http://CEUR-WS.org/Vol-90/.
11. J. Han, J. Wang, Y. Lu, and P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM 2002, pages 211-218, 2002.
12. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Information Processing Letters, 70(1):39-45, 1999. doi:10.1016/S0020-0190(99) 00031-9.
13. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Segmentation problems. J. ACM, 51(2):263-280, 2004.
14. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems, 2000.
15. T. Mielikäinen and H. Mannila. The pattern ordering problem. In N. Lavrač, D. Gamberger, L. Todorovski, and H. Blockeel, editors, Proc. PKDD-2003, volume 2383 of LNAI, pages 327-338. Springer, 2003.
16. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. LNCS, 1540:398-416, 1999.
17. J. Pei, A. K. Tung, and J. Han. Fault-tolerant frequent pattern mining: Problems and challenges. In Workshop on Research Issues in Data Mining and Knowledge Discovery, 2001.
18. J. A. Swets. Measuring the accuracy of diagnostic systems. Science, 240(4857):1285-93, June 1988.
19. P. Tzvetkov, X. Yan, and J. Han. TSP: Mining top-k closed sequential patterns. In ICDM 2003, pages 347-354, 2003.
20. C. Yang, U. Fayyad, and P. S. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In Proc. KDD-2001, pages 194-203. ACM Press, 2001.