Process clustering with an algorithm based on a coupling metric
β Scribed by Tzvi Raz; Alan Yaung
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 723 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0164-1212
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, a version of K-median problem, one of the most popular and best studied clustering measures, is discussed. The model using squared Euclidean distances terms to which the K-means algorithm has been successfully applied is considered. A fast and robust algorithm based on DC (Difference
We present a fast general-purpose algorithm for high-throughput clustering of data ''with a twodimensional organization''. The algorithm is designed to be implemented with FPGAs or custom electronics. The key feature is a processing time that scales linearly with the amount of data to be processed.
## Abstract A mass transfer model based on unsteady state mass balance over the concentration boundary layer, coupled with back transport resulting from the stirring action, opposing ultrafiltrate flux, has been developed in the present study. This model uses semiβinfinite consideration to solve th