Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Community Detection in Social Network using Temporal Data (1904.05291v1)

Published 10 Apr 2019 in cs.SI and physics.soc-ph

Abstract: Social networks facilitate the social space where actors or the users have ties among them. The ties and their patterns are based on their life styles and communication. Similarly, in online social media networks like Facebook, Twitter, Myspace etc., multiple users belong to multiple specific communities. The social network represents large real-world directed social graphs. Detection of communities or clusters from these graphs is a problem of considerable research interest. The communities are formed using the neighboring nodes that have common edges and common attributes. Most of the existing community detection algorithms usually consider node contents to analyze the attributes of community. Some algorithms use the links between the nodes to determine the dense regions in the graph. But utilizing both the edge content and the vertex content to detect community are yet to be considered and verified, since the traditional extraction methods of vertex and edge data do not consider the connectivity among the nodes. This paper presents an Interlinked Spatial Clustering Model (ILSCM) which provides relevant content selection and extraction of the temporal topics for identifying the betweenness among the nodes based on the context keys to detect community.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
Citations (4)

Summary

We haven't generated a summary for this paper yet.