Sciweavers

231 search results - page 14 / 47
» Spectral domain-transfer learning
Sort
View
ICML
2010
IEEE
13 years 9 months ago
Hilbert Space Embeddings of Hidden Markov Models
Hidden Markov Models (HMMs) are important tools for modeling sequence data. However, they are restricted to discrete latent states, and are largely restricted to Gaussian and disc...
Le Song, Sajid M. Siddiqi, Geoffrey J. Gordon, Ale...
ACL
2006
13 years 9 months ago
Unsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
JMLR
2010
211views more  JMLR 2010»
13 years 3 months ago
Minimum Conditional Entropy Clustering: A Discriminative Framework for Clustering
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...
Bo Dai, Baogang Hu
UAI
2003
13 years 9 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
COLT
2004
Springer
14 years 1 months ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...