Sciweavers

3395 search results - page 283 / 679
» Learning to efficiently rank
Sort
View
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
16 years 9 days ago
Stability of Feature Selection Algorithms
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...
COLT
2005
Springer
16 years 7 days ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
ICDM
2003
IEEE
220views Data Mining» more  ICDM 2003»
16 years 1 hour ago
Exploiting Unlabeled Data for Improving Accuracy of Predictive Data Mining
Predictive data mining typically relies on labeled data without exploiting a much larger amount of available unlabeled data. The goal of this paper is to show that using unlabeled...
Kang Peng, Slobodan Vucetic, Bo Han, Hongbo Xie, Z...
ICADL
2010
Springer
160views Education» more  ICADL 2010»
15 years 11 months ago
Thesaurus Extension Using Web Search Engines
Maintaining and extending large thesauri is an important challenge facing digital libraries and IT businesses alike. In this paper we describe a method building on and extending ex...
Robert Meusel, Mathias Niepert, Kai Eckert, Heiner...
LWA
2008
15 years 8 months ago
Enhanced Services for Targeted Information Retrieval by Event Extraction and Data Mining
Where Information Retrieval (IR) and Text Categorization delivers a set of (ranked) documents according to a query, users of large document collections would rather like to receiv...
Felix Jungermann, Katharina Morik