Community
detection and retrieval are the most relevant and important topics in graph
mining. Hence it is treated as one of the important applications in the field
of social network analysis. Community detection plays an important role in a
large community graph by enabling and selecting the desired community’s
sub-graph. This chapter proposes an algorithm that detects and extracts the
desired sub-community graph from a compressed community graph for further
analysis purposes. It presents both theoretical and experimental results with
three benchmark social networks.
Author(s) Details
Bapuji Rao
Department of CSEA, Indira Gandhi Institute of Technology, Sarang, Dhenkanal, Dist-Odisha, India
Prof. (Dr.) Sarojananda Mishra
Department of CSEA, Indira Gandhi Institute of Technology, Sarang, Dhenkanal, Dist-Odisha, India.
View Book :- http://bp.bookpi.org/index.php/bpi/catalog/book/200
Author(s) Details
Bapuji Rao
Department of CSEA, Indira Gandhi Institute of Technology, Sarang, Dhenkanal, Dist-Odisha, India
Prof. (Dr.) Sarojananda Mishra
Department of CSEA, Indira Gandhi Institute of Technology, Sarang, Dhenkanal, Dist-Odisha, India.
View Book :- http://bp.bookpi.org/index.php/bpi/catalog/book/200
No comments:
Post a Comment