Good Clusterings Have Large Volume
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.2018.1779
Download full text from publisher
References listed on IDEAS
- Suck, Reinhard, 1992. "Geometric and combinatorial properties of the polytope of binary choice probabilities," Mathematical Social Sciences, Elsevier, vol. 23(1), pages 81-102, February.
- Ethan Anderes & Steffen Borgwardt & Jacob Miller, 2016. "Discrete Wasserstein barycenters: optimal transport for discrete data," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(2), pages 389-409, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Chen, Claire Y.T. & Sun, Edward W. & Miao, Wanyu & Lin, Yi-Bing, 2024. "Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing," European Journal of Operational Research, Elsevier, vol. 312(3), pages 1086-1107.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Smeulders, B., 2018. "Testing a mixture model of single-peaked preferences," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 101-113.
- Regenwetter, Michel & Marley, A. A. J. & Grofman, Bernard, 2002. "A general concept of majority rule," Mathematical Social Sciences, Elsevier, vol. 43(3), pages 405-428, July.
- Marley, A. A. J., 2002. "Random utility models and their applications: recent developments," Mathematical Social Sciences, Elsevier, vol. 43(3), pages 289-302, July.
- Steffen Borgwardt & Stephan Patterson, 2021. "On the computational complexity of finding a sparse Wasserstein barycenter," Journal of Combinatorial Optimization, Springer, vol. 41(3), pages 736-761, April.
- Suck, Reinhard, 2002. "Independent random utility representations," Mathematical Social Sciences, Elsevier, vol. 43(3), pages 371-389, July.
- Johannes von Lindheim, 2023. "Simple approximative algorithms for free-support Wasserstein barycenters," Computational Optimization and Applications, Springer, vol. 85(1), pages 213-246, May.
- Puccetti, Giovanni & Rüschendorf, Ludger & Vanduffel, Steven, 2020. "On the computation of Wasserstein barycenters," Journal of Multivariate Analysis, Elsevier, vol. 176(C).
- Steffen Borgwardt, 2022. "An LP-based, strongly-polynomial 2-approximation algorithm for sparse Wasserstein barycenters," Operational Research, Springer, vol. 22(2), pages 1511-1551, April.
More about this item
Keywords
clustering; linear programming; power diagram; polyhedron; normal cone; stability;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:67:y:2019:i:1:p:215-231. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.