๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Clustering in non-stationary environments using a clan-based evolutionary approach

โœ Scribed by G. Phanendra Babu


Publisher
Springer-Verlag
Year
1995
Tongue
English
Weight
794 KB
Volume
73
Category
Article
ISSN
0340-1200

No coin nor oath required. For personal study only.

โœฆ Synopsis


Clustering techniques are used to discover structure in data by optimizing a defined criterion function. Most of these methods assume that the data are stationary, and these techniques are based on gradient descent which converge to a locally optimal clustering. There are many potential applications that require clustering to be performed in non-stationary temporal environments. In this paper, we investigate the applicability of a clan-based evolutionary optimization method for clustering data in non-stationary environments. Due to the stochastic nature of the technique, the problem of becoming entrapped in local optima is avoided, and the method can converge to (nearly) optimal clusters. Different cases are considered in the experiments, and the results demonstrate the efficacy of the evolutionary approach for clustering time-varying data.


๐Ÿ“œ SIMILAR VOLUMES


Task Matching and Scheduling in Heteroge
โœ Lee Wang; Howard Jay Siegel; Vwani P. Roychowdhury; Anthony A. Maciejewski ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

To exploit a heterogeneous computing (HC) environment, an application task may be decomposed into subtasks that have data dependencies. Subtask matching and scheduling consists of assigning subtasks to machines, ordering subtask execution for each machine, and ordering intermachine data transfers. T