𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


A new efficient algorithm based on DC pr
✍ Le Thi Hoai An; M. Tayeb Belghiti; Pham Dinh Tao πŸ“‚ Article πŸ“… 2006 πŸ› Springer US 🌐 English βš– 221 KB

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

A fast general-purpose clustering algori
✍ A. Annovi; M. Beretta πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 306 KB

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.

Simulation of continuous stirred ultrafi
✍ Chiranjib Bhattacharjee; Siddhartha Datta πŸ“‚ Article πŸ“… 2003 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 155 KB

## 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