Sciweavers

1126 search results - page 15 / 226
» Strong Feature Sets from Small Samples
Sort
View
168
Voted
JMLR
2012
13 years 4 months ago
Conditional Likelihood Maximisation: A Unifying Framework for Information Theoretic Feature Selection
We present a unifying framework for information theoretic feature selection, bringing almost two decades of research on heuristic filter criteria under a single theoretical inter...
Gavin Brown, Adam Pocock, Ming-Jie Zhao, Mikel Luj...
142
Voted
BMCBI
2007
94views more  BMCBI 2007»
15 years 1 months ago
Model based analysis of real-time PCR data from DNA binding dye protocols
Background: Reverse transcription followed by real-time PCR is widely used for quantification of specific mRNA, and with the use of double-stranded DNA binding dyes it is becoming...
Mariano J. Alvarez, Guillermo J. Vila-Ortiz, Maria...
CSDA
2008
126views more  CSDA 2008»
15 years 1 months ago
A new genetic algorithm in proteomics: Feature selection for SELDI-TOF data
Mass spectrometry from clinical specimens is used in order to identify biomarkers in a diagnosis. Thus, a reliable method for both feature selection and classification is required...
Christelle Reynès, Robert Sabatier, Nicolas...
ICML
2007
IEEE
16 years 2 months ago
Beamforming using the relevance vector machine
Beamformers are spatial filters that pass source signals in particular focused locations while suppressing interference from elsewhere. The widely-used minimum variance adaptive b...
David P. Wipf, Srikantan S. Nagarajan
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 4 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...