Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Search research articles

Related Experiment Videos

Fully automatic clustering system.

G Patane¹, M Russo

¹Dipt. di Fisica, Messina Univ., Italy.

IEEE Transactions on Neural Networks

|February 5, 2008

Summary

This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by

Same author

Massive recurrent post-tonsillectomy bleedings revealing a transient factor XIII deficiency in a 10-year-old boy. A case report.

International journal of pediatrics & adolescent medicine·2019

Same author

A systematic review of database validation studies among fertility populations.

Human reproduction open·2019

Same author

Surveillance of patients with differentiated thyroid cancer and indeterminate response: a longitudinal study on basal thyroglobulin trend.

Journal of endocrinological investigation·2019

Same author

Multiple sclerosis and non-dystrophic myotonias: do they share a common pathophysiology?

Functional neurology·2019

Same author

Microencapsulated feruloyl esterase-producing lactobacilli ameliorate lipid profile and glycaemia in high fat diet-induced obese mice.

Beneficial microbes·2018

Same author

Early Clinical Experience with Double Ring Implantation for Aortic and Mitral Valve Repair.

The Thoracic and cardiovascular surgeon·2018

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

The fully automatic clustering system (FACS) efficiently determines optimal codebook dimensions for clustering and vector quantization. This technique rapidly converges, yielding a minimal number of codewords for desired error targets.

Area of Science:

Computer Science
Data Science
Machine Learning

Background:

Clustering and vector quantization are fundamental in data analysis.
Determining the optimal codebook dimension is a critical challenge.
Existing methods often require manual parameter tuning.

Purpose of the Study:

To introduce a fully automatic clustering system (FACS).
To enable automatic calculation of the codebook with a fixed error target.
To optimize codeword refinement and codebook size.

Main Methods:

The fully automatic clustering system (FACS) iteratively refines codewords.
Greedy techniques are employed to reduce computational cost per iteration.
Codebook dimension is automatically adjusted by adding or removing codewords.

Related Experiment Videos

Main Results:

FACS automatically calculates the optimal codebook dimension.
The system demonstrates heuristic convergence to a final solution.
A significantly low number of codewords is determined by FACS.

Conclusions:

FACS offers an efficient and automated approach to clustering and vector quantization.
The algorithm's rapid convergence and minimal codeword usage are key advantages.
This system addresses the challenge of optimal codebook dimension selection.