Sciweavers

440 search results - page 60 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
WWW
2008
ACM
14 years 8 months ago
Contextual advertising by combining relevance with click feedback
Contextual advertising supports much of the Web's ecosystem today. User experience and revenue (shared by the site publisher ad the ad network) depend on the relevance of the...
Deepayan Chakrabarti, Deepak Agarwal, Vanja Josifo...
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 8 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
14 years 2 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...
APBC
2004
132views Bioinformatics» more  APBC 2004»
13 years 9 months ago
A Novel Feature Selection Method to Improve Classification of Gene Expression Data
This paper introduces a novel method for minimum number of gene (feature) selection for a classification problem based on gene expression data with an objective function to maximi...
Liang Goh, Qun Song, Nikola K. Kasabov
ECCV
2010
Springer
13 years 8 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof