A tractable approach to finding closest truncated-commute-time neighbors in large graphs

Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, UAI 2007

Volumn , Issue , 2007, Pages 335-343

  Sarkar, Purnamrita ^a   Moore, Andrew W ^b  

^a Carnegie Mellon University ^*  (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE NEAREST NEIGHBOR; COLLABORATIVE FILTERING; COMPUTATION TIME; FRAUD DETECTION; GRAPH-BASED LEARNING; LARGE GRAPHS; LINK PREDICTION; NOVEL ALGORITHM; PROXIMITY MEASURE; RANDOM WALK; SOCIAL NETWORKS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; RANDOM PROCESSES;

GRAPHIC METHODS;

EID: 80053203488     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Aldous, D., & Fill, J. A. (2001). Reversible markov chains.
2. Brand, M. (2005). A Random Walks Perspective on Maximizing Satisfaction and Profit. SIAM '05.
3. Chandra, A. K., Raghavan, P., Ruzzo, W. L., & Smolensky, R. (1989). The electrical resistance of a graph captures its commute and cover times. STOC'89 (pp. 574-586).
4. Doyle, P. G., & Snell, J. L. (1984). Random walks and electric networks. The Mathematical Assoc. of America.
5. Gorelick, L., Galun, M., Sharon, E., Basri, R., & Brandt, A. (2004). Shape representation and classification using the poisson equation. CVPR.
6. Grady, L., & Schwartz, E. L. (2006a). Isoperimetric graph partitioning for data clustering and image segmentation. IEEE PAMI
7. Grady, L., & Schwartz, E. L. (2006b). Isoperimetric partitioning: A new algorithm for graph partitioning. SIAM Journal on Scientific Computing.
8. Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika.
9. Krauthgamer, R., & Lee, J. R. (2003). The intrinsic dimensionality of graphs. Proceedings of the STOC'03.
10. Liben-Nowell, D., & Kleinberg, J. (2003). The link prediction problem for social networks. CIKM '03.
11. Lovasz, L. (1996). Random walks on graphs: a survey.
12. Milgram, S. (1967). The small world problem. Psychology Today.
13. Ng, A., Jordan, M., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm.
14. Qiu, H., & Hancock, E. R. (2005). Image segmentation using commute times. Proc. BMVC.
15. Qiu, H., & Hancock, E. R. (2006). Robust multi-body motion tracking using commute time clustering. ECCV'06.
16. Saerens, M., Fouss, F., Yen, L., & Dupont, P. (2004). The principal component analysis of a graph and its relationships to spectral clustering.
17. Smola, A., & Kondor, R. (2003). Kernels and regularization on graphs.
18. Yen, L., Vanvyve, L., Wouters, D., Fouss, F., Verleysen, F., & Saerens, M. (2005). Clustering using a random-walk based distance measure.
19. Zhu, X., Ghahramani, Z., & Lafferty, J. (2003). Semisupervised learning using gaussian fields and harmonic functions.