Clustering with r-regular graphs
From MaRDI portal
Publication:2270835
DOI10.1016/J.PATCOG.2008.11.022zbMATH Open1191.68583OpenAlexW1586698106MaRDI QIDQ2270835FDOQ2270835
Authors: Jong Kyoung Kim, Seungjin Choi 
Publication date: 29 July 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2008.11.022
Recommendations
Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Title not available (Why is that?)
- On clusterings: good, bad and spectral
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Graph theoretical clustering based on limited neighbourhood sets
- A clustering algorithm based on graph connectivity
- Unresolved Problems in Cluster Analysis
- Agglomerative clustering using the concept of mutual nearest neighbourhood
- Implementing weighted b-matching algorithms
- Assessing the Performance of a Graph-Based Clustering Algorithm
Cited In (7)
- Limitations on regularity lemmas for clustering graphs
- Clustering on k-Edge-Colored Graphs
- Batch edge-removal clustering based on random $k$NN graph
- Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
- Cooperative clustering
- Clustering on \(k\)-edge-colored graphs
- A unified framework for structured graph learning via spectral constraints
Uses Software
This page was built for publication: Clustering with \(r\)-regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2270835)
