gApprox: Mining frequent approximate patterns from a massive network

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 445-450

  Chen, Chen ^a   Yan, Xifeng ^b   Zhu, Feida ^a   Han, Jiawei ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL NETWORKS; COMPLEX STRUCTURES; DATA MINING METHODS; EMPIRICAL STUDIES; GRAPH MINING; INHERENT NOISE; INTERNATIONAL CONFERENCES; KNOWLEDGE DISCOVERY; MINING PROCESSING; NETWORK PATTERNS; NEW APPLICATIONS; NOVEL TECHNIQUES; OF GRAPHS; PATTERN SPACE; PROTEIN-PROTEIN INTERACTION NETWORK; SOCIAL NETWORKS; STRUCTURAL DATA; SYNTHETIC DATA SETS;

ADMINISTRATIVE DATA PROCESSING; CHLORINE COMPOUNDS; DATA MINING; DATA STRUCTURES; DECISION SUPPORT SYSTEMS; GRAPH THEORY; INFORMATION MANAGEMENT; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE MANAGEMENT; SEARCH ENGINES;

MINING;

EID: 49749102365     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.36     Document Type: Conference Paper

References (10)

1. J. Chen, W. Hsu, M.-L. Lee, and S.-K. Ng. Nemofinder: dissecting genome-wide protein-protein interactions with meso-scale network motifs. In KDD, pages 106-115, 2006.
2. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. IJPRAI, 18(3):265-298, 2004.
3. M. Koyutürk, A. Grama, and W. Szpankowski. Pairwise local alignment of protein interaction networks guided by models of evolution. In RECOMB, pages 48-65, 2005.
4. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
5. M. Kuramochi and G. Karypis. Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov., 11(3):243-271, 2005.
6. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
7. F. Schreiber and H. Schwöbbermeyer. Frequency concepts and pattern detection for the analysis of motifs in networks. Transactions on Computational Systems Biology, 3 (LNBI 3737):89-104, 2005.
8. Y. Tian, R. C. McEachin, C. Santos, D. J. States, and J. M. Patel. SAGA: a subgraph matching tool for biological graphs. Bioinformatics, pages 232-239, 2006.
9. N. Vanetik, S. E. Shimony, and E. Gudes. Support measures for graph data. Data Min. Knowl. Discov., 13(2):243-260, 2006.
10. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.