A spectral approach to clustering numerical vectors as nodes in a network
From MaRDI portal
Publication:614073
DOI10.1016/J.PATCOG.2010.08.010zbMATH Open1211.68363DBLPjournals/pr/ShigaTM11OpenAlexW1995120512WikidataQ62669629 ScholiaQ62669629MaRDI QIDQ614073FDOQ614073
Authors: Motoki Shiga, Ichigaku Takigawa, Hiroshi Mamitsuka
Publication date: 23 December 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.08.010
Recommendations
- scientific article; zbMATH DE number 2043367
- Spectral clustering in heterogeneous networks
- Spectral methods for graph clustering - a survey
- scientific article; zbMATH DE number 2090201
- Spectral clustering methods for multiplex networks
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- A note on spectral clustering
- Spectral redemption in clustering sparse networks
Cites Work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Emergence of Scaling in Random Networks
- A survey of kernel and spectral methods for clustering
- Concept decompositions for large sparse text data using clustering
- 10.1162/1532443041827943
- Semi-supervised graph clustering: a kernel approach
- Soft memberships for spectral clustering, with application to permeable language distinction
Cited In (2)
Uses Software
This page was built for publication: A spectral approach to clustering numerical vectors as nodes in a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q614073)