Information flow using edge stress factor

This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically. A novel algorithm based on the concept of Edge Stress Factor is proposed and validated. Results show that this approach is fast and effective in studying collaborative behavior. Categories and Subject Descriptors G.2.2 [Discrete Mathematics]: Graph Theory ? graph algorithms. General Terms: Algorithms, Experimentation.

• Type: Conference
• Year: 2005
• Where: WWW
• Authors: Franco Salvetti, Savitha Srinivasan
• Keywords: Edge Stress Factor, Graph Algorithms, Internet Technology, Subject Descriptors, WWW 2005