Context-Aware Object Connection Discovery in Large Graphs

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 856-867

  Cheng, James ^a   Ke, Yiping ^b   Ng, Wilfred ^a   Yu, Jeffrey Xu ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; BREAK DOWN; CONTEXT-AWARE; COUNTER-TERRORISM OPERATIONS; INDIVIDUAL OBJECTS; LARGE GRAPHS; REAL PROBLEMS; STATE-OF-THE-ART ALGORITHMS; SUBGRAPH; TERRORIST GROUPS; THREE ORDERS OF MAGNITUDE;

EID: 67649657672     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.87     Document Type: Conference Paper

References (20)

1. X. Yan, P. S. Yu, and J. Han, "Graph indexing based on discriminative frequent structure analysis," ACM TODS, vol. 30, pp. 960 -993, 2005.
2. J. Cheng, Y. Ke, W. Ng, and A. Lu, "Fg-index: towards verification-free query processing on graph databases," in SIGMOD, 2007, pp. 857 -872.
3. P. Zhao, J. X. Yu, and P. S. Yu, "Graph indexing: Tree + delta >= graph," in VLDB, 2007, pp. 938-949.
4. Y. Ke, J. Cheng, and W. Ng, "Correlation search in graph databases," in KDD, 2007, pp. 390 -399.
5. Y. Ke, J. Cheng, and W. Ng, "Efficient correlation search from graph databases," To appear in TKDE, 2008.
6. A. Inokuchi, T. Washio, and H. Motoda, "An apriori-based algorithm for mining frequent substructures from graph data," in PKDD, 2000, pp. 13 -23.
7. X. Yan and J. Han, "Closegraph: mining closed frequent graph patterns," in KDD, 2003, pp. 286 -295.
8. J. Huan, W. Wang, J. Prins, and J. Yang, "Spin: mining maximal frequent subgraphs from graph databases," in KDD, 2004, pp. 581 -586.
9. C. Faloutsos, K. S. McCurley, and A. Tomkins, "Fast discovery of connection subgraphs," in KDD, 2004, pp. 118 -127.
10. H. Tong and C. Faloutsos, "Center-piece subgraphs: problem definition and fast solutions," in KDD, 2006, pp. 404 -413.
11. Y. Koren, S. C. North, and C. Volinsky, "Measuring and extracting proximity in networks," in KDD, 2006, pp. 245 -255.
12. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, p. 066113, 2004.
13. M. E. J. Newman, "Fast algorithm for detecting community structure in networks," Physical Review E, vol. 69, p. 066133, 2004.
14. F. Wu and B. A. Huberman, "Finding communities in linear time: a physics approach," The European Physical Journal B - Condensed Matter and Complex Systems, vol. 38, no. 2, pp. 331 -338, 2004.
15. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Trawling the web for emerging cyber-communities," Comput. Netw., vol. 31, no. 11-16, pp. 1481 -1493, 1999.
16. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "Extracting large-scale knowledge bases from the web," in VLDB, 1999, pp. 639 -650.
17. R. Kumar, U. Mahadevan, and D. Sivakumar, "A graph-theoretic approach to extract storylines from search results," in KDD, 2004, pp. 216 -225.
18. D. Gibson, R. Kumar, and A. Tomkins, "Discovering large dense subgraphs in massive graphs," in VLDB, 2005, pp. 721 -732.
19. Y. Dourisboure, F. Geraci, and M. Pellegrini, "Extraction and classification of dense communities in the web," in WWW, 2007, pp. 461 -470.
20. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Physical Review E, vol. 70, p. 066111, 2004.