ISCoDe: A framework for interest similarity-based community detection in social networks

2011 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2011

Volumn , Issue , 2011, Pages 912-917

  Jaho, Eva ^a   Karaliopoulos, Merkouris ^a   Stavrakakis, Ioannis ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNITY DETECTION; GRAPH EDGES; LOW DEGREE; NODE CLUSTERING; SOCIAL NETWORKS; SOCIAL STATUS; SYNTHETIC NETWORKS; USER SELECTION; WEIGHTED GRAPH;

POPULATION DYNAMICS;

SOCIAL NETWORKING (ONLINE);

EID: 79960615369     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2011.5928942     Document Type: Conference Paper

References (20)

1. S. M. Allen, G. Colombo, and R. M. Whitaker. Cooperation through self-similar social networks. ACM Trans. Auton. Adapt. Syst., 5(1):4:1-4:29, February 2010.
2. U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner. On modularity clustering. IEEE Trans. on Knowl. And Data Eng., 20:172-188, February 2008.
3. U. Brandes and T. Erlebach. Network Analysis: Methodological Foundations (LNCS), volume 3418. Springer, Heidelberg, March 2005.
4. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6):066111+,December 2004.
5. J. Cohen. Statistical Power Analysis for the Behavioral Sciences (2nd Edition). Routledge Academic, 2 edition, January 1988.
6. J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Physical Review E, 72(2):027104+, August 2005
7. Y. Fan, M. Li, P. Zhang, J. Wu, and Z. Di. The effect of weight on community structure of networks. Physica A: Statistical Mechanics and its Applications, 378(2):583-590, May 2007.
8. A. Fernández and S. Gómez. Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms. J. Classif., 25:43-65, June 2008.
9. S. Fortunato and M. Barthélemy. Resolution limit in community detection. Proc Natl Acad Sci (USA), 104(1):36-41, January 2007.
10. E. Jaho, M. Karaliopoulos, and I. Stavrakakis. Social similarity as a driver for selfish, cooperative and altruistic behavior. In 4th IEEE WoWMoM Workshop on AOC'10, Montreal, Canada, June 2010.
11. B. W. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. The Bell system technical J., 49(1):291-307, 1970.
12. S. Kullback. Information theory and statistics. J. Wiley and Sons., 1959.
13. R. D. Mori. Spoken Dialogues with Computers. Academic Press, Inc., Orlando, FL, USA, 1997.
14. M. E. J. Newman. Analysis of weighted networks. Phys. Rev. E, 70(5):056131, November 2004.
15. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69:066133, September 2004.
16. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(2):026113+, Feb. 2004.
17. A. Pothen, H. D. Simon, and K. P. Liou. Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. Matrix Anal. Appl, 11(3):430-452, May 1990.
18. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. Proc Natl Acad Sci USA, 101(9):2658-2663, March 2004.
19. J. Reichardt and S. Bornholdt. Statistical mechanics of community detection. Physical Review E, 74(1):016110+, July 2006.
20. J. Vegelius, S. Janson, and F. Johansson. Measures of similarity between distributions. Quality and Quantity, 20(4):437-441, December 1986.