Graph classification: a diversified discriminative feature selection approach
暂无分享,去创建一个
Hong Cheng | Jeffrey Xu Yu | Lu Qin | Yuanyuan Zhu | Hong Cheng | J. Yu | Lu Qin | Yuanyuan Zhu
[1] Ambuj K. Singh,et al. GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[2] Jiong Yang,et al. SPIN: mining maximal frequent subgraphs from graph databases , 2004, KDD.
[3] Wei Wang,et al. Graph classification based on pattern co-occurrence , 2009, CIKM.
[4] Fuhui Long,et al. Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy , 2003, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] George Karypis,et al. Frequent Substructure-Based Approaches for Classifying Chemical Compounds , 2005, IEEE Trans. Knowl. Data Eng..
[6] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[7] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[8] Jiawei Han,et al. Mining Graph Patterns Efficiently via Randomized Summaries , 2009, Proc. VLDB Endow..
[9] Wei Wang,et al. GAIA: graph classification using evolutionary computation , 2010, SIGMOD Conference.
[10] Jiawei Han,et al. CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.
[11] Chih-Jen Lin,et al. LIBSVM: A library for support vector machines , 2011, TIST.
[12] Jiawei Han,et al. Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[13] Philip S. Yu,et al. Near-optimal Supervised Feature Selection among Frequent Subgraphs , 2009, SDM.
[14] Mohammad Al Hasan,et al. Output Space Sampling for Graph Patterns , 2009, Proc. VLDB Endow..
[15] Philip S. Yu,et al. Mining significant graph patterns by leap search , 2008, SIGMOD Conference.
[16] Shuguo Han,et al. Classifying Graphs Using Theoretical Metrics: A Study of Feasibility , 2011, DASFAA Workshops.
[17] Nicole Krämer,et al. Partial least squares regression for graph mining , 2008, KDD.
[18] Sayan Mukherjee,et al. Feature Selection for SVMs , 2000, NIPS.
[19] Shijie Zhang,et al. Monkey: Approximate Graph Mining Based on Spanning Trees , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[20] Jiawei Han,et al. Discriminative Frequent Pattern Analysis for Effective Classification , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[21] Jinze Liu,et al. Structure‐based function inference using protein family‐specific fingerprints , 2006, Protein science : a publication of the Protein Society.
[22] Wei Wang,et al. Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.
[23] F. Fleuret. Fast Binary Feature Selection with Conditional Mutual Information , 2004, J. Mach. Learn. Res..
[24] Joost N. Kok,et al. A quickstart in frequent structure mining can make a difference , 2004, KDD.