Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries

DOI10.1007/s00357-015-9181-3zbMath1335.62091OpenAlexW2237006239MaRDI QIDQ269541

Nadia Essoussi, Chiheb-Eddine Ben N'Cir, Mohamed Limam

Publication date: 19 April 2016

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-015-9181-3

zbMATH Keywords

kernel methodskernel \(K\)-meanslearning multi-labelsnon-disjoint clustersnon-linearly-separable clustersnonlinear separationsoverlapping clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Uses Software

• CHull
• ADPROCLUS

Cites Work

• Unnamed Item
• Market segmentation using brand strategy research: Bayesian inference with respect to mixtures of log-linear models
• Lowdimensional additive overlapping clustering
• Additive biclustering: a comparison of one new and two existing ALS algorithms
• Graph-based data clustering with overlaps
• A maximum likelihood methodology for clusterwise linear regression
• A sequential fitting procedure for linear data analysis models
• Algorithms for additive clustering of rectangular data tables
• The method of principal clusters
• Interval set clustering of web users with rough \(K\)-means
• Additive clustering and qualitative factor analysis methods for similarity matrices
• Support-vector networks
• A survey of kernel and spectral methods for clustering
• ECM: An evidential version of the fuzzy \(c\)-means algorithm
• 10.1162/153244302760200687
• Two Variants of the OKM for Overlapping Clustering

This page was built for publication: Kernel-based methods to identify overlapping clusters with linear and nonlinear boundaries