Effective and efficient itemset pattern summarization: Regression-based approaches

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

Volumn , Issue , 2008, Pages 399-407

  Jin, Ruoming ^a   Abu Ata, Muad ^a   Xiang, Yang ^a   Ruan, Ning ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

Frequency restoration; Pattern summarization; Regression

Indexed keywords

CLUSTERING METHODS; COMPUTATIONAL COSTS; DECISION-TREE; EXPERIMENTAL EVALUATIONS; FREQUENCY RESTORATION; FREQUENT ITEM SETS; FREQUENT ITEMSET; ITEM SETS; ITEMSET; K-MEANS; LINEAR REGRESSION PROBLEMS; LOCAL MINIMUMS; NON-LINEAR REGRESSIONS; NONLINEAR REGRESSION PROBLEMS; PATTERN SUMMARIZATION; PROBABILISTIC MODELS; REGRESSION; RESTORATION ERRORS; SYNTHETIC DATA SETS; TOP DOWNS;

INFORMATION MANAGEMENT; MINING; RESTORATION;

REGRESSION ANALYSIS;

EID: 65449166491     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401941     Document Type: Conference Paper

References (32)

1. The r project for statistical computing. http://www.r-project.org/.
2. Foto Afrati, Aristides Gionis, and Heikki Mannila. Approximating a collection of frequent sets. In KDD, 2004.
3. Rakesh Agrawal, Tomasz Imielinski, and Aran Swami. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD Conference, pages 207-216, May 1993.
4. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 487-499, 1994.
5. Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In Proceedings of the Eleventh International Conference on Data Engineering, pages 3-14, 1995.
6. Alan Agresti. Categorical Data Analysis. Wiley, 2002.
7. Christan Borgelt. Apriori implementation. http://fuzzy.cs.Uni-Magdeburg. de/borgelt/Software.
8. Toon Calders and Bart Goethals. Non-derivable itemset mining. Data Min. Knowl. Discov., 14(1): 171-206, 2007.
9. Gene H. Golub and Charles F. Van Loan, matrix computations, 3rd. The John Hopkins University Press, 1996.
10. Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
11. Jiawei Han, Jianyong Wang, Ying Lu, and Petre Tzvetkov. Mining top-k frequent closed patterns without minimum support. In ICDM, 2002.
12. Trevor Hastie, Robert Tibshirani, and Jerome Friedman. The Elements of Statistical Learning. Springer-Verlag, 2001.
13. Jun Huan, Wei Wang, Deepak Bandyopadhyay, Jack Snoeyink, Jan Prins, and Alexander Tropsha. Mining protein family-specific residue packing patterns from protein structure graphs. In Eighth International Conference on Research in Computational Molecular Biology (RECOMB), pages 308-315, 2004.
14. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Principles of Knowledge Discovery and Data Mining (PKDD2000), pages 13-23, 2000.
15. Ruoming Jin and Gagan Agrawal. A systematic approach for optimizing complex mining tasks on multiple dataseis. In Proceedings of the ICDE Conference, 2006.
16. Ron Kohavi, Carla Brodley, Brian Frasca, Llew Mason, and Zijian Zheng. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2(2):86-98, 2000. http://www.ecn.purdue.edu/KDDCUP.
17. F. R. Kschischang, B. J. Frey, and H. A. Loeliger. Factor graphs and the sum-product algorithm. Information Theory, IEEE Transactions on, 47(2):498-519, 2001.
18. Wei Li and Ari Mozes. Computing frequent itemsets inside oracle 10g. In VLDB, pages 1253-1256, 2004.
19. Nicolas Pasquier, Yves Bastide, Rafik Taouil, and Lotfi Lakhal. Discovering frequent closed itemsets for association rules. In ICDT '99: Proceeding of the 7th International Conference on Database Theory, 1999.
20. Dmitry Pavlov, Heikki Mannila, and Padhraic Smyth. Beyond independence: Probabilistic models for query approximation on binary transaction data. IEEE Trans. Knowl. Data Eng., 15(6): 1409-1421, 2003.
21. Jr. Roberto J. Bayardo. Efficiently mining long patterns from databases. In SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, 1998.
22. G. A. F. Seber and C. J. Wild. Nonlinear Regression. John Weiley & Sons, Inc., 1989.
23. Craig Utley. Microsoft sql server 9.0 technical articles: Introduction to sql server 2005 data mining. http://technet.microsoft.com/en-us/library/ ms345131.aspx.
24. Chao Wang and Srinivasan Parthasarathy. Summarizing itemset patterns using probabilistic models. In KDD, 2006.
25. Takashi Washio and Hiroshi Motoda. State of the art of graph-based data mining. SIGKDD Explor. Newsl., 5(1):59-68, 2003.
26. Dong Xin, Hong Cheng, Xifeng Yan, and Jiawei Han. Extracting redundancy-aware top-k patterns. In KDD, 2006.
27. Dong Xin, Jiawei Han, Xifeng Yan, and Hong Cheng. Mining compressed frequent-pattern sets. In VLDB, 2005.
28. Xifeng Yan, Hong Cheng, Jiawei Han, and Dong Xin. Summarizing itemset patterns: a profile-based approach. In KDD, 2005.
29. M. T. Yang, R. Kasturi, and A. Sivasubramaniam. An Automatic Scheduler for Real-Time Vision Applications. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2001.
30. Takeshi Yoshizawa, Iko Pramudiono, and Masaru Kitsuregawa. SQL based association rule mining using commercial RDBMS (IBM db2 UBD EEE). In Data Warehousing and Knowledge Discovery, pages 301-306, 2000.
31. Mohammed J. Zaki. Efficiently mining frequent trees in a forest. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 71-80, 2002.
32. Mohammed J. Zaki and Charu C. Aggarwal. Xrules: an effective structural classifier for xml data. In KDD '03: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 316-325, 2003.