Sciweavers

1772 search results - page 192 / 355
» Classifying Problems into Complexity Classes
Sort
View
ICML
2006
IEEE
16 years 1 months ago
Active sampling for detecting irrelevant features
The general approach for automatically driving data collection using information from previously acquired data is called active learning. Traditional active learning addresses the...
Sriharsha Veeramachaneni, Emanuele Olivetti, Paolo...
120
Voted
KDD
2007
ACM
198views Data Mining» more  KDD 2007»
16 years 1 months ago
Applying Link-Based Classification to Label Blogs
In analyzing data from social and communication networks, we encounter the problem of classifying objects where there is an explicit link structure amongst the objects. We study t...
Smriti Bhagat, Graham Cormode, Irina Rozenbaum
120
Voted
CVPR
2010
IEEE
15 years 5 months ago
Bayes Optimal Kernel Discriminant Analysis
Kernel methods provide an efficient mechanism to derive nonlinear algorithms. In classification problems as well as in feature extraction, kernel-based approaches map the original...
Di You, Aleix Martinez
108
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
104
Voted
CCIA
2005
Springer
15 years 6 months ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...