Abstract: Many applications in data analysis begin with a set of points in a Euclidean space that is partitioned into clusters. Common tasks then are to devise a classifier deciding which of the clusters a new point is associated to, finding outliers with respect to the clusters, or identifying the type of clustering used for the partition. One of the common kinds of clusterings are (balanced) least-squares assignments with respect to a given set of sites. For these, there is a 'separating power diagram' for which each cluster lies in its own cell. In the present paper, we aim for efficient algorithms for outlier detection and the computation of thresholds that measure how similar a clustering is to a least-squares assignment for fixed sites. For this purpose, we devise a new model for the computation of a 'soft power diagram', which allows a soft separation of the clusters with 'point counting properties'; e.g. we are able to prescribe how many points we want to classify as outliers. As our results hold for a more general non-convex model of free sites, we describe it and our proofs in this more general way. Its locally optimal solutions satisfy the aforementioned point counting properties. For our target applications that use fixed sites, our algorithms are efficiently solvable to global optimality by linear programming.
Recommendations
- Soft power: upgrading chain macroeconomic policy through soft forks
- scientific article; zbMATH DE number 2169341
- Remarks on power structures
- scientific article; zbMATH DE number 3932826
- Power, cooperation indices and coalition structures
- On the power of simple diagrams
- Soft nexuses
- On soft mappings
- scientific article; zbMATH DE number 975325
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1424293 (Why is no real title available?)
- 10.1162/15324430260185628
- Data Analysis and Operations Research
- Minkowski-type theorems and least-squares clustering
- Multicategory classification by support vector machines
- Multiobjective multiclass soft-margin support vector machine and its solving technique based on Benson's method
- On optimal weighted balanced clusterings: gravity bodies and power diagrams
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Power Diagrams: Properties, Algorithms and Applications
- Support-vector networks
Cited in
(5)
This page was built for publication: On soft power diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894534)
