Sciweavers

223 search results - page 33 / 45
» Spectral Learning
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
A non-negative approach to semi-supervised separation of speech from noise with the use of temporal dynamics
We present a semi-supervised source separation methodology to denoise speech by modeling speech as one source and noise as the other source. We model speech using the recently pro...
Gautham J. Mysore, Paris Smaragdis
IJCAI
2003
13 years 8 months ago
Continuous nonlinear dimensionality reduction by kernel Eigenmaps
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
Matthew Brand
ICML
2005
IEEE
14 years 8 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
JMLR
2010
112views more  JMLR 2010»
13 years 2 months ago
Reduced-Rank Hidden Markov Models
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
Sajid M. Siddiqi, Byron Boots, Geoffrey J. Gordon
PKDD
2009
Springer
120views Data Mining» more  PKDD 2009»
14 years 1 months ago
Variational Graph Embedding for Globally and Locally Consistent Feature Extraction
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...
Shuang-Hong Yang, Hongyuan Zha, Shaohua Kevin Zhou...