Sciweavers

5138 search results - page 46 / 1028
» Low-Entropy Set Selection.
Sort
View
EUSFLAT
2003
305views Fuzzy Logic» more  EUSFLAT 2003»
13 years 11 months ago
On the cardinality of fuzzy sets
It seems that a suitably constructed fuzzy sets of natural numbers form the most complete and adequate description of cardinality of finite fuzzy sets.(see [11]) Nevertheless, in...
Pavol Král
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 10 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
JCST
2006
65views more  JCST 2006»
13 years 10 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
14 years 3 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
GECCO
2003
Springer
127views Optimization» more  GECCO 2003»
14 years 3 months ago
Complex Function Sets Improve Symbolic Discriminant Analysis of Microarray Data
Abstract. Our ability to simultaneously measure the expression levels of thousands of genes in biological samples is providing important new opportunities for improving the diagnos...
David M. Reif, Bill C. White, Nancy Olsen, Thomas ...