Journal ArticleDOI
Local k-proximal plane clustering
TLDR
A local k-proximal plane clustering (LkPPC) is proposed by bringing k-means into kPPC which will force the data points to center around some prototypes and thus localize the representations of the cluster center plane.Abstract:
k-Plane clustering (kPC) and k-proximal plane clustering (kPPC) cluster data points to the center plane, instead of clustering data points to cluster center in k-means. However, the cluster center plane constructed by kPC and kPPC is infinitely extending, which will affect the clustering performance. In this paper, we propose a local k-proximal plane clustering (LkPPC) by bringing k-means into kPPC which will force the data points to center around some prototypes and thus localize the representations of the cluster center plane. The contributions of our LkPPC are as follows: (1) LkPPC introduces localized representation of each cluster center plane to avoid the infinitely confusion. (2) Different from kPPC, our LkPPC constructs cluster center plane that makes the data points of the same cluster close to both the same center plane and the prototype, and meanwhile far away from the other clusters to some extent, which leads to solve eigenvalue problems. (3) Instead of randomly selecting the initial data points, a Laplace graph strategy is established to initialize the data points. (4) The experimental results on several artificial datasets and benchmark datasets show the effectiveness of our LkPPC.read more
Citations
More filters
Journal ArticleDOI
Hybridizing artificial bee colony with monarch butterfly optimization for numerical optimization problems
TL;DR: The experimental results show that the proposed HAM algorithm is clearly superior to the standard ABC and MBO algorithms, as well as to other well-known algorithms, in terms of achieving the best optimal value and convergence speed.
Journal ArticleDOI
Fuzzy least squares twin support vector clustering
TL;DR: The experimental results show that the proposed fuzzy least squares twin support vector clustering (F-LS-TWSVC) achieves comparable clustering accuracy to that of TWSVC with comparatively lesser computational time.
Journal Article
A Survey on Text Mining in Clustering
TL;DR: This paper emphasis on the various techniques that are used to cluster the text documents based on keywords, phrases and concepts, and includes the different performance measures that were used to evaluate the quality of clusters.
Journal ArticleDOI
Tree-based localized fuzzy twin support vector clustering with square loss function
Reshma Rastogi,Pooja Saigal +1 more
TL;DR: The proposed clustering algorithm Tree-TWSVC has efficient learning time, achieved due to the tree structure and the formulation that leads to solving a series of systems of linear equations, and can efficiently handle large datasets and outperforms other TWSVM-based clustering methods.
Journal ArticleDOI
k-Proximal plane clustering
TL;DR: A novel plane-based clustering, called k-proximal plane clustering (kPPC), where each center plane is not only close to the objective data points but also far away from the others by solving several eigenvalue problems.
References
More filters
Journal Article
An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons
TL;DR: The paper correctly introduces the basic procedures and some of the most advanced ones when comparing a control method, but it does not deal with some advanced topics in depth.
Journal ArticleDOI
An optimal graph theoretic approach to data clustering: theory and its application to image segmentation
Z. Wu,Richard M. Leahy +1 more
TL;DR: A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated, resulting in an optimal solution equivalent to that obtained by partitioning the complete equivalent tree and is able to handle very large graphs with several hundred thousand vertices.
Proceedings Article
Refining Initial Points for K-Means Clustering
Paul S. Bradley,Usama M. Fayyad +1 more
TL;DR: A procedure for computing a refined starting condition from a given initial one that is based on an efficient technique for estimating the modes of a distribution that allows the iterative algorithm to converge to a “better” local minimum.
Journal ArticleDOI
Fast and robust fuzzy c-means clustering algorithms incorporating local information for image segmentation
TL;DR: By incorporating local spatial and gray information together, a novel fast and robust FCM framework for image segmentation, i.e., fast generalized fuzzy c-means (FGFCM) clustering algorithms, is proposed and can mitigate the disadvantages of FCM_S and at the same time enhances the clustering performance.
Journal Article
A Brief Survey of Text Mining.
TL;DR: The main analysis tasks preprocessing, classification, clustering, information extraction and visualization are described and a number of successful applications of text mining are discussed.