Sciweavers

3949 search results - page 386 / 790
» Machine Learning and Data Mining
Sort
View
ICML
2007
IEEE
16 years 5 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ICML
2007
IEEE
16 years 5 months ago
Learning nonparametric kernel matrices from pairwise constraints
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
ICML
2006
IEEE
16 years 5 months ago
Constructing informative priors using transfer learning
Many applications of supervised learning require good generalization from limited labeled data. In the Bayesian setting, we can try to achieve this goal by using an informative pr...
Rajat Raina, Andrew Y. Ng, Daphne Koller
180
Voted
ML
2010
ACM
135views Machine Learning» more  ML 2010»
14 years 11 months ago
Multi-domain learning by confidence-weighted parameter combination
State-of-the-art statistical NLP systems for a variety of tasks learn from labeled training data that is often domain specific. However, there may be multiple domains or sources o...
Mark Dredze, Alex Kulesza, Koby Crammer
GRC
2010
IEEE
15 years 5 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi