Near-optimal Supervised Feature Selection among Frequent Subgraphs
暂无分享,去创建一个
Philip S. Yu | Hans-Peter Kriegel | Le Song | Alexander J. Smola | Jiawei Han | Hong Cheng | Arthur Gretton | Xifeng Yan | Karsten M. Borgwardt | Marisa Thoma | Alex Smola | Le Song | A. Gretton | K. Borgwardt | H. Kriegel | Jiawei Han | Hong Cheng | Xifeng Yan | M. Thoma | Marisa Thoma
[1] Wei Wang,et al. Efficient mining of frequent subgraphs in the presence of isomorphism , 2003, Third IEEE International Conference on Data Mining.
[2] L. Ein-Dor,et al. Thousands of samples are needed to generate a robust gene list for predicting outcome in cancer. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[3] Philip S. Yu,et al. Direct mining of discriminative and essential frequent patterns via model-based search tree , 2008, KDD.
[4] Andreas Zell,et al. Optimal assignment kernels for attributed molecular graphs , 2005, ICML.
[5] George Karypis,et al. Comparison of descriptor spaces for chemical compound retrieval and classification , 2006, Sixth International Conference on Data Mining (ICDM'06).
[6] Christian Borgelt,et al. MoSS: a program for molecular substructure mining , 2005 .
[7] Jiawei Han,et al. Discriminative Frequent Pattern Analysis for Effective Classification , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[8] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[9] Natasa Przulj,et al. Biological network comparison using graphlet degree distribution , 2007, Bioinform..
[10] Chih-Jen Lin,et al. LIBSVM: A library for support vector machines , 2011, TIST.
[11] H. Kubinyi. Drug research: myths, hype and reality , 2003, Nature Reviews Drug Discovery.
[12] Tatsuya Akutsu,et al. Extensions of marginalized graph kernels , 2004, ICML.
[13] Andreas Krause,et al. Near-optimal sensor placements in Gaussian processes , 2005, ICML.
[14] Christian Borgelt,et al. Mining molecular fragments: finding relevant substructures of molecules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[15] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[16] George Karypis,et al. Frequent Substructure-Based Approaches for Classifying Chemical Compounds , 2005, IEEE Trans. Knowl. Data Eng..
[17] Yudong D. He,et al. Gene expression profiling predicts clinical outcome of breast cancer , 2002, Nature.
[18] Ehud Gudes,et al. Computing frequent graph patterns from semistructured data , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[19] Philip S. Yu,et al. Mining significant graph patterns by leap search , 2008, SIGMOD Conference.
[20] Albrecht Zimmermann,et al. CTC - correlating tree patterns for classification , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[21] Zoran Obradovic,et al. Feature Selection Filters Based on the Permutation Test , 2004, ECML.
[22] Joost N. Kok,et al. A quickstart in frequent structure mining can make a difference , 2004, KDD.
[23] Yiming Yang,et al. A Comparative Study on Feature Selection in Text Categorization , 1997, ICML.
[24] P. Dobson,et al. Distinguishing enzyme structures from non-enzymes without alignments. , 2003, Journal of molecular biology.
[25] Sebastian Wernicke,et al. A Faster Algorithm for Detecting Network Motifs , 2005, WABI.
[26] Jiawei Han,et al. CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.
[27] Albrecht Zimmermann,et al. One in a million: picking the right patterns , 2008, Knowledge and Information Systems.
[28] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[29] Luc De Raedt,et al. Molecular feature mining in HIV data , 2001, KDD '01.
[30] Toshihide Ibaraki,et al. Finding Essential Attributes from Binary Data , 2003, Annals of Mathematics and Artificial Intelligence.
[31] Andreas Krause,et al. Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.
[32] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.
[33] Hisashi Kashima,et al. Marginalized Kernels Between Labeled Graphs , 2003, ICML.
[34] Kurt Mehlhorn,et al. Efficient graphlet kernels for large graph comparison , 2009, AISTATS.
[35] Koji Tsuda,et al. Entire regularization paths for graph data , 2007, ICML '07.
[36] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[37] Yuji Matsumoto,et al. An Application of Boosting to Graph Classification , 2004, NIPS.