Discriminative frequent pattern analysis for effective classification

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2007, Pages 716-725

  Cheng, Hong ^a   Yan, Xifeng ^b   Han, Jiawei ^a   Hsu, Chih Wei ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; GRAPH THEORY; PATTERN RECOGNITION; SCALABILITY; SEMANTICS; TEXT PROCESSING;

CLASSIFICATION FRAMEWORK; FREQUENT PATTERNS; INFORMATION GAIN; RELATIONAL DATA; SPORADIC STUDIES; SYSTEMATIC EXPLORATION;

CLASSIFICATION (OF INFORMATION);

EID: 34548741255     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367917     Document Type: Conference Paper

References (27)

1. R.. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of SIGMOD, pages 207-216, 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of VLDB, pages 487-499, 1994.
3. R. Agrawal and R. Srikant. Mining sequential patterns. In Proc. of ICDE, pages 3-14, 1995.
4. J. Carbonell and J. Coldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In Proc. of SIGIR, pages 335-336, 1998.
5. C.-C. Chang and C.-J. Lin. LIBSVM: a library for support vector machines, 2001. Software available at http://www.csie.ntu.edu.tw/~cjlin/ libsvm.
6. G. Cong, K. Tan, A. Tung, and X. Xu. Mining top-k covering rule groups for gene expression data. In Proc. of SIGMOD, pages 670-681, 2005.
7. M. Deshpande, M. Kuramochi, and G. Karypis. Frequent sub-structure-based approaches for classifying chemical compounds. In Proc. of ICDM, pages 35-42, 2003.
8. R. Duda, P. Hart, and D. Stork. Pattern Classification. Wiley Interscience, 2nd edition, 2000.
9. G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), 2003.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. of SIGMOD, pages 1-12, 2000.
11. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of ICDM, pages 313-320, 2001.
12. C. Leslie, E. Eskin, and W. S. Noble. The spectrum kernel: A string kernel for svm protein classification. In Proc. of PSB, pages 564-575, 2002.
13. W. Li, J. Han, and J. Pei. CMAR: Accurate and efficient classification based on multiple class-association rules. In Proc. of ICDM, pages 369-376, 2001.
14. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In Proc. of KDD, pages 80-86, 1998.
15. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins. Text classification using string kernels. Journal of Machine Learning Research, 2:419-444, 2002.
16. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. of ICDE, pages 215-226, 2001.
17. J. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
18. P. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proc. of KDD, pages 32-41, 2002.
19. J. Wang and G. Karypis. HARMONY: Efficiently mining the best rules for classification. In Proc. of SDM, pages 205-216, 2005.
20. K. Wang, C. Xu, and B. Liu. Clustering transactions using large items. In Proc. of CIKM, pages 483-490, 1999.
21. I. H. Witten and E. Frank. Data Mining: Practical machine learning tools and techniques. Morgan Kaufmann, 2nd edition, 2005.
22. X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In Proc. of ICDM, pages 721-724, 2002.
23. X. Yan, P. S. Yu, and J. Han. Graph Indexing: A frequent structure-based approach. In Proc. of SIGMOD, pages 335-346, 2004.
24. Y. Yang and J. O. Pedersen. A comparative study on feature selection in text categorization. In Proc. of ICML, pages 412-420, 1997.
25. X. Yin and J. Han. CPAR: Classification based on predictive association rules. In Proc. of SDM, pages 331-335, 2003.
26. M. J. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 42(1/2):31-60, 2001.
27. M. J. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In Proc. of SDM, pages 457-473, 2002.