Name
Abstract | ||
|---|---|---|
In this paper, we suggest a new technique for soft clustering of multidimensional data. It is based on a new convex voting model, where each voter chooses a party with certain probability depending on the divergence between his/her preferences and the position of the party. The parties can react on the results of polls by changing their positions. We prove that under some natural assumptions this system has a unique fixed point, providing a unique solution for soft clustering. The solution of our model can be found either by imitation of the sequential elections, or by direct minimization of a convex potential function. In both cases, the methods converge linearly to the solution. We provide our methods with worst-case complexity bounds. To the best of our knowledge, these are the first polynomial-time complexity results in this field. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00500-020-05148-4 | SOFT COMPUTING |
Keywords | DocType | Volume |
Soft clustering,Fuzzy clustering,C-means,Polynomial-time complexity bounds,Electoral models | Journal | 24.0 |
Issue | ISSN | Citations |
SP23.0 | 1432-7643 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yurii Nesterov | 1 | 1800 | 168.77 |