Independent informative subgraph mining for graph information retrieval

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 563-572

  Sun, Bingjun ^a   Mitra, Prasenjit ^b   Giles, C Lee ^b  

^a The Pennsylvania State University   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Feature selection; Graph mining; Graph search; Index pruning

Indexed keywords

FEATURE SELECTION; GRAPH DATABASE; GRAPH INDEX; GRAPH INFORMATION; GRAPH MINING; GRAPH QUERIES; GRAPH SEARCH; GRAPH SEARCH METHODS; GRAPH SET; KEY ISSUES; MUTUAL INFORMATIONS; RESPONSE TIME; SUBGRAPH ISOMORPHISM; SUBGRAPH MINING; SUBGRAPHS;

INFORMATION SERVICES; KNOWLEDGE MANAGEMENT; SET THEORY;

FEATURE EXTRACTION;

EID: 74549174134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646026     Document Type: Conference Paper

References (29)

1. B. Berendt. Using and learning semantics in frequent subgraph mining. In Proc. WEBKDD, 2005.
2. C. Borgelt and M. R. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In Proc. ICDM, 2002.
3. S. Buttcher and C. L. A. Clarke. A document-centric approach to static index pruning in text retrieval systems. In Proc. CIKM, 2006.
4. D. Carmel, D. Cohen, R. Fagin, E. Farchi, M. Herscovici, Y. Maarek, and A. Soffer. Static index pruning for information retrieval systems. In Proc. SIGIR, 2001.
5. B. Chen, Q. Zhao, B. Sun, and P. Mitra. Temporal and social network based blogging behavior prediction in blogspace. In Proc. ICDM, 2007.
6. I. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: Towards verification-free query processing on graph databases. In Proc. SIGMOD, 2007.
7. E. S. de Moura, C. F. dos Santos, D. R. Fernandes, A. S. Silva, P. Calado, and M. A. Nascimento. Improving web search effciency via a locality based static pruning method. In Proc. WWW, 2005.
8. L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compounds. In Proc. SIGKDD, 1998.
9. I. Fischer and T. Meinl. Graph based molecular data mining - an overview. In Proc. IEEE International Conference on Systems, Man and Cybernetics, 2004.
10. J. Huan, W. Wang, and J. Prins. Effcient mining of frequent subgraph in the presence of isomophism. In Proc. ICDM, 2003.
11. A. Inokuchi. Mining generalized substructures from a set of labeled graphs. In Proc. ICDM, 2004.
12. H. Jiang, H. Wang, P. S. Yu, and S. Zhou. Gstring: A novel approach for effcient search in graph databases. In Proc. ICDE, 2007.
13. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. ICDM, 2001.
14. S. Lawrence, C. L. Giles, and K. Bollacker. Digital libraries and autonomous citation indexing. IEEE Computer, 32(6):67-71, 1999.
15. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In Proc. SIGKDD, 2004.
16. H. Peng, F. Long, and C. Ding. Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy. IEEE Transactions on PAMI, 27(8):1226-1238, 2005.
17. J. W. Raymond, E. J. Gardiner, and P. Willet. Rascal: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal, 45(6), 2002.
18. D. Shasha, J. T. L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In Proc. PODS, 2002.
19. S. Srinivasa and S. Kumar. A platform based on the multi-dimensional data model for analysis of bio-molecular structures. In Proc. VLDB, pages 975-986, 2003.
20. B. Sun, P. Mitra, and C. L. Giles. Mining, indexing, and searching for textual chemical molecule information on the web. In Proc. WWW, 2008.
21. B. Sun, P. Mitra, H. Zha, C. L. Giles, and J. Yen. Topic segmentation with shared topic detection and alignment of multiple documents. In Proc. SIGIR, 2007.
22. B. Sun, Q. Tan, P. Mitra, and C. L. Giles. Extraction and search of chemical formulae in text documents on the web. In Proc. WWW, 2007.
23. B. Sun, D. Zhou, H. Zha, and J. Yen. Multi-task text segmentation and alignment based on weighted mutual information. In Proc. CIKM, 2006.
24. M. Worlein, T. Meinl, I. Fischer, and M. Philippsen. A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. In Proc. PKDD, 2005.
25. X. Yan and J. Han. Closegraph: Mining closed frequent graph patterns. In Proc. SIGKDD, 2003.
26. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In Proc. SIGMOD, 2004.
27. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In Proc. SIGMOD, 2005.
28. P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: Tree + delata >= graph. In Proc. VLDB, 2007.
29. Q. Zhao, L. Chen, S. S. Bhowmick, and S. Madria. Xml structural delta mining: issues and challenges. Data and Knowledge Engineering, 2006.