An approach to cluster separability in a partition
From MaRDI portal
Publication:528797
DOI10.1016/J.INS.2015.02.011zbMATH Open1360.62350OpenAlexW2083472447MaRDI QIDQ528797FDOQ528797
Authors: Kristian Sabo, Rudolf Scitovski 
Publication date: 16 May 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2015.02.011
Recommendations
Cited In (15)
- A combinatorial approach to assess the separability of clusters
- A novel optimization approach towards improving separability of clusters
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Title not available (Why is that?)
- Incremental method for multiple line detection problem -- iterative reweighted approach
- A statistical approach to class separability
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- Clustering and isolation in the consensus problem for partitions
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- A note on clutter partitions
- Global optimality in \(k\)-means clustering
- Separation index and partial membership for clustering
- On separable clusterings
- Searching for an optimal partition of incomplete data with application in modeling energy efficiency of public buildings
- A tractable multi-partitions clustering
This page was built for publication: An approach to cluster separability in a partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528797)
