Sciweavers

2010 search results - page 209 / 402
» Feature Subset Selection Using a Genetic Algorithm
Sort
View
CEC
2007
IEEE
15 years 9 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
COMPGEOM
2001
ACM
15 years 6 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
ISNN
2011
Springer
14 years 5 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
BMCBI
2006
119views more  BMCBI 2006»
15 years 3 months ago
LS-NMF: A modified non-negative matrix factorization algorithm utilizing uncertainty estimates
Background: Non-negative matrix factorisation (NMF), a machine learning algorithm, has been applied to the analysis of microarray data. A key feature of NMF is the ability to iden...
Guoli Wang, Andrew V. Kossenkov, Michael F. Ochs
ICPR
2008
IEEE
15 years 9 months ago
Discriminative HMM training with GA for handwritten word recognition
This paper presents a recognition system for isolated handwritten Bangla words, with a fixed lexicon, using a left-right Hidden Markov Model (HMM). A stochastic search method, nam...
Tapan Kumar Bhowmik, Swapan K. Parui, Utpal Roy