Sciweavers

647 search results - page 65 / 130
» Unsupervised possibilistic clustering
Sort
View
PAMI
1998
88views more  PAMI 1998»
13 years 7 months ago
Large-Scale Parallel Data Clustering
—Algorithmic enhancements are described that enable large computational reduction in mean square-error data clustering. These improvements are incorporated into a parallel data-c...
Dan Judd, Philip K. McKinley, Anil K. Jain
PAMI
2008
162views more  PAMI 2008»
13 years 7 months ago
Dimensionality Reduction of Clustered Data Sets
We present a novel probabilistic latent variable model to perform linear dimensionality reduction on data sets which contain clusters. We prove that the maximum likelihood solution...
Guido Sanguinetti
ICPR
2000
IEEE
14 years 9 months ago
OCR with No Shape Training
We present a document-specific OCR system and apply it to a corpus of faxed business letters. Unsupervised classification of the segmented character bitmaps on each page, using a ...
Tin Kam Ho, George Nagy
ICMCS
2006
IEEE
142views Multimedia» more  ICMCS 2006»
14 years 1 months ago
FEMA: A Fast Expectation Maximization Algorithm based on Grid and PCA
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
Zhiwen Yu, Hau-San Wong
KES
2000
Springer
13 years 11 months ago
Hierarchical growing cell structures: TreeGCS
We propose a hierarchical, unsupervised clustering algorithm (TreeGCS) based upon the Growing Cell Structure (GCS) neural network of Fritzke. Our algorithm improves an inconsisten...
Victoria J. Hodge, James Austin