Close category search window
 

A Dynamic Clustering Algorithm Based on Small Data Set

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tao Peng ; Coll. of Comput. Sci., Wuhan Univ. of Sci. & Eng., Wuhan, China ; Minghua Jiang ; Ming Hu

The traditional clustering algorithms are designed for large dataset or vary large dataset. It is not easy to cluster the small dataset because of the loss of the statistical character and probability character. In this paper, the class ration is introduced, based on the class ratio, the dynamic clustering algorithm is proposed. The dataset are divided into all possible classes, and the class ratios are computed, the min class ratio is chosen and the clustering about the min class ratio is the best clustering. With the experiments, the schema is an effective way for the clustering of small data sets.

Published in:
Computer Graphics, Imaging and Visualization, 2009. CGIV '09. Sixth International Conference on

Date of Conference: 11-14 Aug. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.