2598 search results - page 104 / 520 » Experimental Design for Variable Selection in Data Bases |
169
Voted
JMLR
2010
15 years 28 days ago
2010
Feature selection for supervised learning can be greatly improved by making use of the fact that features often come in classes. For example, in gene expression data, the genes wh...
187
Voted
ICFCA
2009
Springer
16 years 28 days ago
2009
Springer
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
174
click to vote
TVLSI
2002
15 years 5 months ago
2002
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...
155
Voted
EUROPAR
2007
Springer
16 years 9 days ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
139
click to vote
MEDES
2009
ACM
15 years 10 months ago
2009
ACM
The main goal of web pages ranking is to find the interrelated pages. In this paper, we introduce an algorithm called FPR-DLA. In the proposed method learning automata is assigned...