Sciweavers

1583 search results - page 36 / 317
» Stability of Feature Selection Algorithms
Sort
View
BMCBI
2004
181views more  BMCBI 2004»
13 years 8 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
ISCC
2006
IEEE
14 years 2 months ago
SASA: A Synthesis Scheduling Algorithm with Prediction and Sorting Features
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
Panagiotis G. Sarigiannidis, Georgios I. Papadimit...
SPLC
2008
13 years 10 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
ICML
2010
IEEE
13 years 9 months ago
Online Streaming Feature Selection
We study an interesting and challenging problem, online streaming feature selection, in which the size of the feature set is unknown, and not all features are available for learni...
Xindong Wu, Kui Yu, Hao Wang, Wei Ding
AAAI
2008
13 years 10 months ago
Trace Ratio Criterion for Feature Selection
Fisher score and Laplacian score are two popular feature selection algorithms, both of which belong to the general graph-based feature selection framework. In this framework, a fe...
Feiping Nie, Shiming Xiang, Yangqing Jia, Changshu...