An overlapping cluster algorithm to provide non-exhaustive clustering

DOI10.1016/j.ejor.2005.06.056zbMath1120.62048OpenAlexW2051690096MaRDI QIDQ2497259

Yen-Liang Chen, Hui-Ling Hu

Publication date: 4 August 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.06.056

zbMATH Keywords

data miningoverlapping clusterspartitioning clusteringnon-exhaustive clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)

Related Items

Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering, Conjecturable knowledge discovery: a fuzzy clustering approach, Synergies of operations research and data mining, Min sum clustering with penalties, GAPS: A clustering method using a new point symmetry-based distance measure, Applications of axiomatic fuzzy set clustering method on management strategic analysis

Uses Software

• clusfind

Cites Work

• Unnamed Item
• The EM algorithm for graphical association models with missing data
• Unsupervised fuzzy clustering with multi-center clusters
• On a class of fuzzy \(c\)-numbers clustering procedures for fuzzy data
• Finding Groups in Data