Finding communities by clustering a graph into overlapping subgraphs.
Jeffrey BaumesMark K. GoldbergMukkai S. KrishnamoorthyMalik Magdon-IsmailNathan PrestonPublished in: IADIS AC (2005)
Keyphrases
- communities in social networks
- maximum clique
- overlapping communities
- graph theoretic
- graph mining
- densely connected
- graph clustering
- community discovery
- graph properties
- clustering algorithm
- graph databases
- community detection
- graph partitioning
- clustering method
- social networks
- community structure
- k means
- data clustering
- graph structures
- graph structure
- frequent subgraph mining
- labeled graphs
- graph model
- graph data
- unsupervised learning
- social network analysis
- similarity matrix
- graph representation
- spectral clustering
- directed graph
- overlapping clustering
- reachability queries
- data objects
- weighted graph
- association graph
- strongly connected
- subgraph isomorphism
- structured data
- frequent subgraphs
- spanning tree
- cluster analysis
- maximal cliques
- pattern mining
- graph theory
- random walk
- graph patterns
- homogeneous groups
- complex networks