Published November 1991 | Version Published
Book Section - Chapter Open

Deterministic annealing, constrained clustering, and optimization

  • 1. ROR icon California Institute of Technology

Abstract

In previous work the authors (Phys. Rev. Let., vol.65, p.945-8, 1990) proposed the concept of deterministic annealing for the problem of clustering and vector quantization. This approach is summarized. The authors extend the clustering method to the constraint clustering method. Adding constraints to the deterministic annealing mechanism expands the variety of optimization problems which can be solved by this method. A brief presentation of the clustering approach is given. Two examples to which the constraint clustering approach can be applied are included.

Additional Information

© 1991 IEEE.

Attached Files

Published - 00170767.pdf

Files

00170767.pdf

Files (310.4 kB)

Name Size
md5:c167866f2d7cae6e67a6e54bf124c7b4
310.4 kB Preview Download

Additional details

Identifiers

Eprint ID
78353
Resolver ID
CaltechAUTHORS:20170619-173902662

Dates

Created
2017-06-20
Created from EPrint's datestamp field
Updated
2021-11-15
Created from EPrint's last_modified field