The paper describes a probabilistic framework for graph clustering. We commence from a set of pairwise distances between graph structures. From this set of distances, we use a mixture model to characterize the pairwise affinity of the different graphs. We present an EM-like algorithm for clustering the graphs by iteratively updating the elements of the affinity matrix. In the M-step we apply eigendcomposition to the affinity matrix to locate the principal clusters. In the M-step we update the affinity probabilities. We apply the resulting unsupervised clustering algorithm to two practical problems. The first of these involves locating shape-categories using shock trees extracted from 2D silhouettes. The second problem involves finding the view structure of a polyhedral object using the Delaunay triangulation of corner features.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A probabilistic framework for graph clustering


    Beteiligte:
    Bin Luo, (Autor:in) / Robles-Kelly, A. (Autor:in) / Torsello, A. (Autor:in) / Wilson, R.C. (Autor:in) / Hancock, E.R. (Autor:in)


    Erscheinungsdatum :

    01.01.2001


    Format / Umfang :

    764104 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    A Probabilistic Framework for Graph Clustering

    Luo, B. / Robles-Kelly, A. / Torsello, A. et al. | British Library Conference Proceedings | 2001


    Multicuts and Perturb & MAP for Probabilistic Graph Clustering

    Kappes, J. r. | British Library Online Contents | 2016


    A Graph b-coloring Framework for Data Clustering

    Elghazel, H. / Kheddouci, H. / Deslandres, V. r. et al. | British Library Online Contents | 2008


    Benchmarking graph-based clustering algorithms

    Foggia, P. / Percannella, G. / Sansone, C. et al. | British Library Online Contents | 2009


    A Probabilistic Model of Fuzzy Clustering Ensemble

    Berikov, V. B. | British Library Online Contents | 2018