Sciweavers

2436 search results - page 112 / 488
» Evaluating Adaptive Problem Selection
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
ECAI
2010
Springer
13 years 7 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
KDD
2009
ACM
159views Data Mining» more  KDD 2009»
14 years 10 months ago
Adapting the right measures for K-means clustering
Clustering validation is a long standing challenge in the clustering literature. While many validation measures have been developed for evaluating the performance of clustering al...
Junjie Wu, Hui Xiong, Jian Chen
NLPRS
2001
Springer
14 years 2 months ago
An Empirical Study of Feature Set Selection for Text Chunking
This paper presents an empirical study for improving the performance of text chunking. We focus on two issues: the problem of selecting feature spaces, and the problem of alleviat...
Young-Sook Hwang, Yong-Jae Kwak, Hoo-Jung Chung, S...
WWW
2010
ACM
14 years 4 months ago
LCA-based selection for XML document collections
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
Georgia Koloniari, Evaggelia Pitoura