869 search results - page 78 / 174 » MicroARTMAP for pattern recognition problems |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
JUCS
2008
13 years 7 months ago
2008
: In this work we present a strategy for off-line signature verification. It takes into account a writer-independent model which reduces the pattern recognition problem to a 2-clas...
PR
2006
13 years 7 months ago
2006
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...