Sciweavers

1651 search results - page 206 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Incorporating Diversity in Active Learning with Support Vector Machines
In many real world applications, active selection of training examples can significantly reduce the number of labelled training examples to learn a classification function. Differ...
Klaus Brinker
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 8 months ago
Identifying "best bet" web search results by mining past user behavior
The top web search result is crucial for user satisfaction with the web search experience. We argue that the importance of the relevance at the top position necessitates special h...
Eugene Agichtein, Zijian Zheng
MMM
2009
Springer
186views Multimedia» more  MMM 2009»
14 years 3 months ago
A New Multiple Kernel Approach for Visual Concept Learning
In this paper, we present a novel multiple kernel method to learn the optimal classification function for visual concept. Although many carefully designed kernels have been propose...
Jingjing Yang, Yuanning Li, YongHong Tian, Lingyu ...
CIARP
2007
Springer
14 years 5 days ago
Bagging with Asymmetric Costs for Misclassified and Correctly Classified Examples
Abstract. Diversity is a key characteristic to obtain advantages of combining predictors. In this paper, we propose a modification of bagging to explicitly trade off diversity and ...
Ricardo Ñanculef, Carlos Valle, Héct...
CIKM
2008
Springer
13 years 10 months ago
A densitometric approach to web page segmentation
Web Page segmentation is a crucial step for many applications in Information Retrieval, such as text classification, de-duplication and full-text search. In this paper we describe...
Christian Kohlschütter, Wolfgang Nejdl