Constrained clustering for data assignment problems with examples of module placement

Kenneth Rose, David Jonathan Miller

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

We present a new approach to the class of optimization problems known'as data assignment problems, viewing them in the context of constrained clustering. The clustering algorithm we apply, an extension of the deterministic annealing method which incorporates clustering constraints, initially generates "soft" data assignments, then reduces the fuzziness of these assignments by lowering an effective temperature. In the low temperature limit, we obtain a legal data assignment solution which seeks to minimize the desired objective function. The gradual reduction of temperature allows the method to avoid some local minima which plague conventional descent methods. We implement our method on the two-dimensional module placement problem. For the minimum squared wire length objective, our algorithm is demonstrated to outperform several other methods on module placement examples from the literature.

Original languageEnglish (US)
Title of host publication1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1937-1940
Number of pages4
ISBN (Electronic)0780305930
DOIs
StatePublished - Jan 1 1992
Event1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 - San Diego, United States
Duration: May 10 1992May 13 1992

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume4
ISSN (Print)0271-4310

Conference

Conference1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992
CountryUnited States
CitySan Diego
Period5/10/925/13/92

Fingerprint

Clustering algorithms
Temperature
Wire
Annealing

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Rose, K., & Miller, D. J. (1992). Constrained clustering for data assignment problems with examples of module placement. In 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992 (pp. 1937-1940). [230430] (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 4). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISCAS.1992.230430
Rose, Kenneth ; Miller, David Jonathan. / Constrained clustering for data assignment problems with examples of module placement. 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992. Institute of Electrical and Electronics Engineers Inc., 1992. pp. 1937-1940 (Proceedings - IEEE International Symposium on Circuits and Systems).
@inproceedings{f5937e32893b481da12a0074b6adb462,
title = "Constrained clustering for data assignment problems with examples of module placement",
abstract = "We present a new approach to the class of optimization problems known'as data assignment problems, viewing them in the context of constrained clustering. The clustering algorithm we apply, an extension of the deterministic annealing method which incorporates clustering constraints, initially generates {"}soft{"} data assignments, then reduces the fuzziness of these assignments by lowering an effective temperature. In the low temperature limit, we obtain a legal data assignment solution which seeks to minimize the desired objective function. The gradual reduction of temperature allows the method to avoid some local minima which plague conventional descent methods. We implement our method on the two-dimensional module placement problem. For the minimum squared wire length objective, our algorithm is demonstrated to outperform several other methods on module placement examples from the literature.",
author = "Kenneth Rose and Miller, {David Jonathan}",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/ISCAS.1992.230430",
language = "English (US)",
series = "Proceedings - IEEE International Symposium on Circuits and Systems",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1937--1940",
booktitle = "1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992",
address = "United States",

}

Rose, K & Miller, DJ 1992, Constrained clustering for data assignment problems with examples of module placement. in 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992., 230430, Proceedings - IEEE International Symposium on Circuits and Systems, vol. 4, Institute of Electrical and Electronics Engineers Inc., pp. 1937-1940, 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992, San Diego, United States, 5/10/92. https://doi.org/10.1109/ISCAS.1992.230430

Constrained clustering for data assignment problems with examples of module placement. / Rose, Kenneth; Miller, David Jonathan.

1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992. Institute of Electrical and Electronics Engineers Inc., 1992. p. 1937-1940 230430 (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 4).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Constrained clustering for data assignment problems with examples of module placement

AU - Rose, Kenneth

AU - Miller, David Jonathan

PY - 1992/1/1

Y1 - 1992/1/1

N2 - We present a new approach to the class of optimization problems known'as data assignment problems, viewing them in the context of constrained clustering. The clustering algorithm we apply, an extension of the deterministic annealing method which incorporates clustering constraints, initially generates "soft" data assignments, then reduces the fuzziness of these assignments by lowering an effective temperature. In the low temperature limit, we obtain a legal data assignment solution which seeks to minimize the desired objective function. The gradual reduction of temperature allows the method to avoid some local minima which plague conventional descent methods. We implement our method on the two-dimensional module placement problem. For the minimum squared wire length objective, our algorithm is demonstrated to outperform several other methods on module placement examples from the literature.

AB - We present a new approach to the class of optimization problems known'as data assignment problems, viewing them in the context of constrained clustering. The clustering algorithm we apply, an extension of the deterministic annealing method which incorporates clustering constraints, initially generates "soft" data assignments, then reduces the fuzziness of these assignments by lowering an effective temperature. In the low temperature limit, we obtain a legal data assignment solution which seeks to minimize the desired objective function. The gradual reduction of temperature allows the method to avoid some local minima which plague conventional descent methods. We implement our method on the two-dimensional module placement problem. For the minimum squared wire length objective, our algorithm is demonstrated to outperform several other methods on module placement examples from the literature.

UR - http://www.scopus.com/inward/record.url?scp=33646898799&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646898799&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.1992.230430

DO - 10.1109/ISCAS.1992.230430

M3 - Conference contribution

AN - SCOPUS:33646898799

T3 - Proceedings - IEEE International Symposium on Circuits and Systems

SP - 1937

EP - 1940

BT - 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Rose K, Miller DJ. Constrained clustering for data assignment problems with examples of module placement. In 1992 IEEE International Symposium on Circuits and Systems, ISCAS 1992. Institute of Electrical and Electronics Engineers Inc. 1992. p. 1937-1940. 230430. (Proceedings - IEEE International Symposium on Circuits and Systems). https://doi.org/10.1109/ISCAS.1992.230430