Title

Decomposition-Based Simulated Annealing Technique For Data Clustering

Abstract

It has been demonstrated that simulated annealing provides high-quality results for the data clustering problem. However, existing simulated annealing schemes are memory-based algorithms; they are not suited for solving large problems such as data clustering which typically are too big to fit in the memory space in its entirety. Various buffer replacement policies, assuming either temporal or spatial locality, are not useful in this case since simulated annealing is based on a randomized search process. Poor locality of references will cause the memory to thrash because too many replacements are required.

Publication Date

1-1-1994

Publication Title

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Number of Pages

117-128

Document Type

Article; Proceedings Paper

Identifier

scopus

Personal Identifier

scopus

Socpus ID

0028022225 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0028022225

This document is currently not available here.

Share

COinS