Clustering with \(r\)-regular graphs

DOI10.1016/j.patcog.2008.11.022zbMath1191.68583OpenAlexW1586698106MaRDI QIDQ2270835

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

zbMATH Keywords

regular graphs\(b\)-matchinggraph-based clusteringcluster utility

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (2)

A Unified Framework for Structured Graph Learning via Spectral Constraints ⋮ Cooperative clustering

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theoretical clustering based on limited neighbourhood sets
• Agglomerative clustering using the concept of mutual nearest neighbourhood
• A clustering algorithm based on graph connectivity
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• On clusterings
• Unresolved Problems in Cluster Analysis
• Assessing the Performance of a Graph-Based Clustering Algorithm
• Implementing weighted b-matching algorithms
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: Clustering with \(r\)-regular graphs