Discovering Overlapping Groups in Social Media

@article{Wang2010DiscoveringOG,
  title={Discovering Overlapping Groups in Social Media},
  author={Xufei Wang and Lei Tang and Huiji Gao and Huan Liu},
  journal={2010 IEEE International Conference on Data Mining},
  year={2010},
  pages={569-578}
}
  • Xufei Wang, Lei Tang, Huan Liu
  • Published 13 December 2010
  • Computer Science
  • 2010 IEEE International Conference on Data Mining
The increasing popularity of social media is shortening the distance between people. Social activities, e.g., tagging in Flickr, book marking in Delicious, twittering in Twitter, etc. are reshaping people’s social life and redefining their social roles. People with shared interests tend to form their groups in social media, and users within the same community likely exhibit similar social behavior (e.g., going for the same movies, having similar political viewpoints), which in turn reinforces… 
Group Profiling for Understanding Social Structures
TLDR
This work explores different group-profiling strategies to construct descriptions of a group, and shows some potential applications based on group profiling that can assist network navigation, visualization, and analysis, as well as monitoring and tracking the ebbs and tides of different groups in evolving networks.
Detecting Overlapping Communities in Location-Based Social Networks
TLDR
A novel multi-mode multi-attribute edge-centric co-clustering (M2Clustering) framework to discover the overlapping communities of LBSNs users and is able to group like-minded users from different social perspectives.
Cross-domain community detection in heterogeneous social networks
TLDR
By exploring the heterogenous digital footprints of LBSNs users in the cyber-physical space, this paper comes out with a novel edge-centric co-clustering framework to discover overlapping communities and is able to group like-minded users from different social perspectives.
Discovering and Profiling Overlapping Communities in Location-Based Social Networks
TLDR
A novel multimode multi-attribute edge-centric coclustering framework to discover the overlapping and hierarchical communities of LBSNs users, not only able to group like-minded users from different social perspectives but also discover communities with explicit profiles indicating the interests of community members.
Connecting Users with Similar Interests for Group Understanding
TLDR
The research proposes novel concepts and approaches for connecting the like-minded, enables the understanding of user groups, and exposes interesting research opportunities.
Discovering and Profiling Overlapping Location Based Social Network
TLDR
A novel multimode multi-attribute edge-centric coclus-tering framework to discover the overlapping and hierarchical communities of LBSNs users, not only able to group like-minded users from different social perspectives but also discover communities with explicit profiles indicating the interests of community members.
Detection of Overlapping Communities in Social Tagging Systems
TLDR
The proposed algorithm converts a hypergraph into its corresponding weighted line-graph, using measures of hyperedge similarity, whereby any community detection algorithm on unipartite graphs can be used to produce overlapping communities in the folksonomy.
Community Understanding in Location-based Social Networks
TLDR
This chapter aims to detect and understand social communities in LBSNs by representing the heterogeneous interactions with a multimodality nonuniform hypergraph, and presents an efficient algorithm to detect the overlapped dense subgraphs.
Clustering and heterogeneous information fusion for social media theme discovery and associative mining
TLDR
Novel clustering algorithms for the fast and robust clustering of large-scale social media data by integrating their multiple but different types of features and user preferences are investigated and developed, and their applications to the associative social media mining tasks are explored.
Social Media Data Integration for Community Detection
TLDR
This work presents a joint optimization framework to integrate multiple data sources for community detection and elaborates the need for and challenges of multi-source integration of heterogeneous data types, and provides a principled way ofMulti-source community detection.
...
...

References

SHOWING 1-10 OF 22 REFERENCES
Community Detection and Mining in Social Media
  • Lei Tang, Huan Liu
  • Computer Science
    Community Detection and Mining in Social Media
  • 2010
TLDR
This book discusses graph-based community detection techniques and many important extensions that handle dynamic, heterogeneous networks in social media, and demonstrates how discovered patterns of communities can be used for social media mining.
Scalable learning of collective behavior based on sparse social dimensions
TLDR
This work proposes an edge-centric clustering scheme to extract sparse social dimensions that can efficiently handle networks of millions of actors while demonstrating comparable prediction performance as other non-scalable methods.
Birds of a Feather: Homophily in Social Networks
Similarity breeds connection. This principle—the homophily principle—structures network ties of every type, including marriage, friendship, work, advice, support, information transfer, exchange,
Detecting Commmunities via Simultaneous Clustering of Graphs and Folksonomies
TLDR
The Simultaneous Cut (SimCut) method has the advantage that it can group related tags and cluster the nodes simultaneously and can be easily and efficiently implemented.
Community detection in graphs
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Mixture models and exploratory analysis in networks
TLDR
A general technique for detecting structural features in large-scale network data that works by dividing the nodes of a network into classes such that the members of each class have similar patterns of connection to other nodes is described.
Computing Communities in Large Networks Using Random Walks
TLDR
A measure of similarities between vertices based on random walks which captures well the community structure in a network, can be computed efficiently, and it can be used in an agglomerative algorithm to compute efficiently thecommunity structure of a network.
Distance, dissimilarity index, and network community structure.
  • Haijun Zhou
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2003
TLDR
This work calculates the dissimilarity index between nearest-neighboring vertices of a network and design an algorithm to partition these vertices into communities that are hierarchically organized, and identifies many clusters that have well defined biological functions.
Detecting the overlapping and hierarchical community structure in complex networks
TLDR
The first algorithm that finds both overlapping communities and the hierarchical structure is presented, based on the local optimization of a fitness function, enabling different hierarchical levels of organization to be investigated.
...
...