Carnegie Mellon University / University of Illinois / Santa Barbara ‡‡ University of Cambridge / Max Planck Institute / They store / Chinese University of Hong Kong / University of California / University of Illinois at Chicago / /
IndustryTerm
greedy solution / software engineering / graph mining / nearoptimal solution / horizontal leap search strategy / frequent subgraph mining / real world applications / search strategy / chemical compounds / frequent graph mining algorithms / graph miner / itemset mining / subgraph mining / chemical structures / molecular substructure mining / feature mining experiment / classification algorithm / nested mining procedure / feature mining process / discriminative pattern mining / isomorphism testing algorithms / subgraph mining procedures / graph mining algorithms / biological and chemical processes / path-join algorithm / near-optimal solution / near-optimality solution / shorter mining times / mining / search tree / model-based search tree / search space / pattern mining / open source data mining / /
Organization
Chinese University of Hong Kong / Institute for Informatics / University of Illinois at Chicago / School of Computer Science / University of Cambridge and Max-Planck-Institutes for Developmental Biology and Cybernetics / University of Illinois / University of California at Santa Barbara / Department of Computer Science / German Federal Ministry of Economics and Technology / Carnegie Mellon University / Max Planck Institute for Biological Cybernetics / Department of Systems Engineering and Engineering Management / /
Person
Siegfried Nijssen / Hans-Peter Kriegel∗ Karsten Borgwardt / Hong Cheng† Le Songk / Marisa Thoma∗ Alex Smola / Wale / Alex Smola¶ Hong Cheng / Arthur Gretton‡ Philip / /
Near-optimal supervised feature selection among frequent subgraphs Marisa Thoma∗ Alex Smola¶ Hong Cheng† Le Songk