Sciweavers

1775 search results - page 44 / 355
» Learning Spectral Clustering
Sort
View
BMVC
2000
14 years 11 months ago
Detecting Multiple Texture Planes using Local Spectral Distortion
This paper presents a spectral method for identifying multiple texture planes. We commence by showing how pairs of spectral peaks can be used to make direct estimates of the slant...
Eraldo Ribeiro, Edwin R. Hancock
ICPR
2004
IEEE
15 years 11 months ago
Learning High-level Independent Components of Images through a Spectral Representation
Statistical methods, such as independent component analysis, have been successful in learning local low-level features from natural image data. Here we extend these methods for le...
Aapo Hyvärinen, Jussi T. Lindgren
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
15 years 10 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
IJCNN
2007
IEEE
15 years 4 months ago
Maximum Margin based Semi-supervised Spectral Kernel Learning
Zenglin Xu, Jianke Zhu, Michael R. Lyu, Irwin King
ICVS
2003
Springer
15 years 3 months ago
A Spectral Approach to Learning Structural Variations in Graphs
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
Bin Luo, Richard C. Wilson, Edwin R. Hancock