Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Kernel-Based Methods to Identify Overlapping Clusters with Linear and Nonlinear Boundaries

Kernel-Based Methods to Identify Overlapping Clusters with Linear and Nonlinear Boundaries Detecting overlapping structures and identifying non-linearly-separable clusters with complex shapes are two major issues in clustering. This paper presents two kernel based methods that produce overlapping clusters with both linear and nonlinear boundaries. To improve separability of input patterns, we used for both methods Mercer kernel technique. First, we propose Kernel Overlapping K-means I (KOKMI), a centroid based method, generalizing kernel K-means to produce nondisjoint clusters with nonlinear separations. Second, we propose Kernel Overlapping K-means II (KOKMII), a medoid based method improving the previous method in terms of efficiency and complexity. Experiments performed on non-linearly-separable and real multi-labeled data sets show that proposed learning methods outperform the existing ones. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Classification Springer Journals

Kernel-Based Methods to Identify Overlapping Clusters with Linear and Nonlinear Boundaries

Loading next page...
 
/lp/springer-journals/kernel-based-methods-to-identify-overlapping-clusters-with-linear-and-RjZ8ljtu0k

References (46)

Publisher
Springer Journals
Copyright
Copyright © 2015 by Classification Society of North America
Subject
Statistics; Statistical Theory and Methods; Pattern Recognition; Bioinformatics; Signal, Image and Speech Processing; Psychometrics; Marketing
ISSN
0176-4268
eISSN
1432-1343
DOI
10.1007/s00357-015-9181-3
Publisher site
See Article on Publisher Site

Abstract

Detecting overlapping structures and identifying non-linearly-separable clusters with complex shapes are two major issues in clustering. This paper presents two kernel based methods that produce overlapping clusters with both linear and nonlinear boundaries. To improve separability of input patterns, we used for both methods Mercer kernel technique. First, we propose Kernel Overlapping K-means I (KOKMI), a centroid based method, generalizing kernel K-means to produce nondisjoint clusters with nonlinear separations. Second, we propose Kernel Overlapping K-means II (KOKMII), a medoid based method improving the previous method in terms of efficiency and complexity. Experiments performed on non-linearly-separable and real multi-labeled data sets show that proposed learning methods outperform the existing ones.

Journal

Journal of ClassificationSpringer Journals

Published: Jul 8, 2015

There are no references for this article.