Sciweavers

80 search results - page 5 / 16
» Spectral clustering based on matrix perturbation theory
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 7 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
DILS
2008
Springer
13 years 9 months ago
Semi Supervised Spectral Clustering for Regulatory Module Discovery
We propose a novel semi-supervised clustering method for the task of gene regulatory module discovery. The technique uses data on dna binding as prior knowledge to guide the proces...
Alok Mishra, Duncan Gillies
SPIESR
2003
136views Database» more  SPIESR 2003»
13 years 8 months ago
Media segmentation using self-similarity decomposition
We present a framework for analyzing the structure of digital media streams. Though our methods work for video, text, and audio, we concentrate on detecting the structure of digit...
Jonathan Foote, Matthew L. Cooper
PAKDD
2007
ACM
152views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Spectral Clustering Based Null Space Linear Discriminant Analysis (SNLDA)
While null space based linear discriminant analysis (NLDA) obtains a good discriminant performance, the ability easily suffers from an implicit assumption of Gaussian model with sa...
Wenxin Yang, Junping Zhang
JMLR
2011
133views more  JMLR 2011»
13 years 2 months ago
Operator Norm Convergence of Spectral Clustering on Level Sets
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
Bruno Pelletier, Pierre Pudlo