Sciweavers

231 search results - page 26 / 47
» Spectral domain-transfer learning
Sort
View
SSPR
2004
Springer
14 years 1 months ago
Learning from General Label Constraints
Most machine learning algorithms are designed either for supervised or for unsupervised learning, notably classification and clustering. Practical problems in bioinformatics and i...
Tijl De Bie, Johan A. K. Suykens, Bart De Moor
IJON
2008
116views more  IJON 2008»
13 years 8 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
ICML
2007
IEEE
14 years 9 months ago
Robust non-linear dimensionality reduction using successive 1-dimensional Laplacian Eigenmaps
Non-linear dimensionality reduction of noisy data is a challenging problem encountered in a variety of data analysis applications. Recent results in the literature show that spect...
Samuel Gerber, Tolga Tasdizen, Ross T. Whitaker
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 9 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
NIPS
2003
13 years 9 months ago
Pairwise Clustering and Graphical Models
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...
Noam Shental, Assaf Zomet, Tomer Hertz, Yair Weiss