Fully Automatic Clustering System  

Oleh:

Russo, M. ; Patane, G.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 13 no. 6 (2002), page 1285-1298.
Topik: CLUSTERING; fully automatic; clustering system

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.7A Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

In this paper, the fully automatic clustering system (FACS) is presented. It is a technique for clustering and vector quantization whose objective is the automatic calculation of the codebook of the right dimension, the desired error (or target) being fixed. At each iteration, FACS tries to improve the setting of the existing codewords and, if necessary, some elements are removed from or added to the codebook. In order to save on the number of computations per iteration, greedy techniques are adopted. It has been demonstrated, from a heuristic point of view, that the number of the codewords determined by FACS is very low and that the algorithm quickly converges toward the final solution.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali