SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2022.1166
Download full text from publisher
References listed on IDEAS
- Frank de Meijer & Renata Sotirov, 2021. "SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1262-1276, October.
- Caruso, G. & Gattone, S.A. & Fortuna, F. & Di Battista, T., 2021. "Cluster Analysis for mixed data: An application to credit risk evaluation," Socio-Economic Planning Sciences, Elsevier, vol. 73(C).
- Bissan Ghaddar & Miguel Anjos & Frauke Liers, 2011. "A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem," Annals of Operations Research, Springer, vol. 188(1), pages 155-174, August.
- Carl Eckart & Gale Young, 1936. "The approximation of one matrix by another of lower rank," Psychometrika, Springer;The Psychometric Society, vol. 1(3), pages 211-218, September.
- Karmitsa, Napsu & Bagirov, Adil M. & Taheri, Sona, 2017. "New diagonal bundle method for clustering problems in large data sets," European Journal of Operational Research, Elsevier, vol. 263(2), pages 367-379.
- Michael Brusco, 2006. "A Repetitive Branch-and-Bound Procedure for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer;The Psychometric Society, vol. 71(2), pages 347-363, June.
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.- Fuda Ma & Jin-Kao Hao, 2017. "A multiple search operator heuristic for the max-k-cut problem," Annals of Operations Research, Springer, vol. 248(1), pages 365-403, January.
- Sewell, Daniel K., 2018. "Visualizing data through curvilinear representations of matrices," Computational Statistics & Data Analysis, Elsevier, vol. 128(C), pages 255-270.
- Kohei Adachi & Nickolay T. Trendafilov, 2016. "Sparse principal component analysis subject to prespecified cardinality of loadings," Computational Statistics, Springer, vol. 31(4), pages 1403-1427, December.
- Norman Cliff, 1962. "Analytic rotation to a functional relationship," Psychometrika, Springer;The Psychometric Society, vol. 27(3), pages 283-295, September.
- Jushan Bai & Serena Ng, 2020. "Simpler Proofs for Approximate Factor Models of Large Dimensions," Papers 2008.00254, arXiv.org.
- Adele Ravagnani & Fabrizio Lillo & Paola Deriu & Piero Mazzarisi & Francesca Medda & Antonio Russo, 2024. "Dimensionality reduction techniques to support insider trading detection," Papers 2403.00707, arXiv.org, revised May 2024.
- Alfredo García-Hiernaux & José Casals & Miguel Jerez, 2012.
"Estimating the system order by subspace methods,"
Computational Statistics, Springer, vol. 27(3), pages 411-425, September.
- García-Hiernaux, Alfredo & Casals, José & Jerez, Miguel, 2007. "Estimating the system order by subspace methods," DES - Working Papers. Statistics and Econometrics. WS ws070301, Universidad Carlos III de Madrid. Departamento de EstadÃstica.
- Mitzi Cubilla‐Montilla & Ana‐Belén Nieto‐Librero & Ma Purificación Galindo‐Villardón & Ma Purificación Vicente Galindo & Isabel‐María Garcia‐Sanchez, 2019. "Are cultural values sufficient to improve stakeholder engagement human and labour rights issues?," Corporate Social Responsibility and Environmental Management, John Wiley & Sons, vol. 26(4), pages 938-955, July.
- Stegeman, Alwin, 2016. "A new method for simultaneous estimation of the factor model parameters, factor scores, and unique parts," Computational Statistics & Data Analysis, Elsevier, vol. 99(C), pages 189-203.
- Jos Berge & Henk Kiers, 1993. "An alternating least squares method for the weighted approximation of a symmetric matrix," Psychometrika, Springer;The Psychometric Society, vol. 58(1), pages 115-118, March.
- Shimeng Huang & Henry Wolkowicz, 2018. "Low-rank matrix completion using nuclear norm minimization and facial reduction," Journal of Global Optimization, Springer, vol. 72(1), pages 5-26, September.
- Antti J. Tanskanen & Jani Lukkarinen & Kari Vatanen, 2016. "Random selection of factors preserves the correlation structure in a linear factor model to a high degree," Papers 1604.05896, arXiv.org, revised Dec 2018.
- Ali Habibnia & Esfandiar Maasoumi, 2021.
"Forecasting in Big Data Environments: An Adaptable and Automated Shrinkage Estimation of Neural Networks (AAShNet),"
Journal of Quantitative Economics, Springer;The Indian Econometric Society (TIES), vol. 19(1), pages 363-381, December.
- Ali Habibnia & Esfandiar Maasoumi, 2019. "Forecasting in Big Data Environments: an Adaptable and Automated Shrinkage Estimation of Neural Networks (AAShNet)," Papers 1904.11145, arXiv.org.
- Jin-Xing Liu & Yong Xu & Chun-Hou Zheng & Yi Wang & Jing-Yu Yang, 2012. "Characteristic Gene Selection via Weighting Principal Components by Singular Values," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-10, July.
- Kargin, V. & Onatski, A., 2008.
"Curve forecasting by functional autoregression,"
Journal of Multivariate Analysis, Elsevier, vol. 99(10), pages 2508-2526, November.
- A. Onatski & V. Karguine, 2005. "Curve Forecasting by Functional Autoregression," Computing in Economics and Finance 2005 59, Society for Computational Economics.
- Yoshio Takane & Forrest Young & Jan Leeuw, 1977. "Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features," Psychometrika, Springer;The Psychometric Society, vol. 42(1), pages 7-67, March.
- Aldrin, Magne, 1996. "Moderate projection pursuit regression for multivariate response data," Computational Statistics & Data Analysis, Elsevier, vol. 21(5), pages 501-531, May.
- W. Gibson, 1962. "On the least-squares orthogonalization of an oblique transformation," Psychometrika, Springer;The Psychometric Society, vol. 27(2), pages 193-195, June.
- Gordana Ispirova & Tome Eftimov & Barbara Koroušić Seljak, 2020. "P-NUT: Predicting NUTrient Content from Short Text Descriptions," Mathematics, MDPI, vol. 8(10), pages 1-21, October.
- Cheng Lu & Zhibin Deng, 2021. "A branch-and-bound algorithm for solving max-k-cut problem," Journal of Global Optimization, Springer, vol. 81(2), pages 367-389, October.
More about this item
Keywords
clustering; semidefinite programming; branch and bound;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:orijoc:v:34:y:2022:i:4:p:2144-2162. 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.