Weighted Graph Cuts without Eigenvectors A Multilevel Approach

A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods. In this paper, we discuss an equivalence between the objective functions used in these seemingly different methods - in pa...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on pattern analysis and machine intelligence Vol. 29; no. 11; pp. 1944 - 1957
Main Authors: Dhillon, I.S., Yuqiang Guan, Kulis, B.
Format: Journal Article
Language:English
Published: Los Alamitos, CA IEEE 01.11.2007
IEEE Computer Society
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:0162-8828, 1939-3539
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first