Local Flow Betweenness Centrality for Clustering Community Graphs

• Published in: Internet and Network Economics pp. 531 - 544
• Main Authors: Salvetti, Franco, Srinivasan, Savitha
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005
• Series: Lecture Notes in Computer Science
• Subjects: Betweenness Centrality; Community Detection; Instant Message; Social Network Analysis; Subject Matter Expert
• ISBN: 3540309004; 9783540309000
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11600930_53

The problem of information flow is studied to identify de facto communities of practice from tacit knowledge sources that reflect the underlying community structure, using a collection of instant message logs. We characterize and model the community detection problem using a combination of graph theory and ideas of centrality from social network analysis. We propose, validate, and develop a novel algorithm to detect communities based on computation of the Local Flow Betweenness Centrality. Using LFBC, we model the weights on the edges in the graph so we can extract communities. We also present how to compute efficiently LFBC on relevant edges without having to recalculate the measure for each edge in the graph during the process. We validate our algorithms on a corpus of instant messages that we call MLog. Our results demonstrate that MLogs are a useful source for community detection that can augment the study of collaborative behavior.