Automatic detection of cohesive subgroups within social hypertext: A heuristic approach

Authors:
Alvin Chin;Mark Chignell
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada;Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Ontario, Canada
Venue:
The New Review of Hypermedia and Multimedia
Year:
2008

Citing 26
Cited 1

Scatter/Gather: a cluster-based approach to browsing large document collections

SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
The World-Wide-Web as social hypertext

Communications of the ACM
Trawling the Web for emerging cyber-communities

WWW '99 Proceedings of the eighth international conference on World Wide Web
Similarity Measures

IEEE Transactions on Pattern Analysis and Machine Intelligence
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Clustering Algorithms

Clustering Algorithms
Clustering by pattern similarity in large data sets

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
A Decision Criterion for the Optimal Number of Clusters in Hierarchical Clustering

Journal of Global Optimization
Self-Organization and Identification of Web Communities

Computer
Bursty and hierarchical structure in streams

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Searching the hypermedia web: improved topic distillation through network analytic relevance ranking

The New Review of Hypermedia and Multimedia - Hypermedia and the world wide web
Visualization of Communication Patterns in Collaborative Innovation Networks - Analysis of Some W3C Working Groups

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Exploratory Social Network Analysis with Pajek

Exploratory Social Network Analysis with Pajek
Discovering large dense subgraphs in massive graphs

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Improved annotation of the blogosphere via autotagging and hierarchical clustering

Proceedings of the 15th international conference on World Wide Web
HT06, tagging paper, taxonomy, Flickr, academic article, to read

Proceedings of the seventeenth conference on Hypertext and hypermedia
Visual analysis of network centralities

APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
A framework for community identification in dynamic social networks

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Identifying subcommunities using cohesive subgroups in social hypertext

Proceedings of the eighteenth conference on Hypertext and hypermedia
Identifying active subgroups in online communities

CASCON '07 Proceedings of the 2007 conference of the center for advanced studies on Collaborative research
Community detection in large-scale social networks

Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Identifying communities in blogs: roles for social network analysis and survey instruments

International Journal of Web Based Communities
A vector partitioning approach to detecting community structure in complex networks

Computers & Mathematics with Applications
Statistical analysis of the social network and discussion threads in slashdot

Proceedings of the 17th international conference on World Wide Web
Statistical properties of community structure in large social and information networks

Proceedings of the 17th international conference on World Wide Web
An Efficient Spectral Algorithm for Network Community Discovery and Its Applications to Biological and Social Networks

ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining

Using cohesive subgroups for analyzing the evolution of the friend view mobile social network

UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of identifying cohesive subgroups in social hypertext is reviewed. A computationally efficient three-step framework for identifying cohesive subgroups is proposed, referred to as the Social Cohesion Analysis of Networks (SCAN) method. In the first step of this method (Select), people within a social network are screened using a level of network centrality to select possible subgroup members. In the second step (Collect), the people selected in the first step are collected into subgroups identified at each point in time using hierarchical cluster analysis. In the third step (Choose), similarity modeling is used to choose cohesive subgroups based on the similarity of subgroups when compared across different points in time. The application of this SCAN method is then demonstrated in a case study where a subgroup is automatically extracted from a social network formed based on the online interactions of a group of about 150 people that occurred over a two-year period. In addition, this paper also demonstrates that similarity-based cohesion can provide a different, and in this case more compelling, subgroup representation than a method based on splitting a hierarchical clustering dendrogram using an optimality criterion.