Sciweavers

1403 search results - page 40 / 281
» Set cover algorithms for very large datasets
Sort
View
ICML
1996
IEEE
14 years 9 months ago
Toward Optimal Feature Selection
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
Daphne Koller, Mehran Sahami
BMCBI
2010
125views more  BMCBI 2010»
13 years 8 months ago
In-silico prediction of blood-secretory human proteins using a ranking algorithm
Background: Computational identification of blood-secretory proteins, especially proteins with differentially expressed genes in diseased tissues, can provide highly useful inform...
Qi Liu, Juan Cui, Qiang Yang, Ying Xu
CEC
2008
IEEE
14 years 3 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...
CSCLP
2003
Springer
14 years 1 months ago
Clustering for Disconnected Solution Sets of Numerical CSPs
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings
ICCV
2001
IEEE
14 years 10 months ago
Feature Selection from Huge Feature Sets
The number of features that can be computed over an image is, for practical purposes, limitless. Unfortunately, the number of features that can be computed and exploited by most c...
José Bins, Bruce A. Draper