Abstract
A Euclidean distance matrix (EDM) is a table of distance-square between points on a k-dimensional Euclidean space, with applications in many fields (e.g., engineering, geodesy, economics, genetics, biochemistry, and psychology). A problem that often arises is the absence (or uncertainty) of some EDM elements. In many situations, only a subset of all pairwise distances is available and it is desired to have some procedure to estimate the missing distances. In this paper, we address the problem of missing data in EDM through low-rank matrix completion techniques. We exploit the fact that the rank of a EDM is at most \(k+2\) and does not depend on the number of points, which is, in general, much bigger then k. We use a singular value decomposition approach that considers the rank of the matrix to be completed and computes, in each iteration, a parameter that controls the convergence of the method. After performing a number of computational experiments, we could observe that our proposal was able to recover, with high precision, random EDMs with more than 1000 points and up to 98% of missing data in few minutes. In addition, our method required a smaller number of iterations when compared to other competitive state-of-art technique.
Similar content being viewed by others
References
Billinge S, Duxbury P, Gonçalves D, Lavor C, Mucherino A (2016) Assigned and unassigned distance geometry: applications to biological molecules and nanostructures. 4OR 14:337–376
Biswas P, Liang TC, Toh KC, Wang TC, Ye Y (2006) Semidefinite programming approaches for sensor network localization with noisy distance. IEEE Trans Autom Sci Eng 3(4):360–371
Cai JF, Candès EJ, Shen Z (2008) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956–1982
Candès EJ, Plan Y (2009) Matrix completion with noise. Proc IEEE 98(6):925–936
Candès EJ, Recht B (2008) Exact matrix completion via convex optimization. Found Comput Math 9:717–772
Cui A, Peng J, Li H, Zhang C, Yu Y (2018) Affine matrix rank minimization problem via non-convex fraction function penalty. J Comput Appl Math 336:353–374. https://doi.org/10.1016/j.cam.2017.12.048. URL http://www.sciencedirect.com/science/article/pii/S0377042718300165 (ISSN 0377-0427)
Dokmanić I, Parhizkar R, Ranieri R, Vetterli M (2015) Euclidean distance matrices. IEEE Signal Process Mag 32(6):12–30
Fazel M (2002) Matrix rank minimization with applications. PhD thesis, Stanford University
Golub GH, Van Loan CF (1989) Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore (ISBN 0-8018-5413-X)
Havel TF, Wüthrich K (1985) An evaluation of the combined use of nuclear magnetic resonance and distance geometry for the determination of protein conformations in solution. J Mol Biol 182(2):281–294
Krislock N (2010) Semidefinite facial reduction for low-rank Euclidean distance matrix completion. PhD thesis, School of Computer Science, University of Waterloo
Leeuw J (2004) Multidimensional scaling. International encyclopedia of the social and behavioral sciences. Elsevier, Amsterdam, pp 13512–13519
Liberti L, Lavor C, Maculan N, Mucherino A (2014) Euclidean distance geometry and applications. SIAM Rev 56:3–69
Mazumder R, Hastie T, Tibshirani R (2010) Spectral regularization algorithms for learning large incomplete matrices. J Mach Learn Res 11:2287–2322
Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38(1):49–95
Acknowledgements
The authors would like to thank the Brazilian research agencies CAPES, CNPq, and FAPESP for their financial support.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Jinyun Yuan.
Rights and permissions
About this article
Cite this article
Moreira, N.J.M., Duarte, L.T., Lavor, C. et al. A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix. Comp. Appl. Math. 37, 4989–4999 (2018). https://doi.org/10.1007/s40314-018-0613-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40314-018-0613-7