[33] Frank-Michael Schleif and Peter Tino. Indefinite proximity learning: A review. Neural Computation, 27(10):2039-2096, 2015.
[34] Suvrit Sra, Joel Tropp, and Inderjit Dhillon. Triangle fixing algorithms for the metric nearness problem. Advances in Neural Information Processing Systems, 17, 2004.
[35] Justin Brickell, Inderjit S Dhillon, Suvrit Sra, and Joel A Tropp. The metric nearness problem. SIAM Journal on Matrix Analysis and Applications, 30(1):375-396, 2008.
[36] Wenye Li, Fangchen Yu, and Zichen Ma. Metric nearness made practical. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 37, pages 8648-8656, 2023.
[37] Arijit Biswas and David W Jacobs. An efficient algorithm for learning distances that obey the triangle inequality. In *British Machine Vision Conference*, pages 10–1, 2015.
[38] Andrej Gisbrecht and Frank-Michael Schleif. Metric and non-metric proximity transformations at linear costs. Neurocomputing, 167:643-657, 2015.
[39] Wenye Li and Fangchen Yu. Calibrating distance metrics under uncertainty. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pages 219-234. Springer, 2022.
[40] Fangchen Yu, Rui Bao, Jianfeng Mao, and Wenye Li. Highly-efficient robinson-foulds distance estimation with matrix correction. In 26th European Conference on Artificial Intelligence, pages 2914-2921, 2023.
[41] Fangchen Yu, Zhan Shi, Yuqi Ma, Jianfeng Mao, and Wenye Li. From incompleteness to unity: A framework for multi-view clustering with missing values. International Conference on Neural Information Processing, pages 101-112, 2023.
[42] Liu Yang and Rong Jin. Distance metric learning: A comprehensive survey. Michigan State University, 2(2):4, 2006.
[43] Nathan Krislock and Henry Wolkowicz. Euclidean distance matrices and applications. In Handbook on Semidefinite, Conic and Polynomial Optimization, pages 879-914. Springer, 2012.
[44] John Clifford Gower. Euclidean distance geometry. Mathematical Scientist, 7(1):1-14, 1982.
[45] Warren S Torgerson. Multidimensional scaling: I. theory and method. Psychometrika, 17(4):401-419, 1952.
[46] Isaac J Schoenberg. Metric spaces and positive definite functions. Transactions of the American Mathematical Society, 44(3):522-536, 1938.
[47] Wenye Li. Estimating Jaccard index with missing observations: a matrix calibration approach. Advances in Neural Information Processing Systems, 28, 2015.
[48] Wenye Li. Scalable calibration of affinity matrices from incomplete observations. In Asian Conference on Machine Learning, pages 753-768. PMLR, 2020.
[49] Rafic Nader, Alain Bretto, Bassam Mourad, and Hassan Abbas. On the positive semi-definite property of similarity matrices. Theoretical Computer Science, 755:13-28, 2019.
[50] Frank R Deutsch. Best Approximation in Inner Product Spaces. Springer Science & Business Media, New York, US, 2012.
[51] Richard L Dykstra. An algorithm for restricted least squares regression. Journal of the American Statistical Association, 78(384):837-842, 1983.
[52] James P Boyle and Richard L Dykstra. A method for finding projections onto the intersection of convex sets in hilbert spaces. In Advances in Order Restricted Statistical Inference, pages 28-47. Springer, 1986.
[53] Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2):217-288, 2011.