Cluster analysis algorithms for data reduction and classification of objects

  title={Cluster analysis algorithms for data reduction and classification of objects},
  author={Robert F. Ling},
  • R. F. Ling
  • Published 1 November 1981
  • Computer Science
  • Technometrics
In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important thing but also for daily activities. Many people now, from any level can use internet. The sources of internet connection can also be enjoyed in many places. As one of the benefits is to get the on-line cluster analysis algorithms for data reduction and classification of objects book, as the world window, as many people suggest. 
A Complexity Survey on Density based Spatial Clustering of Applications of Noise Clustering Algorithms
A survey is presented on DBSCAN algorithm and its enhancements with respect to time requirement and a significant comparison of D BSCAN versions is illustrated in this paper to help data scientist make decisions about the best version of DBS CAN to use.
Research on selecting initial points for k-means clustering
An expected 2-approximation algorithm for k-means clustering by means of selecting the k initial points from the input point set and some experimental results are given to test the valid of these algorithms.
Data clustering: a review
An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.
Cluster analysis and workload classification
Results indicate that the results of queueing network analysis are not stable when the classes of workload are constructed through the k-means algorithm, and it cannot be recommended that the most widely used clustering technique should be used in any workload characterization study without careful validation.
Approximate confidence intervals for the number of clusters
A bootstrap-based procedure is developed for obtaining approximate confidence bounds on the number of clusters in the “best” clustering and it is shown that a sample version of the loss function and optimal clustering converge strongly to their theoretical counterparts as the sample size tends to infinity.
A new density-based sampling algorithm
An hybrid algorithm is proposed that is density-based while managing distance concepts and can be accurate, according to the Rand Index, with both k-means and hierarchical clustering algorithms.
Y-Means: An Autonomous Clustering Algorithm
The experimental results show the robustness of the Y-means algorithm as well as its good performance against a set of other well known unsupervised clustering techniques and the performance of the proposed solution against different distance and outlier-detection functions is studied.