Discriminative frequent subgraph mining with optimality guarantees

Statistical Analysis and Data Mining

Xifeng Yan¹  Alex Smola³  Marisa Thoma⁴  Karsten M. Borgwardt⁴  Hong Cheng⁶  Le Song⁷  Arthur Gretton⁸  Philip S. Yu^1,10  HansPeter Kriegel^1,13  Jiawei Han^1,14 

[1] Champaign, Urbana, IL, USA;Department of Computer Science, University of California, Santa Barbara, CA, USA;Department of Systems Engineering and Engineering Management, Chinese University of Hong Kong, Hong Kong, China;Institute for Informatics, Ludwig‐Max Planck Institute for Developmental Biology and Max Planck Institute for Biological Cybernetics, TüMaximilians‐School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA;UniversitäUniversity of Illinois at Chicago, Chicago, IL, USA;University of Illinois at Urbana‐Yahoo! Research, Santa Clara, CA, USA;bingen, Germany;nchen, Munich, Germany;t Mü

关键词: graph mining;    frequent subgraphs;    submodularity;    feature selection;    nested selection;   

DOI  :  10.1002/sam.10084

学科分类：社会科学、人文和艺术（综合）

来源: John Wiley & Sons, Inc.

【 授权许可】

Unknown