I-Louvain: An Attributed Graph Clustering Method

@inproceedings{Combe2015ILouvainAA,
  title={I-Louvain: An Attributed Graph Clustering Method},
  author={David Combe and Christine Largeron and M. G{\'e}ry and El{\"o}d Egyed-Zsigmond},
  booktitle={IDA},
  year={2015}
}
Modularity allows to estimate the quality of a partition into communities of a graph composed of highly inter-connected vertices. In this article, we introduce a complementary measure, based on inertia, and specially conceived to evaluate the quality of a partition based on real attributes describing the vertices. We propose also I-Louvain, a graph nodes clustering method which uses our criterion, combined with Newman’s modularity, in order to detect communities in attributed graph where real… Expand
Efficiently Clustering Very Large Attributed Graphs
Collaborative Multi-View Attributed Networks Mining
ANCA : Attributed Network Clustering Algorithm
Eva: Attribute-Aware Network Segmentation
Community detection in Attributed Network
Identifying and exploiting homogeneous communities in labeled networks
Mining Dense Subgraphs with Similar Edges
...
1
2
3
...

References

SHOWING 1-10 OF 43 REFERENCES
Graph Clustering Based on Structural/Attribute Similarities
Clustering Large Attributed Graphs: An Efficient Incremental Approach
Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms
Combining Relations and Text in Scientific Network Clustering
Community Detection based on Structural and Attribute Similarities
Mining Graph Topological Patterns: Finding Covariations among Vertex Descriptors
Entropy based community detection in augmented social networks
Graph Clustering and Minimum Cut Trees
Detecting community structure in networks
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
...
1
2
3
4
5
...