Community Detection in Social Network with Node Attributes based on Formal Concept Analysis

被引:5
作者
Khediri, Nourhene [1 ]
Karoui, Wafa [1 ,2 ]
机构
[1] Univ Sousse, Lab MARS, LR17ES05, ISITCom, Hammam Sousse 4011, Tunisia
[2] Univ Tunis El Manar, Inst Super Informat, Ariana 2080, Tunisia
来源
2017 IEEE/ACS 14TH INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS (AICCSA) | 2017年
关键词
Social networks; community detection; Formal Concept Analysis; maximal clique; homophily;
D O I
10.1109/AICCSA.2017.200
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As far as social networks are concerned, new applications appear to analyze them. Community detection is one of the most important issues. It allows to understand the structure of complex networks and to extract useful information from the detected communities. Users have usually a social interaction with their friends because of their common interests or their similar profiles. In this paper, attributed graphs are considered, where entities of the network are described using attributes with several modalities. Then, we propose an hybrid approach based on Formal Concept Analysis (FCA) for community detection in social network with node attributes. This method, called ACDC (Attributed Community Detection based on Concepts), combines the structure of the network and the attributes of the nodes. ACDC, semantically and statically, partitions an assigned graph into k densely connected communities, using maximal cliques, with homogeneous attribute values derived from FCA. Experimental results demonstrate the effectiveness of ACDC through comparison with the state-of-the-art graph clustering and methods. Our method provides also more meaningful communities than conventional methods that consider only relationship information.
引用
收藏
页码:1346 / 1353
页数:8
相关论文
共 24 条
[1]   CFinder:: locating cliques and overlapping modules in biological networks [J].
Adamcsek, B ;
Palla, G ;
Farkas, IJ ;
Derényi, I ;
Vicsek, T .
BIOINFORMATICS, 2006, 22 (08) :1021-1023
[2]  
Adamic LA, 2005, P 3 INT WORKSH LINK, P36
[3]  
Ali Selmane Sid, 2014, Foundations of Intelligent Systems. 21st International Symposium, ISMIS 2014. Proceedings: LNCS 8502, P61, DOI 10.1007/978-3-319-08326-1_7
[4]  
Amor S. Ben, JOURN FRANC ING CONN
[5]   Finding and evaluating community structure in networks [J].
Newman, MEJ ;
Girvan, M .
PHYSICAL REVIEW E, 2004, 69 (02) :026113-1
[6]   FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].
BRON, C ;
KERBOSCH, J .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577
[7]  
Dang T. A., INT C DIG SOC ICDS 2, P341
[8]   An Analysis of Overlapping Community Detection Algorithms in Social Networks [J].
Devi, J. Chitra ;
Poovammal, E. .
TWELFTH INTERNATIONAL CONFERENCE ON COMMUNICATION NETWORKS, ICCN 2016 / TWELFTH INTERNATIONAL CONFERENCE ON DATA MINING AND WAREHOUSING, ICDMW 2016 / TWELFTH INTERNATIONAL CONFERENCE ON IMAGE AND SIGNAL PROCESSING, ICISP 2016, 2016, 89 :349-358
[9]   Community detection in graphs [J].
Fortunato, Santo .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2010, 486 (3-5) :75-174
[10]  
Ganter B., 2005, Formal Concept Analysis: Foundations and Applications.