Spectral analysis of signed graphs for clustering, prediction and visualization

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 559-570

  Kunegis, Jerome ^a   Schmidt, Stephan ^a   Lommatzsch, Andreas ^a   Lerner, Jürgen ^b   De Luca, Ernesto W ^a   Albayrak, Sahin ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DRAWING (GRAPHICS); SPACE DIVISION MULTIPLE ACCESS; SPECTRUM ANALYSIS; VISUALIZATION;

CHARACTERISTIC MATRICES; ELECTRICAL NETWORKS; GRAPH CLUSTERING; GRAPH LAPLACIAN; NETWORK VISUALIZATION; SPECTRAL CLUSTERING; SPECTRAL CLUSTERING METHODS; VISUALIZATION METHOD;

DATA MINING;

EID: 84880094149     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.49     Document Type: Conference Paper

References (24)

1. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems, pages 585-591, 2002.
2. U. Brandes, D. Fleischer, and J. Lerner. Summarizing dynamic bipolar conflict structures. Trans. on Visualization and Computer Graphics, 12(6):1486-1499, 2006.
3. P. Chebotarev and E. V. Shamis. On proximity measures for graph vertices. Automation and Remote Control, 59(10):1443-1459, 1998.
4. F. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
5. M. Desai and V. Rao. A characterization of the smallest eigenvalue of a graph. Graph Theory, 18(2):181-194, 1994.
6. I. S. Dhillon, Y. Guan, and B. Kulis. Kernel k-means: Spectral clustering and normalized cuts. In Proc. Int. Conf. Knowledge Discovery and Data Mining, pages 551-556, 2004.
7. F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. Trans. on Knowledge and Data Engineering, 19(3):355-369, 2007.
8. C. Gkantsidis, M. Mihail, and E. Zegura. Spectral analysis of Internet topologies. In Proc. Joint Conf. IEEE Computer and Communications Societies, pages 364-374, 2003.
9. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval, 4(2):133-151, 2001.
10. P. Hage and F. Harary. Structural Models in Anthropology. Cambridge University Press, 1983.
11. F. Harary. On the notion of balance of a signed graph. Michigan Math., 2(2):143-146, 1953.
12. Y. Hou. Bounds for the least Laplacian eigenvalue of a signed graph. Acta Mathematica Sinica, 21(4):955-960, 2005.
13. T. Ito, M. Shimbo, T. Kudo, and Y. Matsumoto. Application of kernels to link analysis. In Proc. Int. Conf. on Knowledge Discovery in Data Mining, pages 586-592, 2005.
14. D. J. Klein and M. Randić. Resistance distance. Mathematical Chemistry, 12(1):81-95, 1993.
15. R. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proc. Int. Conf. on Machine Learning, pages 315-322, 2002.
16. Y. Koren, L. Carmel, and D. Harel. ACE: A fast multiscale eigenvectors computation for drawing huge graphs. In Symposium on Information Visualization, pages 137-144, 2002.
17. J. Kunegis, A. Lommatzsch, and C. Bauckhage. The Slashdot Zoo: Mining a social network with negative edges. In Proc. Int. World Wide Web Conf., pages 741-750, 2009.
18. J. Kunegis, S. Schmidt, C. Bauckhage, M. Mehlitz, and S. Albayrak. Modeling collaborative similarity with the signed resistance distance kernel. In Proc. European Conf. on Artificial Intelligence, pages 261-265, 2008.
19. M. Lien and W. Watkins. Dual graphs and knot invariants. Linear Algebra and its Applications, 306(1):123-130, 2000.
20. U. v. Luxburg. A tutorial on spectral clustering. Statistics and Computing, 17(4):395-416, 2007.
21. P. Massa and P. Avesani. Controversial users demand local trust metrics: an experimental study on epin-ions.com community. In Proc. American Association for Artificial Intelligence Conf., pages 121-126, 2005.
22. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems, pages 849-856, 2001.
23. K. E. Read. Cultures of the Central Highlands, New Guinea. Southwestern J. of Anthropology, (1):1-43, 1954.
24. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.