VQ-Based Clustering Algorithm of Piecewise- Dependent-Data.

Itshak Lapidot, Hugo Guterman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper a piecewise-dependent-data (PDD) clustering algorithm is presented, and a proof of its convergence to a local minimum is given. A distortion measure-based model represents each cluster. The proposed algorithm is iterative. At the end of each iteration, a competition between the models is performed. Then the data is regrouped between the models. The “movement” of the data between the models and the retraining allows the minimization of the overall system distortion. The Kohonen Self-Organizing Map (SOM) was used as the VQ model for clustering. The clustering algorithm was tested using data generated from four generators of Continuous Density HMM (CDHMM). It was demonstrated that the overall distortion is a decreasing function.
Original languageEnglish
Title of host publicationWSOM
Pages95-101
Number of pages7
DOIs
StatePublished - 2001

Fingerprint

Dive into the research topics of 'VQ-Based Clustering Algorithm of Piecewise- Dependent-Data.'. Together they form a unique fingerprint.

Cite this