Information networks represent relations in data, relationships typically ignored in iid (independent and identically distributed) data. Such networks abound, like coauthorships in bibliometrics, cellphone call graphs in telecommunication, students interactions in Education, etc. A large body of work has been devoted to the analysis
of these networks and the discovery of their underlying structure, specifically, finding the communities in them. Communities are groups of nodes in the network that are relatively cohesive within the set compared to the outside.
This thesis proposes Top Leaders, a fast and accurate community mining approach for both weighted and unweighted networks. Top Leaders regards a community as a set of followers congregating around a potential leader and works based on a novel measure of closeness inspired by the theory of diffusion of innovations.
Moreover, it proposes Meerkat-ED, a specific and practical toolbox for analyzing students interactions in online courses. It applies social network analysis techniques including community mining to evaluate participation of students in asynchronous discussion forums.
Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:AEU.10048/1529 |
Date | 11 1900 |
Creators | Rabbany khorasgani, Reihaneh |
Contributors | Zaiane, Osmar R. (Computing Science), Barbosa, Denilson (Computing Science), Reformat, Marek (Electrical and Computer Engineering) |
Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
Language | en_US |
Detected Language | English |
Type | Thesis |
Format | 4401380 bytes, application/pdf |
Relation | Reihaneh Rabbany Khorasgani, Jiyang Chen, Osmar R. Zaiane, Top leaders Community Detection Approach in Information Networks 4th SNA-KDD Workshop on Social Network Mining and Analysis Washington, DC, July 25 2010. |
Page generated in 0.0018 seconds