Constructing classification features using minimal predictive patterns

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2010, Pages 869-878

  Batal, Iyad ^a   Hauskrecht, Milos ^a  

^a Learning Research and Development Ctr   (United States)

Author keywords

Algorithms; Experimentation; Performance

Indexed keywords

CLASSIFICATION FEATURES; CLASSIFICATION PERFORMANCE; COMPACT SETS; DATA MINING TECHNIQUES; DATA SETS; EXPERIMENTAL EVALUATION; EXPERIMENTATION; FEATURE SELECTION; FREQUENT PATTERNS; HIGHLY-CORRELATED; MINING PROCESS; PATTERN MINING; PERFORMANCE; PRUNING TECHNIQUES; SECOND PHASE; SPEED-UPS; SUPERVISED MACHINE LEARNING;

ALGORITHMS; DATA MINING; FEATURE EXTRACTION; FILTRATION; KNOWLEDGE MANAGEMENT; LEARNING SYSTEMS; MINING; SEMANTICS;

CLASSIFICATION (OF INFORMATION);

EID: 78651269848     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1871437.1871549     Document Type: Conference Paper

References (30)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of SIGMOD, 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of VLDB, 1994.
3. A. Asuncion and D. Newman. UCI machine learning repository, 2007.
4. Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In Proceedings of the International Conference on Computational Logic, 2000.
5. I. Batal, L. Sacchi, R. Bellazzi, and M. Hauskrecht. Multivariate time series classification with temporal abstractions. In FLAIRS, 2009.
6. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. The Wadsworth Statistics/Probability Series, 1984.
7. C.-C. Chang and C.-J. Lin. LIBSVM: a library for support vector machines, 2001.
8. H. Cheng, X. Yan, J. Han, and C. wei Hsu. Discriminative frequent pattern analysis for effective classification. In Proceedings of ICDE, 2007.
9. H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective classification. In Proceedings of ICDE, 2008.
10. G. Cong. Mining top-k covering rule groups for gene expression data. In Proceedings of SIGMOD, 2005.
11. C. Cortes and V. Vapnik. Support-vector networks. Machine Learning, 1995.
12. M. Deshpande, M. Kuramochi, N. Wale, and G. Karypis. Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 17:1036-1050, 2005.
13. W. Fan, K. Zhang, H. Cheng, J. Gao, X. Yan, J. Han, P. Yu, and O. Verscheure. Direct mining of discriminative and essential frequent patterns via model-based search tree. In Proceedings of SIGKDD, 2008.
14. Y. Freund and R. Schapire. A short introduction to boosting. /. Japan. Soc. for Artif. Intel., 14(5):771-780, 1999.
15. L. Geng and H. J. Hamilton. Interestingness measures for data mining: A survey. ACM Comput. Surv., 38(3), 2006.
16. J. Han, J. Pei, and Y Yin. Mining frequent patterns without candidate generation. In Proceedings of the ACM SIGMOD international conference on Management of data, 2000.
17. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proceedings of ICDM, 2001.
18. W. Li, J. Han, and J. Pei. CMAR: Accurate and efficient classification based on multiple class-association rules. In Proceedings of ICDM, 2001.
19. D.-I. Lin and Z. M. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. In Proceedings of the international conference on Extending Database Technology, pages 105-119, 1997.
20. B. Liu, W. Hsu, and Y. Ma. Integrating classification and association rule mining. In Knowledge Discovery and Data Mining, pages 80-86, 1998.
21. H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, C. Watkins, and B. Scholkopf. Text classification using string kernels. Journal of Machine Learning Research, 2:563-569, 2002.
22. J. R. Quinlan. C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., 1993.
23. L. M. Siebes A, Vreeken J. Item sets that compress. In Proceeding of SIAM international conference on data mining, 2006.
24. N. Tatti. Maximum entropy based significance of itemsets. Knowledge Information System, 17(1):57-77, 2008.
25. V. Vapnik. The Nature of Statistical Learning Theory. Springer-Verlag, NY, 1995.
26. A. Veloso, W. Meira Jr., and M. J. Zaki. Lazy associative classification. In Proceedings of ICDM, 2006.
27. J. Wang and G. Karypis. Harmony: Efficiently mining the best rules for classification. In Proceedings of SDM, 2005.
28. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In Proceedings of VLDB, 2005.
29. X. Yan, H. Cheng, J. Han, and D. Xin. Summarizing itemset patterns: a profile-based approach. In Proceedings of SIGKDD, 2005.
30. M. J. Zaki. Spade: an efficient algorithm for mining frequent sequences. In Machine Learning Journal, pages 31-60, 2001.