Sciweavers

145 search results - page 3 / 29
» Structure feature selection for graph classification
Sort
View
ICML
2007
IEEE
14 years 6 months ago
Minimum reference set based feature selection for small sample classifications
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
Xue-wen Chen, Jong Cheol Jeong
ICASSP
2009
IEEE
14 years 14 hour ago
Microarray classification using block diagonal linear discriminant analysis with embedded feature selection
In this paper, block diagonal linear discriminant analysis (BDLDA) is improved and applied to gene expression data. BDLDA is a classification tool with embedded feature selection...
Lingyan Sheng, Roger Pique-Regi, Shahab Asgharzade...
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
13 years 9 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
CHI
2010
ACM
14 years 3 days ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
ISBI
2004
IEEE
14 years 6 months ago
Population Classification Based on Structural Morphometry of Cortical Sulci
This paper describes a classification system discriminating male and female brains from morphometric features of cortical sulci. This system is tested on a database of 143 brains,...
Edouard Duchesnay, Jean-Francois Mangin, Alexis Ro...