Sciweavers

231 search results - page 15 / 47
» Spectral domain-transfer learning
Sort
View
JMLR
2012
11 years 11 months ago
On Sparse, Spectral and Other Parameterizations of Binary Probabilistic Models
This paper studies issues relating to the parameterization of probability distributions over binary data sets. Several such parameterizations of models for binary data are known, ...
David Buchman, Mark W. Schmidt, Shakir Mohamed, Da...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 9 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
JCDL
2005
ACM
116views Education» more  JCDL 2005»
14 years 2 months ago
Name disambiguation in author citations using a K-way spectral clustering method
An author may have multiple names and multiple authors may share the same name simply due to name abbreviations, identical names, or name misspellings in publications or bibliogra...
Hui Han, Hongyuan Zha, C. Lee Giles
ICML
2009
IEEE
14 years 9 months ago
Spectral clustering based on the graph p-Laplacian
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
Matthias Hein, Thomas Bühler
CVPR
2006
IEEE
14 years 10 months ago
Spectral Methods for Automatic Multiscale Data Clustering
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
Arik Azran, Zoubin Ghahramani