2009
DOI: 10.1007/978-3-642-02466-5_115
|View full text |Cite
|
Sign up to set email alerts
|

Community Detection of Time-Varying Mobile Social Networks

Abstract: Abstract. In this paper, we present our ongoing work on developing a framework for detecting time-varying communities on human mobile networks. We define the term community in environments where the mobility patterns and clustering behaviors of individuals vary in time. This work provides a method to describe, analyze, and compare the clustering behaviors of collections of mobile entities, and how they evolve over time.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 34 publications
(15 citation statements)
references
References 9 publications
0
15
0
Order By: Relevance
“…After building the aggregated contact graph, different social metrics can be obtained. For example, Hui, et al [79]- [82] proposed serval community detection approaches (simple, k-clique, modularity, etc.) with great potential to detect both static and temporal communities.…”
Section: A Social Graph and Contact Graphmentioning
confidence: 99%
See 1 more Smart Citation
“…After building the aggregated contact graph, different social metrics can be obtained. For example, Hui, et al [79]- [82] proposed serval community detection approaches (simple, k-clique, modularity, etc.) with great potential to detect both static and temporal communities.…”
Section: A Social Graph and Contact Graphmentioning
confidence: 99%
“…Therefore, the knowledge of community structures could help a routing protocol to choose better forwarding relays for particular destinations, and hence improve the chance of delivery. Many proposed community detection algorithms [50], [79]- [82] are available for identifying social communities from the contact graph of DTNs.…”
Section: B Communitymentioning
confidence: 99%
“…However, the community structure in [18] is detected based on the cumulative node contact characteristics, and is considered as fixed during the data forwarding process. Time-varying community structure is studied in [7], but is not specifically exploited for data forwarding. Comparatively, in this paper we exploit multiple perspectives of transient social contact patterns at the fine-grained scale to improve the effectiveness of data forwarding.…”
Section: Related Workmentioning
confidence: 99%
“…Non-negative matrix factorization was introduced to evolution analysis [16] as well. Besides these algorithms concerned with the evolution procedures of communities, community detection in dynamic social networks aims to detect the optimal community partition at each timestamp [4,7,[17][18][19]. Moreover, in order to describe the change of communities at different timestamps, tracking algorithms [20,21] based on similarity comparison have also been studied.…”
Section: Open Accessmentioning
confidence: 99%