Sciweavers

2826 search results - page 17 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
ICML
1998
IEEE
15 years 10 months ago
Feature Selection via Concave Minimization and Support Vector Machines
Computational comparison is made between two feature selection approaches for nding a separating plane that discriminates between two point sets in an n-dimensional feature space ...
Paul S. Bradley, Olvi L. Mangasarian
CIKM
2009
Springer
14 years 7 months ago
Diverging patterns: discovering significant frequency change dissimilarities in large databases
In this paper, we present a framework for mining diverging patterns, a new type of contrast patterns whose frequency changes significantly differently in two data sets, e.g., it c...
Aijun An, Qian Wan, Jiashu Zhao, Xiangji Huang
ICPR
2004
IEEE
15 years 10 months ago
Hand Gesture Recognition: Self-Organising Maps as a Graphical User Interface for the Partitioning of Large Training Data Sets
Gesture recognition is a difficult task in computer vision due to the numerous degrees of freedom of a human hand. Fortunately, human gesture covers only a small part of the theor...
Axel Saalbach, Gunther Heidemann, Holger Bekel, In...
ISNN
2009
Springer
15 years 4 months ago
Nonlinear Component Analysis for Large-Scale Data Set Using Fixed-Point Algorithm
Abstract. Nonlinear component analysis is a popular nonlinear feature extraction method. It generally uses eigen-decomposition technique to extract the principal components. But th...
Weiya Shi, Yue-Fei Guo
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
15 years 3 months ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao