Sciweavers

31 search results - page 3 / 7
» Kernel k-means: spectral clustering and normalized cuts
Sort
View
MVA
2007
127views Computer Vision» more  MVA 2007»
14 years 11 months ago
Vehicle Orientation Detection Using Vehicle Color and Normalized Cut Clustering
This paper proposes a novel approach for vehicle orientation detection using “vehicle color” and edge information based on clustering framework. To extract the “vehicle colo...
Jui-Chen Wu, Jun-Wei Hsieh, Yung-Sheng Chen, Cheng...
JMLR
2006
108views more  JMLR 2006»
14 years 9 months ago
Learning Spectral Clustering, With Application To Speech Separation
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
Francis R. Bach, Michael I. Jordan
UAI
2003
14 years 11 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
15 years 4 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
PAMI
2010
112views more  PAMI 2010»
14 years 8 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum