Sciweavers

184 search results - page 12 / 37
» Efficiently handling feature redundancy in high-dimensional ...
Sort
View
ESANN
2007
13 years 9 months ago
A new feature selection scheme using data distribution factor for transactional data
A new efficient unsupervised feature selection method is proposed to handle transactional data. The proposed feature selection method introduces a new Data Distribution Factor (DDF...
Piyang Wang, Tommy W. S. Chow
JMLR
2010
161views more  JMLR 2010»
13 years 2 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
CVPR
2009
IEEE
13 years 11 months ago
Efficiently training a better visual detector with sparse eigenvectors
Face detection plays an important role in many vision applications. Since Viola and Jones [1] proposed the first real-time AdaBoost based object detection system, much effort has ...
Sakrapee Paisitkriangkrai, Chunhua Shen, Jian Zhan...
PRL
2006
130views more  PRL 2006»
13 years 7 months ago
Efficient huge-scale feature selection with speciated genetic algorithm
With increasing interest in bioinformatics, sophisticated tools are required to efficiently analyze gene information. The classification of gene expression profiles is crucial in ...
Jin-Hyuk Hong, Sung-Bae Cho
CIKM
2008
Springer
13 years 9 months ago
A consensus based approach to constrained clustering of software requirements
Managing large-scale software projects involves a number of activities such as viewpoint extraction, feature detection, and requirements management, all of which require a human a...
Chuan Duan, Jane Cleland-Huang, Bamshad Mobasher