Sciweavers

3422 search results - page 63 / 685
» Random Subset Optimization
Sort
View
125
Voted
MCS
2010
Springer
15 years 4 months ago
Choosing Parameters for Random Subspace Ensembles for fMRI Classification
Abstract. Functional magnetic resonance imaging (fMRI) is a noninvasive and powerful method for analysis of the operational mechanisms of the brain. fMRI classification poses a sev...
Ludmila I. Kuncheva, Catrin O. Plumpton
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
15 years 7 months ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 2 months ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
16 years 3 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...
AAAI
2011
14 years 2 months ago
Size Adaptive Selection of Most Informative Features
In this paper, we propose a novel method to select the most informative subset of features, which has little redundancy and very strong discriminating power. Our proposed approach...
Si Liu, Hairong Liu, Longin Jan Latecki, Shuicheng...