Sciweavers

4773 search results - page 669 / 955
» Learning from Uncertain Data
Sort
View
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 8 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
KDD
2009
ACM
249views Data Mining» more  KDD 2009»
16 years 7 months ago
Drosophila gene expression pattern annotation using sparse features and term-term interactions
The Drosophila gene expression pattern images document the spatial and temporal dynamics of gene expression and they are valuable tools for explicating the gene functions, interac...
Shuiwang Ji, Lei Yuan, Ying-Xin Li, Zhi-Hua Zhou, ...
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 6 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
KDD
2012
ACM
190views Data Mining» more  KDD 2012»
13 years 9 months ago
Multi-label hypothesis reuse
Multi-label learning arises in many real-world tasks where an object is naturally associated with multiple concepts. It is well-accepted that, in order to achieve a good performan...
Sheng-Jun Huang, Yang Yu, Zhi-Hua Zhou
ICCV
2007
IEEE
16 years 8 months ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...