An overlapping cluster algorithm to provide non-exhaustive clustering
From MaRDI portal
Publication:2497259
DOI10.1016/J.EJOR.2005.06.056zbMATH Open1120.62048OpenAlexW2051690096MaRDI QIDQ2497259FDOQ2497259
Authors: 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
Recommendations
- An overlapping co-clustering algorithm by maximizing modularity
- Optimal clustering in the context of overlapping cluster analysis
- A three-way decisions approach to density-based overlapping clustering
- Algorithms for additive clustering of rectangular data tables
- Measuring the component overlapping in the Gaussian mixture model
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)
Cites Work
Cited In (13)
- An overlapping co-clustering algorithm by maximizing modularity
- Two Variants of the OKM for Overlapping Clustering
- Conjecturable knowledge discovery: a fuzzy clustering approach
- Min sum clustering with penalties
- Optimal clustering in the context of overlapping cluster analysis
- Variance based three-way clustering approaches for handling overlapping clustering
- Measuring the component overlapping in the Gaussian mixture model
- Applications of axiomatic fuzzy set clustering method on management strategic analysis
- Preventing overlaps in agglomerative hierarchical conceptual clustering
- Bayesian-OverDBC: a Bayesian density-based approach for modeling overlapping clusters
- Model selection strategies for determining the optimal number of overlapping clusters in additive overlapping partitional clustering
- GAPS: A clustering method using a new point symmetry-based distance measure
- Synergies of operations research and data mining
Uses Software
This page was built for publication: An overlapping cluster algorithm to provide non-exhaustive clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497259)