An efficient heuristic approach for learning a set of composite graph classification rules

[1]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[2]  George Karypis,et al.  Frequent substructure-based approaches for classifying chemical compounds , 2003, IEEE Transactions on Knowledge and Data Engineering.

[3]  Thomas Gärtner,et al.  On Graph Kernels: Hardness Results and Efficient Alternatives , 2003, COLT.

[4]  Philip S. Yu,et al.  Positive and Unlabeled Learning for Graph Classification , 2011, 2011 IEEE 11th International Conference on Data Mining.

[5]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[6]  P. Dobson,et al.  Distinguishing enzyme structures from non-enzymes without alignments. , 2003, Journal of molecular biology.

[7]  George Economou,et al.  Robust Face Recognition and Retrieval Using Neural-Network-Based Quantization of Gabor Jets and Statistical Graph Matching , 2007 .

[8]  Wei Wang,et al.  Graph classification based on pattern co-occurrence , 2009, CIKM.

[9]  Jiawei Han,et al.  CloseGraph: mining closed frequent graph patterns , 2003, KDD '03.

[10]  Charles X. Ling,et al.  AUC: A Better Measure than Accuracy in Comparing Learning Algorithms , 2003, Canadian Conference on AI.

[11]  Hongliang Fei,et al.  Structured Sparse Boosting for Graph Classification , 2014, TKDD.

[12]  Philip S. Yu,et al.  Semi-supervised feature selection for graph classification , 2010, KDD.

[13]  Pierre Baldi,et al.  Graph kernels for chemical informatics , 2005, Neural Networks.

[14]  Sebastian Nowozin,et al.  gBoost: a mathematical programming approach to graph classification and regression , 2009, Machine Learning.

[15]  Hisashi Kashima,et al.  Marginalized Kernels Between Labeled Graphs , 2003, ICML.

[16]  Lawrence B. Holder,et al.  Graph-Based Relational Concept Learning , 2002, International Conference on Machine Learning.

[17]  Luc De Raedt,et al.  Don't Be Afraid of Simpler Patterns , 2006, PKDD.

[18]  Ichigaku Takigawa,et al.  Graph mining: procedure, application to drug discovery and recent advances. , 2013, Drug discovery today.

[19]  Miro Kraetzl,et al.  Graph distances using graph union , 2001, Pattern Recognit. Lett..

[20]  Philip S. Yu,et al.  Near-optimal Supervised Feature Selection among Frequent Subgraphs , 2009, SDM.

[21]  Philip S. Yu,et al.  Dual active feature and sample selection for graph classification , 2011, KDD.

[22]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[23]  Yoram Singer,et al.  A simple, fast, and effective rule learner , 1999, AAAI 1999.

[24]  Jean-Philippe Vert,et al.  The Pharmacophore Kernel for Virtual Screening with Support Vector Machines , 2006, J. Chem. Inf. Model..

[25]  José Eladio Medina-Pagola,et al.  Frequent approximate subgraphs as features for graph-based image classification , 2012, Knowl. Based Syst..

[26]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[27]  Samah Jamal Fodeh,et al.  A Probabilistic Substructure-Based Approach for Graph Classification , 2007 .

[28]  Akihiro Yamamoto,et al.  Learning from graph data by putting graphs on the lattice , 2012, Expert Syst. Appl..

[29]  Ayhan Demiriz,et al.  Linear Programming Boosting via Column Generation , 2002, Machine Learning.