Spectral analysis of k-balanced signed graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6635 LNAI, Issue PART 2, 2011, Pages 1-12

  Wu, Leting ^a   Ying, Xiaowei ^a   Wu, Xintao ^a   Lu, Aidong ^a   Zhou, Zhi Hua ^b  

^a UNIVERSITY OF NORTH CAROLINA AT CHARLOTTE   (United States)

^b NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH STRUCTURES; GRAPHIC METHODS; SPECTRUM ANALYSIS;

ADJACENCY MATRICES; EMPIRICAL EVALUATIONS; SIGNED GRAPHS; SPECTRAL PATTERNS; SPECTRAL SPACES; THEORETICAL STUDY;

DATA MINING;

EID: 79957965699     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20847-8_1     Document Type: Conference Paper

References (12)

1. Bansal, N., Chawla, S.: Correlation clustering. Machine Learning 56, 238-247 (2002)
2. Davis, J.A.: Clustering and structural balance in graphs. Human Relations 20, 181-187 (1967)
3. Demaine, E.D., Immorlica, N.: Correlation clustering with partial information. In: Working Notes of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 1-13 (2003)
4. Hage, P., Harary, F.: Structural models in anthropology, pp. 56-60. Cambridge University Press, Cambridge (1983)
5. Inohara, T.: Characterization of clusterability of signed graph in terms of newcomb's balance of sentiments. Applied Mathematics and Computation 133, 93-104 (2002)
6. Kunegis, J., Lommatzsch, A., Bauckhage, C.: The slashdot zoo: mining a social network with negative edges. In: WWW 2009, pp. 741-750 (2009)
7. Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., Luca, E.W.D., Albayrak, S.: Spectral analysis of signed graphs for clustering, prediction and visualization. In: SDM, pp. 559-570 (2010)
8. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Signed networks in social media. In: CHI, pp. 1361-1370 (2010)
9. Prakash, B.A., Sridharan, A., Seshadri, M., Machiraju, S., Faloutsos, C.: EigenSpokes: Surprising patterns and scalable community chipping in large graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS, vol. 6119, pp. 435-448. Springer, Heidelberg (2010)
10. Stewart, G.W., Sun, J.: Matrix perturbation theory. Academic Press, London (1990)
11. Wu, L., Ying, X., Wu, X., Zhou, Z.-H.: Line orthogonality in adjacency eigenspace and with application to community partition. Technical Report, UNC Charlotte (2010)
12. Ying, X., Wu, X.: On randomness measures for social networks. In: SDM, pp. 709-720 (2009)