Sciweavers

325 search results - page 10 / 65
» Quadratic Programming Feature Selection
Sort
View
CVPR
2009
IEEE
16 years 4 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...
KDD
1998
ACM
442views Data Mining» more  KDD 1998»
15 years 1 months ago
BAYDA: Software for Bayesian Classification and Feature Selection
BAYDA is a software package for flexible data analysis in predictive data mining tasks. The mathematical model underlying the program is based on a simple Bayesian network, the Na...
Petri Kontkanen, Petri Myllymäki, Tomi Siland...
IJON
2006
146views more  IJON 2006»
14 years 9 months ago
Feature selection and classification using flexible neural tree
The purpose of this research is to develop effective machine learning or data mining techniques based on flexible neural tree FNT. Based on the pre-defined instruction/operator se...
Yuehui Chen, Ajith Abraham, Bo Yang
PVM
2005
Springer
15 years 3 months ago
Some Improvements to a Parallel Decomposition Technique for Training Support Vector Machines
We consider a parallel decomposition technique for solving the large quadratic programs arising in training the learning methodology Support Vector Machine. At each iteration of th...
Thomas Serafini, Luca Zanni, Gaetano Zanghirati
ACMSE
2010
ACM
14 years 4 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins