IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Data Mining Techniques for Communities’ Detection in Dynamic Social Networks

Data Mining Techniques for Communities’ Detection in Dynamic Social Networks
View Sample PDF
Author(s): Céline Robardet (Université de Lyon, France)
Copyright: 2011
Pages: 15
Source title: Handbook of Research on Methods and Techniques for Studying Virtual Communities: Paradigms and Phenomena
Source Author(s)/Editor(s): Ben Kei Daniel (University of Saskatchewan, Canada)
DOI: 10.4018/978-1-60960-040-2.ch005

Purchase

View Data Mining Techniques for Communities’ Detection in Dynamic Social Networks on the publisher's website for pricing and purchasing information.

Abstract

Social network analysis studies relationships between individuals and aims at identifying interesting substructures such as communities. This type of network structure is intuitively defined as a subset of nodes more densely linked, when compared with the rest of the network. Such dense subgraphs gather individuals sharing similar property depending on the type of relation encoded in the graph. In this chapter we tackle the problem of identifying communities in dynamic networks where relationships among entities evolve over time. Meaningful patterns in such structured data must capture the strong interactions between individuals but also their temporal relationships. We propose a pattern discovery method to identify evolving patterns defined by constraints. In this paradigm, constraints are parameterized by the user to drive the discovery process towards potentially interesting patterns, with the positive side effect of achieving a more efficient computation. In the proposed approach, dense and isolated subgraphs, defined by two user-parameterized constraints, are first computed in the dynamic network restricted at a given time stamp. Second, the temporal evolution of such patterns is captured by associating a temporal event types to each subgraph. We consider five basic temporal events: the formation, dissolution, growth, diminution and stability of subgraphs from one time stamp to the next one. We propose an algorithm that finds such subgraphs in a time series of graphs processed incrementally. The extraction is feasible thanks to efficient pruning patterns strategies. Experimental results on real-world data confirm the practical feasibility of our approach. We evaluate the added-value of the method, both in terms of the relevancy of the extracted evolving patterns and in terms of scalability, on two dynamic sensor networks and on a dynamic mobility network.

Related Content

Kumar Shalender, Babita Singla. © 2024. 11 pages.
R. Akash, V. Suganya. © 2024. 32 pages.
Prathmesh Singh, Arnav Upadhyaya, Nripendra Singh. © 2024. 14 pages.
Arpan Anand, Priya Jindal. © 2024. 13 pages.
Surjit Singha, K. P. Jaheer Mukthar. © 2024. 26 pages.
M. Vaishali, V. Kiruthiga. © 2024. 14 pages.
Ranjit Singha, Surjit Singha. © 2024. 21 pages.
Body Bottom