Dichotomy Between Clustering Performance and Minimum Distortion in Piecewise-Dependent-Data (PDD) Clustering
| Type of publication: | Journal paper |
| Citation: | lapidot-rr-02-48b |
| Journal: | to be published in IEEE Signal Processing Letters |
| Year: | 2003 |
| Note: | IDIAP-RR 02-48 |
| Crossref: | lapidot-rr02-48: |
| Abstract: | In many signal such speech, bio-signals, protein chains, etc. there is a dependency between consecutive vectors. As the dependency is limited in duration such data can be called as Piecewise-Dependent- Data (PDD). In clustering it is frequently needed to minimize a given distance function. In this paper we will show that in PDD clustering there is a contradiction between the desire for high resolution (short segments and low distance) and high accuracy (long segments and high distortion,',','), i.e. meaningful clustering. |
| Userfields: | ipdmembership={speech}, language={English}, |
| Keywords: | |
| Projects |
Idiap |
| Authors | |
| Added by: | [UNK] |
| Total mark: | 0 |
|
Attachments
|
|
|
|
|
Notes
|
|
|
|
|
