Sciweavers

5046 search results - page 81 / 1010
» Feature Selection from Huge Feature Sets
Sort
View
BMCBI
2004
181views more  BMCBI 2004»
15 years 6 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
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 10 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
CIKM
2011
Springer
14 years 6 months ago
Towards feature selection in network
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
Quanquan Gu, Jiawei Han
MIR
2010
ACM
217views Multimedia» more  MIR 2010»
15 years 11 months ago
Feature selection for content-based, time-varying musical emotion regression
In developing automated systems to recognize the emotional content of music, we are faced with a problem spanning two disparate domains: the space of human emotions and the acoust...
Erik M. Schmidt, Douglas Turnbull, Youngmoo E. Kim
ICPR
2000
IEEE
16 years 7 months ago
Motion Segmentation Using Feature Selection and Subspace Method Based on Shape Space
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
Naoyuki Ichimura