Accurate and scalable nearest neighbors in large networks based on effective importance

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2013, Pages 1009-1018

  Bogdanov, Petko ^a   Singh, Ambuj ^a  

^a University of California   (United States)

Author keywords

Effective Importance; Graph search; Nearest neighbors; Random walks; Sparsification

Indexed keywords

EFFECTIVE IMPORTANCE; GRAPH SEARCH; NEAREST NEIGHBORS; RANDOM WALK; SPARSIFICATION;

INFORMATION SERVICES;

KNOWLEDGE MANAGEMENT;

EID: 84889562703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505522     Document Type: Conference Paper

References (36)

1. Biogrid: General repository for interaction datasets. http://www.thebiogrid.org/, 2006.
2. K. J. Ahn, S. Guha, and A. McGregor. Graph sketches: sparsification, spanners, and subgraphs. In Proceedings of the 31st symposium on Principles of Database Systems, pages 5-14. ACM, 2012.
3. R. Andersen and F. Chung. Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. Theory and Applications of Models of Computation, 4484/2007:1-12, 2007.
4. R. Andersen, F. Chung, and K. Lang. Local Graph Partitioning using PageRank Vectors. FOCS, pages 475-486, 2006.
5. N. T. K. Anh, V. M. Thanh, and N. V. Linh. Efficient label propagation for classification on information networks. In Proceedings of the Third Symposium on Information and Communication Technology, SoICT '12, pages 41-46, New York, NY, USA, 2012. ACM.
6. A.-L. Barabasi. Linked: the new science of networks. Perseus Publishing, 2002.
7. P. Berkhin. Bookmark-coloring algorithm for personalized pagerank computing. Internet Math, 3:2006.
8. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In Proceedings of the International Conference on Machine Learning (ICML), 2006.
9. B. Bollobas. Modern Graph Theory. Springer, July 1998.
10. Y.-Y Chen, Q. Gan, and T. Suel. Local methods for estimating pagerank values. In CIKM, pages 381-389. ACM, 2004.
11. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
12. J. V. Davis and I. S. Dhillon. Estimating the global pagerank of web communities. In SIGKDD, pages 116-125. ACM, 2006.
13. C. Faloutsos, K. S. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. KDD, 2004.
14. D. Fogaras and B. Racz. Towards scaling fully personalized pagerank. In WAW, pages 105-117, 2004.
15. T. H. Haveliwala. Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. TKDE, 15:2003, 2003.
16. S. Hossain, P. Butler, A. P. Boedihardjo, and N. Ramakrishnan. Storytelling in entity networks to support intelligence analysts. In Proceedings of SIGKDD, 2012.
17. H. Hu, D. L. Lee, and J. Xu. Fast Nearest Neighbor Search on Road Networks. In EDBT, pages 186-203, 2006.
18. G. Jeh and J. Widom. Simrank: a measure of structural-context similarity. In SIGKDD, pages 538-543. ACM, 2002.
19. G. Jeh and J. Widom. Scaling personalized web search. WW, 2003.
20. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing, 20(1):359-392, 1998.
21. Y Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. KDD, 06, 2006.
22. R. Kumar, A. Tomkins, and E. Vee. Connectivity structure of bipartite graphs via the knc-plot. In Proceedings of WSDM, 2008.
23. L. Lovász. Random Walks on Graphs: A Survey. Combinatorics, Paul Erdos is Eighty, 2:1-46, 1993.
24. L. Lovasz and M. Simonovits. The mixing rate of markov chains, an isoperimetric inequality, and computing the volume. In SFCS, 1990.
25. K. L. McGary, I. Lee, and E. M. Marcotte. Broad network-based predictability of Saccharomyces cerevisiae gene loss-of-functionphenotypes. Genome biology, 8(12):R258, 2007.
26. A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Growth of the flickr social network. In WOSN, 2008.
27. E. Nabieva, K. Jim, A. Agarwal, B. Chazelle, and M. Singh. Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps. Bioinformatics, 21(1):302-310, 2005.
28. F. Nie, S. Xiang, Y Liu, and C. Zhang. A general graph-based semi-supervised learning with novel class discovery. Neural Computing and Applications, 19(4):549-555, 2010.
29. H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD, 2008.
30. P. Sarkar and A. W. Moore. A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In UAI, 2007.
31. P. Sarkar, A. W. Moore, and A. Prakash. Fast incremental proximity search in large graphs. In ICML, New York, New York, USA, 2008.
32. V Satuluri, S. Parthasarathy, and Y Ruan. Local graph sparsification for scalable clustering. In Proceedings of the 2011 international conference on Management of data, pages 721-732. ACM, 2011.
33. H. Tong, C. Faloutsos, and Y Koren. Fast direction-aware proximity for graph mining. SIGKDD, 2007.
34. H. Tong, H. Qu, and H. Jamjoom. Measuring Proximity on Graphs with Side Information. ICDM, 2008.
35. H. Tong, H. Qu, H. Jamjoom, and C. Faloutsos. iPoG: Fast Interactive Proximity Querying on Graphs. CIKM, pages 1673-1676, 2009.
36. Y. Wu and L. Raschid. Approxrank: Estimating rank for a subgraph. ICDE, pages 54-65, 2009.