Corpus ID: 7699111

GANC: Greedy Agglomerative Normalized Cut

@article{Tabatabaei2011GANCGA,
  title={GANC: Greedy Agglomerative Normalized Cut},
  author={Seyed Salim Tabatabaei and Mark Coates and Michael G. Rabbat},
  journal={ArXiv},
  year={2011},
  volume={abs/1105.0974}
}
  • Seyed Salim Tabatabaei, Mark Coates, Michael G. Rabbat
  • Published in ArXiv 2011
  • Computer Science
  • This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However, unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists of three components that are processed sequentially: a greedy agglomerative hierarchical clustering… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-9 OF 9 CITATIONS

    Content Distribution Strategies in Opportunistic Networks

    VIEW 6 EXCERPTS
    CITES METHODS & BACKGROUND

    Trajectory Data Classification: A Review

    VIEW 3 EXCERPTS
    CITES METHODS & BACKGROUND

    Action Recognition Using Discriminative Structured Trajectory Groups

    VIEW 1 EXCERPT
    CITES METHODS

    Graph Wavelets for Multiscale Community Mining

    VIEW 3 EXCERPTS
    CITES BACKGROUND & METHODS

    Discovering discriminative action parts from mid-level video representations

    VIEW 1 EXCERPT
    CITES METHODS

    Performance evaluation of computed tomography liver image segmentation approaches

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 69 REFERENCES

    Weighted Graph Cuts without Eigenvectors A Multilevel Approach

    VIEW 18 EXCERPTS
    HIGHLY INFLUENTIAL

    Normalized Cuts and Image Segmentation

    VIEW 16 EXCERPTS
    HIGHLY INFLUENTIAL

    Maps of random walks on complex networks reveal community structure.

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Community structure in social and biological networks.

    • Michelle Girvan, M. E. J. Newman
    • Medicine, Computer Science, Physics
    • Proceedings of the National Academy of Sciences of the United States of America
    • 2002
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    A Random Walks View of Spectral Segmentation

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    On Spectral Clustering: Analysis and an algorithm

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Performance of modularity maximization in practical contexts.

    VIEW 2 EXCERPTS

    Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.

    VIEW 1 EXCERPT