Clustering via random walk hitting time on directed graphs

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 616-621

  Chen, Mo ^a   Liu, Jianzhuang ^a   Tang, Xiaoou ^a,b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING METHODS; DATA CLUSTERING ALGORITHMS; DEPENDENCE RELATIONS; DIRECTED GRAPHS; DISJOINT SETS; GLOBAL INFORMATIONS; GLOBAL STRUCTURES; GRAPH BASED; HITTING TIMES; LOCAL DENSITIES; LOCAL DISTRIBUTIONS; MARKOV RANDOM WALKS; PAIRWISE SIMILARITIES; PROBABILISTIC RELATIONS; RANDOM WALKS; SIMILARITY MEASURES; TRANSITION MATRIXES; UNDIRECTED GRAPHS;

ARTIFICIAL INTELLIGENCE; BIONICS; GRAPH THEORY; PROBABILITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

CLUSTERING ALGORITHMS;

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

References (13)

1. Aldous, D., and Fill, J. 2001. Reversible Markov Chains and Random Walks on Graphs. Book in preparation.
2. Brand, M. 2005. A random walks perspective on maximizing satisfaction and profit. Proceedings of the 2005 SIAM International Conference on Data Mining.
3. Doyle, P., and Snell, J. 1984. Random walks and electric networks.
4. Fouss, F.; Pirotte, A.; Renders, J.; and Saerens, M. 2007. Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering 19(3):355-369.
5. Hastie, T.; Tibshirani, R.; and Friedman, J. 2001. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer.
6. Klein, D., and Randić, M. 1993. Resistance distance. Journal of Mathematical Chemistry 12(1):81-95.
7. Langville, A., and Meyer, C. 2005. Deeper inside PageRank. Internet Mathematics.
8. Meila, M., and Shi, J. 2001. A random walks view of spectral segmentation. AI and Statistics (AISTATS).
9. Nadler, B., and Galun, M. 2007. Fundamental limitations of spectral clustering. Advances in Neural Information Processing Systems.
10. Ng, A.; Jordan, M.; and Weiss, Y. 2001. On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems.
11. Shi, J., and Malik, J. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8).
12. Srivastava, S., and Gupta, M. 2006. Distribution-based Bayesian minimum expected risk for discriminant analysis. IEEE International Symposium on Information Theory 2294-2298.
13. Yu, S., and Shi, J. 2003. Multiclass spectral clustering. Proceedings of Ninth IEEE International Conference on Computer Vision 313-319.