scispace - formally typeset
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

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

Data Mining Concepts and Techniques

TL;DR: Data mining is the search for new, valuable, and nontrivial information in large volumes of data, a cooperative effort of humans and computers that is possible to put data-mining activities into one of two categories: Predictive data mining, which produces the model of the system described by the given data set, or Descriptive data mining which produces new, nontrivials information based on the available data set.
Journal ArticleDOI

On Clustering Validation Techniques

TL;DR: The fundamental concepts of clustering are introduced while it surveys the widely known clustering algorithms in a comparative way and the issues that are under-addressed by the recent algorithms are illustrated.
Book

Cluster analysis

TL;DR: Cluster analysis is a multivariate procedure for detecting natural groupings in data that resembles discriminant analysis in one respect—the researcher seeks to classify a set of objects into subgroups although neither the number nor members of the subgroups are known.
Journal ArticleDOI

Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: Experimental analysis of power

TL;DR: This paper focuses on the use of nonparametric statistical inference for analyzing the results obtained in an experiment design in the field of computational intelligence, and presents a case study which involves a set of techniques in classification tasks.
Related Papers (5)