An Algorithm for the Separation-Preserving Transition of Clusterings

References

• Aggarwal C, Reddy C (2013) Data Clustering: Algorithms and Applications (Taylor & Francis, New York).Google Scholar
• Amazon Web Services (2016) Whitepaper: AWS storage services overview: A look at storage services offered.Google Scholar
• Aurenhammer F (1987) Power diagrams: Properties, algorithms and applications. SIAM J. Comput. 16(1):78–96.Google Scholar
• Aurenhammer F, Hoffmann F, Aronov B (1998) Minkowski-type theorems and least-squares clustering. Algorithmica 20(1):61–76.Google Scholar
• Barnes ER, Hoffman AJ, Rothblum UG (1992) Optimal partitions having disjoint convex and conic hulls. Math. Programming 54(1–3):69–86.Google Scholar
• Basu S, Davidson I, Wagstaff KL (2009) Clustering with Constraints: Advances in Algorithms, Theory and Applications (Chapman & Hall, Boca Raton, FL).Google Scholar
• Bennett KP, Mangasarian OL (1992) Multicategory discrimination via linear programming. Optim. Methods Software 3(1–3):27–39.Google Scholar
• Borgwardt S (2010) A combinatorial optimization approach to constrained clustering. PhD Thesis, archived by the Technical University of Munich, Munich, Germany.Google Scholar
• Borgwardt S (2013) On the diameter of partition polytopes and vertex-disjoint cycle cover. Math. Programming 141(1–2):1–20.Google Scholar
• Borgwardt S (2015) On soft power diagrams. J. Math. Model. Algorithms Oper. Res. 14(2):173–196.Google Scholar
• Borgwardt S, Happach F (2019) Good clusterings have large volume. Oper. Res. 67(1):215–231.Link, Google Scholar
• Borgwardt S, Viss C (2021) Constructing clustering transformations. SIAM J. Discrete Math. 35(1):152–178.Google Scholar
• Borgwardt S, Viss C (2022) Circuit walks in integral polyhedra. Discrete Optim. Forthcoming.Google Scholar
• Borgwardt S, Brieden A, Gritzmann P (2011) Constrained minimum-k-star clustering and its application to the consolidation of farmland. Oper. Res. 11(1):1–17.Google Scholar
• Borgwardt S, Brieden A, Gritzmann P (2014) Geometric clustering for the consolidation of farmland and woodland. Math. Intelligencer 36(2):37–44.Google Scholar
• Bredensteiner EJ, Bennett KP (1999) Multicategory classification by support vector machines. Comput. Optim. Appl. 12:53–79.Google Scholar
• Brieden A (2003) On the approximability of (discrete) convex maximization and its contribution to the consolidation of farmland. Habilitationsschrift, archived by the Technical University of Munich, Munich, Germany.Google Scholar
• Brieden A, Gritzmann P (2012) On optimal weighted balanced clusterings: Gravity bodies and power diagrams. SIAM J. Discrete Math. 26(2):415–434.Google Scholar
• Crammer K, Singer Y (2002) On the algorithmic implementation of multiclass kernel-based vector machines. J. Machine Learn. Res. 2:265–292.Google Scholar
• Fukuda K, Onn S, Rosta V (2003) An adaptive algorithm for vector partitioning. J. Global Optim. 25(3):305–319.Google Scholar
• Gates AJ, Wood IB, Hetrick WP, Ahn Y (2019) Element-centric clustering comparison unifies overlaps and hierarchy. Sci. Rep. 9(1):8574.Google Scholar
• Hwang FK, Rothblum U (2012) Partitions: Optimality and Clustering, Volume I: Single-Parameter (World Scientific, Singapore).Google Scholar
• Hwang FK, Onn S, Rothblum UG (1998) Representations and characterizations of vertices of bounded-shape partition polytopes. Linear Algebra Appl. 278(1–3):263–284.Google Scholar
• Jain AK, Murty MN, Flynn PJ (1999) Data clustering: A review. ACM Comput. Surveys 31(3):264–323.Google Scholar
• Lyakhovets DS, Baranov AV (2021) Group based job scheduling to increase the high-performance computing efficiency. Lobachevskii J. Math. 41:2558–2565.Google Scholar
• MacQueen JB (1967) Some methods of classification and analysis of multivariate observations. Le Cam LM, Neyman J, eds. Proc. Fifth Berkeley Sympos. Math. Statist. Probab., 281–297.Google Scholar
• Meilă M (2007) Comparing clusterings—An information based distance. J. Multivariate Anal. 98(5):873–895.Google Scholar
• Morey LC, Agresti A (1984) The measurement of classification agreement: An adjustment to the Rand statistic for chance agreement. Ed. Psych. Measurement 44(1):33–37.Google Scholar
• Reuther A, Byun C, Arcand W, Bestor D, Bergeron B, Hubbell M, Jones M, et al. (2016) Scheduler technologies in support of high performance data analysis. IEEE High Performance Extreme Comput. Conf., 1–6.Google Scholar
• Salim MA, Uram TD, Childers JT, Balaprakash P, Vishwanath V, Papka ME (2019) Balsam: Automated scheduling and execution of dynamic, data-intensive HPC workflows. Preprint, submitted September 18, https://arxiv.org/abs/1909.0874.Google Scholar
• Schölkopf B, Smola A (2002) Learning with Kernels (MIT Press, Cambridge, MA).Google Scholar
• Vanderbei RJ (2016) Linear Programming, 4th ed. (Springer, New York).Google Scholar
• Vapnik V (1998) Statistical Learning Theory (Wiley, Hoboken, NJ).Google Scholar
• Wagner S, Wagner D (2006) Comparing clusterings—An overview. Technical report 2006-04, Karlsruhe Institute of Technology, Germany.Google Scholar
• Weston J, Watkins C (1999) Support vector machines for multi-class pattern recognition. Proc. Seventh Eur. Sympos. Artificial Neural Networks, Bruges (Belgium), 219–224.Google Scholar
• Xu R, Wunsch D (2008) Clustering (Wiley-IEEE Press, Piscataway, NJ).Google Scholar