Efficient discovery of error-tolerant frequent itemsets in high dimensions

Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2001, Pages 194-203

  Yang, Cheng ^a   Fayyad, Usama ^b   Bradley, Paul S ^b  

^a Stanford University   (United States)

^b DigiMine Inc   (United States)

Author keywords

Clustering; Collaborative filtering; Error tolerant frequent itemset; High dimensions; Query selectivity estimation

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; WEB BROWSERS; WEBSITES;

CLUSTERING; ERROR TOLERANT FREQUENT ITEMSETS (ETI);

DATA MINING;

EID: 0035789315     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502512.502539     Document Type: Conference Paper

References (30)

1. [AGGR98] R. Agrawal, J. Gehrke, D. Gunopulos and P. Raghavan, Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. In Proc. of the ACM SIGMOD Conf., 1998.
2. [AIS93] R. Agrawal, T. Imielinski and A. Swami. Mining Association Rules Between Sets of Items in Large Databases. In Proc. of the ACM SIGMOD Conf., 1993, pp. 207-216.
3. [AMSTV96] 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 (eds.), Advances in Knowledge Discovery and Data Mining, pp. 307-328, AAAI Press, Menlo Park, CA, 1996.
4. th International Conference on Very Large Databases, 1994.
5. [B98] R. J. Bayardo Jr. Efficiently Mining Long Patterns from Databases. In Proc. of the 1998 ACM SIGMOD Int'l Conf. on Management of Data, pp. 85-93, 1998.
6. [BFG99] K. P. Bennett, U. M. Fayyad and D. Geiger. Density-based Indexing for Approximating Nearest Neighbor Queries. Proc. KDD-99, ACM Press, 1999.
7. [BFR98] P. S. Bradley, U. M. Fayyad and C. Reina. Scaling EM (Expectation-Maximization) Clustering to Large Databases. Technical Report MSR-TR-98-35, Microsoft Research, 1998.
8. [BHK98] J. Breese, D. Heckerman and C. Kadie. Empirical Analysis of Predictive Algorithms for Collaborative Filtering. Technical Report MSR-TR-98-12, Microsoft Research, 1998.
9. [CS96] P. Cheeseman and J. Stutz. Bayesian Classification (AutoClass): Theory and Results. In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurasamy (eds.) Advances in Knowledge Discovery and Data Mining, pages 153-180. AAAI Press, Menlo Park, CA, 1996.
10. [DLR77] A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society B, 39:1-38, 1973.
11. [DH73] R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, New York, 1973.
12. [FI93] U.M. Fayyad and K.B. Irani. "Multi-interval Discretization of Continuous-valued Attributes for Classification Learning". Proc. of the 13th Intl. Joint Conf. on Artificial Intelligence. IJCAI-93: Chambery, France (1993).
13. [GGR99] V. Ganti, J. Gehrke, and R. Ramakrishnan. "CACTUS Clustering Categorical Data Using Summaries". Proc. of KDD-99, ACM Press, 1999.
14. [GKP89] R. L. Graham, D. E. Knuth and O. Patashnik. Concrete Mathematics. Addison Wesley, Reading, MA, 1989.
15. [GKR98] D. Gibson, J. Kleinburg, and P. Raghavan. "Clustering categorical data: an approach based on dynamical systems". Proc. VLDB-98, pp. 311-323. 1998.
16. th Int'l Conf. On Database Theory, pp. 215-229, 1997.
17. [GRS98] S. Guha, R. Rastogi and K. Shim. CURE: An efficient algorithm for clustering large databases. In Proceedings of the ACM SIGMOD conference, 1998.
18. [GRS99] S. Guha, R. Rastogi, K. Shim. "A Robust Clustering Algorithm for Categorical Attributes". Proc. ICDE-99, IEEE Press, 1999.
19. [MH98] M. Meila and D. Heckerman. An Experimental Comparison of Several Clustering and Initialization Methods. Technical Report MSR-TR-98-06, Microsoft Research, 1998.
20. [MRK97] B. Miller, J. Riedl and J. Konstan. Experiences with GroupLens: Making Usenet Useful Again. In Proc. USENIX 1997 Tech. Conf., pp. 219-231, Anaheim, CA, 1997.
21. [NH94] R. T. Ng and J. Han. Efficient and effective clustering methods for spatial data mining. In Proceedings of the International Conference on Very Large Databases, 1994.
22. nd Edition). 1999.
23. [R*97] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom and J. Riedl. GroupLens: An Open Architecture for Collaborative Filtering of Netnew. In Proc. ACM 1994 Conf. Computer Supported Cooperative Work, pp. 175-186, New York. ACM, 1997.
24. [RV97] P. Resnick and H. Varian. Recommender Systems. Comm. of the ACM, 40(3):56-58, 1997.
25. th Intl. Conf. on Knowledge Discovery and Data Mining, pp. 223-232, 1999.
26. [SA96] R. Srikant and R. Agrawal. Mining Quantitative Association Rules in Large Relational Tables. In Proceedings of the ACM SIGMOD Conference, 1996.
27. [YFB00] C. Yang, U. Fayyad and P. S. Bradley. Efficient Discovery of Error-Tolerant Frequent Itemsets in High Dimensions. Technical Report MSR-TR-2000-20, Microsoft Research, 2000.
28. [ZPOL97] M. J. Zaki, S. Parthasarathy, M. Ogihara and W. Li. New Algorithms for Fast Discovery of Association Rules. In Proc. of the Third Int'l Conf. On Knowledge Discovery in Databases and Data Mining, pp. 283-286, 1997.
29. [ZRL96] T. Zhang, R. Ramakrishnan and M. Livny. Birch: An efficient data clustering method for very large databases. In Proceedings of the ACM SIGMOD Conference, 1996, pp. 103-114.
30. [Z49] G.E. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley Press, Inc, 1949.