Sciweavers

5463 search results - page 412 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
COLT
2004
Springer
15 years 10 months ago
Regret Bounds for Hierarchical Classification with Linear-Threshold Functions
We study the problem of classifying data in a given taxonomy when classifications associated with multiple and/or partial paths are allowed. We introduce an incremental algorithm u...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
WSDM
2009
ACM
191views Data Mining» more  WSDM 2009»
16 years 1 months ago
Generating labels from clicks
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
Rakesh Agrawal, Alan Halverson, Krishnaram Kenthap...
COMPLIFE
2006
Springer
15 years 10 months ago
Relational Subgroup Discovery for Descriptive Analysis of Microarray Data
Abstract. This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to help find description of groups of genes different...
Igor Trajkovski, Filip Zelezný, Jakub Tolar...
IIS
2003
15 years 8 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
15 years 8 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street