Overlapping Patterns Recognition with Linear and Non-Linear Separations using Positive Definite Kernels

  • BenN'Cir C
  • Essoussi N
N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

The detection of overlapping patterns in unlabeled data sets referred as overlapping clustering is an important issue in data mining. In real life applications, overlapping clustering algorithm should be able to detect clusters with linear and non-linear separations between clusters. We propose in this paper an overlapping clustering method based k-means algorithm using positive definite kernel. The proposed method is well adapted for clustering multi label data with linear and non linear separations between clusters. Experiments, performed on overlapping data sets, show the ability of the proposed method to detect clusters with complex and non linear boundaries. Empirical results obtained with the proposed method outperforms existing overlapping methods.

Cite

CITATION STYLE

APA

BenN'Cir, C.-E., & Essoussi, N. (2012). Overlapping Patterns Recognition with Linear and Non-Linear Separations using Positive Definite Kernels. International Journal of Computer Applications, 56(9), 1–8. https://doi.org/10.5120/8916-2981

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free