{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:08Z","timestamp":1740123188538,"version":"3.37.3"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:00:00Z","timestamp":1540252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000836","name":"University of Liverpool","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000836","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10994-018-5764-7","type":"journal-article","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T21:05:47Z","timestamp":1540328747000},"page":"595-626","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Continuation methods for approximate large scale object sequencing"],"prefix":"10.1007","volume":"108","author":[{"given":"Xenophon","family":"Evangelopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Austin J.","family":"Brockmeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John Y.","family":"Goulermas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,23]]},"reference":[{"issue":"18","key":"5764_CR1","doi-asserted-by":"publisher","first-page":"10,101","DOI":"10.1073\/pnas.97.18.10101","volume":"97","author":"O Alter","year":"2000","unstructured":"Alter, O., Brown, P. O., & Botstein, D. (2000). Singular value decomposition for genome-wide expression data processing and modeling. Proceedings of the National Academy of Sciences, 97(18), 10,101\u201310,106.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"1\u20132","key":"5764_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","volume":"97","author":"KM Anstreicher","year":"2003","unstructured":"Anstreicher, K. M. (2003). Recent advances in the solution of quadratic assignment problems. Mathematical Programming, 97(1\u20132), 27\u201342.","journal-title":"Mathematical Programming"},{"key":"5764_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/S0097539795285771","volume":"28","author":"JE Atkins","year":"1998","unstructured":"Atkins, J. E., Boman, E. G., & Hendrickson, B. (1998). A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing, 28, 297\u2013310.","journal-title":"SIAM Journal on Computing"},{"key":"5764_CR4","doi-asserted-by":"crossref","unstructured":"Barnard, S. T., Pothen, A., & Simon, H. D. (1993). A spectral algorithm for envelope reduction of sparse matrices. In Supercomputing \u201993, ACM\/IEEE (pp. 493\u2013502).","DOI":"10.1145\/169627.169790"},{"key":"5764_CR5","doi-asserted-by":"crossref","unstructured":"Basak, J. (2008). A least square kernel machine with box constraints. In 19th International conference on pattern recognition (pp. 1\u20134).","DOI":"10.1109\/ICPR.2008.4761717"},{"key":"5764_CR6","doi-asserted-by":"crossref","unstructured":"Baudat, G., & Anouar, F. (2001). Kernel-based methods and function approximation. In Proceedings of the international joint conference on neural networks, 2001 (Vol.\u00a02, pp. 1244\u20131249).","DOI":"10.1109\/IJCNN.2001.939539"},{"issue":"11","key":"5764_CR7","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1057\/jors.1982.210","volume":"33","author":"MS Bazaraa","year":"1982","unstructured":"Bazaraa, M. S., & Sherali, H. D. (1982). On the use of exact and heuristic cutting plane methods for the quadratic assignment problem. Journal of the Operational Research Society, 33(11), 991\u20131003.","journal-title":"Journal of the Operational Research Society"},{"key":"5764_CR8","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas, D. P. (1995). Nonlinear programming. Belmont: Athena Scientific."},{"issue":"5","key":"5764_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0167-8655(83)90077-6","volume":"1","author":"A Blake","year":"1983","unstructured":"Blake, A. (1983). The least-disturbance principle and weak constraints. Pattern Recognition Letters, 1(5), 393\u2013399.","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"5764_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s003570000019","volume":"17","author":"MJ Brusco","year":"2000","unstructured":"Brusco, M. J., & Stahl, S. (2000). Using quadratic assignment methods to generate initial permutations for least-squares unidimensional scaling of symmetric proximity matrices. Journal of Classification, 17(2), 197\u2013223.","journal-title":"Journal of Classification"},{"issue":"3","key":"5764_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF02294442","volume":"66","author":"MJ Brusco","year":"2001","unstructured":"Brusco, M. J., & Stahl, S. (2001). Compact integer-programming models for extracting subsets of stimuli from confusion matrices. Psychometrika, 66(3), 405\u2013419.","journal-title":"Psychometrika"},{"issue":"3\u20134","key":"5764_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S. (2015). Convex optimization: Algorithms and complexity. Foundations and Trends in Machine Learning, 8(3\u20134), 231\u2013357.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5764_CR13","unstructured":"Burkard, R., & \u00c7ela, E. (1999). Linear assignment problems and extensions. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization (pp. 75\u2013149). Alphen aan den Rijn: Kluwer."},{"key":"5764_CR14","first-page":"1713","volume-title":"Handbook of combinatorial optimization: Volume 1\u20133","author":"RE Burkard","year":"1999","unstructured":"Burkard, R. E., \u00c7ela, E., Pardalos, P. M., & Pitsoulis, L. S. (1999). The quadratic assignment problem. In D.-Z. Du & P. M. Pardalos (Eds.), Handbook of combinatorial optimization: Volume 1\u20133 (pp. 1713\u20131809). Boston, MA: Springer."},{"key":"5764_CR15","volume-title":"The quadratic assignment problem: Theory and algorithms","author":"E \u00c7ela","year":"2013","unstructured":"\u00c7ela, E. (2013). The quadratic assignment problem: Theory and algorithms (Vol. 1). New York: Springer."},{"issue":"5","key":"5764_CR16","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1287\/opre.37.5.760","volume":"37","author":"N Christofides","year":"1989","unstructured":"Christofides, N., & Benavent, E. (1989). An exact algorithm for the quadratic assignment problem on a tree. Operations Research, 37(5), 760\u2013768.","journal-title":"Operations Research"},{"key":"5764_CR17","volume-title":"Metric methods for analyzing partially ranked data","author":"DE Critchlow","year":"2012","unstructured":"Critchlow, D. E. (2012). Metric methods for analyzing partially ranked data (Vol. 34). New York: Springer."},{"key":"5764_CR18","unstructured":"Csurka, G., Dance, C., Fan, L., Willamowski, J., & Bray, C. (2004). Visual categorization with bags of keypoints. In Workshop on statistical learning in computer vision, ECCV, Prague (Vol. 1, pp. 1\u201322)."},{"key":"5764_CR19","unstructured":"Davis, T. A., & Hu, Y. (2011). The University of Florida sparse matrix collection. ACM Transactions on Mathematical Software 38(1), 1\u201325, URL: http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices ."},{"key":"5764_CR20","unstructured":"Dheeru, D., & Taniskidou, E. K. (2017). UCI machine learning repository. Retrieved April, 2018, from http:\/\/archive.ics.uci.edu\/ml ."},{"key":"5764_CR21","doi-asserted-by":"crossref","unstructured":"Ding, C., & He, X. (2004). Linearized cluster assignment via spectral ordering. In Proceedings of the 21st international conference on machine learning (pp. 30\u201337).","DOI":"10.1145\/1015330.1015407"},{"issue":"1","key":"5764_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10618600.2013.874295","volume":"24","author":"D Earle","year":"2015","unstructured":"Earle, D., & Hurley, C. B. (2015). Advances in dendrogram seriation for application to visualization. Journal of Computational and Graphical Statistics, 24(1), 1\u201325.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"5764_CR23","doi-asserted-by":"crossref","unstructured":"Evangelopoulos, X., Brockmeier, A. J., Mu, T., & Goulermas, J. Y. (2017). A graduated non-convexity relaxation for large scale seriation. In Proceedings of SIAM international conference on data mining, 2017.","DOI":"10.1137\/1.9781611974973.52"},{"issue":"2","key":"5764_CR24","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"Fiedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23(2), 298\u2013305.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"5764_CR25","first-page":"1016","volume-title":"Advances in neural information processing systems 26","author":"F Fogel","year":"2013","unstructured":"Fogel, F., Jenatton, R., Bach, F., & d\u2019Aspremont, A. (2013). Convex relaxations for permutation problems. In C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, & K. Q. Weinberger (Eds.), Advances in neural information processing systems 26 (pp. 1016\u20131024). Red Hook: Curran Associates, Inc."},{"issue":"4","key":"5764_CR26","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1137\/130947362","volume":"36","author":"F Fogel","year":"2015","unstructured":"Fogel, F., Jenatton, R., Bach, F., & d\u2019Aspremont, A. (2015). Convex relaxations for permutation problems. SIAM Journal on Matrix Analysis and Applications, 36(4), 1465\u20131488.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"1\u20132","key":"5764_CR27","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10107-015-0875-4","volume":"156","author":"K Fountoulakis","year":"2016","unstructured":"Fountoulakis, K., & Gondzio, J. (2016). A second-order method for strongly convex $$\\ell _1$$ \u2113 1 -regularization problems. Mathematical Programming, 156(1\u20132), 189\u2013219.","journal-title":"Mathematical Programming"},{"issue":"1\u20132","key":"5764_CR28","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., & Wolfe, P. (1956). An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3(1\u20132), 95\u2013110.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"5764_CR29","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D Fulkerson","year":"1965","unstructured":"Fulkerson, D., & Gross, O. (1965). Incidence matrices and interval graphs. Pacific Journal of Mathematics, 15(3), 835\u2013855.","journal-title":"Pacific Journal of Mathematics"},{"key":"5764_CR30","volume-title":"Computer solution of large sparse positive definite systems","author":"A George","year":"1981","unstructured":"George, A., & Liu, J. W. (1981). Computer solution of large sparse positive definite systems. Upper Saddle River: Prentice Hall."},{"key":"5764_CR31","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/S089547989427470X","volume":"18","author":"A George","year":"1994","unstructured":"George, A., & Pothen, A. (1994). An analysis of spectral envelope reduction via quadratic assignment problems. SIAM Journal of Matrix Analysis and Application, 18, 706\u2013732.","journal-title":"SIAM Journal of Matrix Analysis and Application"},{"key":"5764_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers."},{"issue":"1","key":"5764_CR33","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-014-0757-1","volume":"153","author":"MX Goemans","year":"2015","unstructured":"Goemans, M. X. (2015). Smallest compact formulation for the permutahedron. Mathematical Programming, 153(1), 5\u201311.","journal-title":"Mathematical Programming"},{"issue":"1","key":"5764_CR34","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/1297-9686-43-7","volume":"43","author":"O Gonz\u00e1lez-Recio","year":"2011","unstructured":"Gonz\u00e1lez-Recio, O., & Forni, S. (2011). Genome-wide prediction of discrete traits using Bayesian regressions and machine learning. Genetics Selection Evolution, 43(1), 7.","journal-title":"Genetics Selection Evolution"},{"issue":"5","key":"5764_CR35","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TPAMI.2015.2470671","volume":"38","author":"JY Goulermas","year":"2016","unstructured":"Goulermas, J. Y., Kostopoulos, A., & Mu, T. (2016). A new measure for analyzing and fusing sequences of objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 38(5), 833\u2013848.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"5764_CR36","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ejor.2016.08.066","volume":"257","author":"M Hahsler","year":"2017","unstructured":"Hahsler, M. (2017). An experimental comparison of seriation methods for one-mode two-way data. European Journal of Operational Research, 257(1), 133\u2013143.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5764_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v025.i03","volume":"25","author":"M Hahsler","year":"2008","unstructured":"Hahsler, M., Hornik, K., & Buchta, C. (2008). Getting things in order: An introduction to the R package seriation. Journal of Statistical Software, 25(3), 1\u201334.","journal-title":"Journal of Statistical Software"},{"key":"5764_CR38","volume-title":"Inequalities","author":"GH Hardy","year":"1952","unstructured":"Hardy, G. H., Littlewood, J. E., & P\u00f3lya, G. (1952). Inequalities. Cambridge: Cambridge University Press."},{"key":"5764_CR39","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511811685","volume-title":"Multiple view geometry in computer vision","author":"RI Hartley","year":"2004","unstructured":"Hartley, R. I., & Zisserman, A. (2004). Multiple view geometry in computer vision (2nd ed.). Cambridge: Cambridge University Press.","edition":"2"},{"issue":"5","key":"5764_CR40","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1109\/TKDE.2011.33","volume":"24","author":"TC Havens","year":"2012","unstructured":"Havens, T. C., & Bezdek, J. C. (2012). An efficient formulation of the improved visual assessment of cluster tendency (iVAT) algorithm. IEEE Transactions on Knowledge and Data Engineering, 24(5), 813\u2013822.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1\u20132","key":"5764_CR41","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1080\/03081089508818381","volume":"39","author":"C Helmberg","year":"1995","unstructured":"Helmberg, C., Rendl, F., Mohar, B., & Poljak, S. (1995). A spectral approach to bandwidth and separator problems in graphs. Linear and Multilinear Algebra, 39(1\u20132), 73\u201390.","journal-title":"Linear and Multilinear Algebra"},{"key":"5764_CR42","volume-title":"The La T\u00e8ne cemetery at M\u00fcnsingen-Rain: Catalogue and relative chronology","author":"FR Hodson","year":"1968","unstructured":"Hodson, F. R. (1968). The La T\u00e8ne cemetery at M\u00fcnsingen-Rain: Catalogue and relative chronology (Vol. 5). Bern: St\u00e4mpfli."},{"key":"5764_CR43","unstructured":"Huber, P. J. (1992). Robust estimation of a location parameter. In S. Kotz & N. L. Johnson (Eds.), Breakthroughs in statistics: Methodology and distribution (pp. 492\u2013518). New York, NY: Springer."},{"key":"5764_CR44","unstructured":"Jaggi, M. (2013). Revisiting Frank\u2013Wolfe: Projection-free sparse convex optimization. In Proceedings of the 30th international conference on machine learning, , PMLR, Atlanta, Georgia, USA (Vol.\u00a028, pp. 427\u2013435)."},{"issue":"2","key":"5764_CR45","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","volume":"36","author":"M Juvan","year":"1992","unstructured":"Juvan, M., & Mohar, B. (1992). Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics, 36(2), 153\u2013168.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"5764_CR46","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/jgt.3190170313","volume":"17","author":"M Juvan","year":"1993","unstructured":"Juvan, M., & Mohar, B. (1993). Laplace eigenvalues and bandwidth-type invariants of graphs. Journal of Graph Theory, 17(3), 393\u2013407.","journal-title":"Journal of Graph Theory"},{"issue":"2","key":"5764_CR47","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/BF00538862","volume":"17","author":"DG Kendall","year":"1971","unstructured":"Kendall, D. G. (1971). Abundance matrices and seriation in archaeology. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete, 17(2), 104\u2013112.","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie und Verwandte Gebiete"},{"key":"5764_CR48","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, 4, 1942\u20131948.","journal-title":"Proceedings of the IEEE International Conference on Neural Networks"},{"key":"5764_CR49","unstructured":"Lacoste-Julien, S. (2016). Convergence Rate of Frank\u2013Wolfe for non-convex objectives. ArXiv e-prints arXiv:1607.00345 ."},{"key":"5764_CR50","unstructured":"Lacoste-Julien, S., & Jaggi, M. (2015). On the global linear convergence of Frank\u2013Wolfe optimization variants. In Proceedings of the 28th international conference on neural information processing systems, MIT Press, Cambridge, MA (pp. 496\u2013504)."},{"issue":"1","key":"5764_CR51","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.orl.2014.12.009","volume":"43","author":"M Laurent","year":"2015","unstructured":"Laurent, M., & Seminaroti, M. (2015). The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure. Operations Research Letters, 43(1), 103\u2013109.","journal-title":"Operations Research Letters"},{"key":"5764_CR52","unstructured":"Leskovec, J., & Krevl, A. (2014). SNAP datasets: Stanford large network dataset collection. Retrieved April, 2018, from http:\/\/snap.stanford.edu\/data ."},{"issue":"2","key":"5764_CR53","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1002\/sam.10071","volume":"3","author":"I Liiv","year":"2010","unstructured":"Liiv, I. (2010). Seriation and matrix reordering methods: An historical overview. Statistical Analysis and Data Mining, 3(2), 70\u201391.","journal-title":"Statistical Analysis and Data Mining"},{"key":"5764_CR54","unstructured":"Lim, C. H., & Wright, S. (2014). Beyond the Birkhoff polytope: Convex relaxations for vector permutation problems. In Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, & K. Q. Weinberger (Eds.), Advances in neural information processing systems (pp. 2168\u20132176)."},{"key":"5764_CR55","unstructured":"Lim, C. H., & Wright, S. (2016a). A box-constrained approach for hard permutation problems. In M. F. Balcan & K. Q. Weinberger (Eds.), Proceedings of the 33rd international conference on machine learning (pp. 2454\u20132463)."},{"key":"5764_CR56","unstructured":"Lim, C. H., & Wright, S. J. (2014). Sorting network relaxations for vector permutation problems. ArXiv e-prints arXiv:1407.6609 ."},{"key":"5764_CR57","unstructured":"Lim, C. H., & Wright, S. J. (2016b). Efficient Bregman projections onto the permutahedron and related polytopes. In A. Gretton & C. C. Robert (Eds.), Proceedings of the 19th international conference on artificial intelligence and statistics, PMLR, Cadiz, Spain, Proceedings of machine learning research (Vol. 51, pp. 1205\u20131213)."},{"issue":"6","key":"5764_CR58","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TPAMI.2013.223","volume":"36","author":"ZY Liu","year":"2014","unstructured":"Liu, Z. Y., & Qiao, H. (2014). GNCCP: Graduated nonconvexity and concavity procedure. IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(6), 1258\u20131267.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"5764_CR59","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P. O., Hahn, P., & Querido, T. (2007). A survey for the quadratic assignment problem. European Journal of Operational Research, 176(2), 657\u2013690.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5764_CR60","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D. G. (2004). Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 60(2), 91\u2013110.","journal-title":"International Journal of Computer Vision"},{"issue":"1","key":"5764_CR61","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/TPAMI.2015.2424894","volume":"38","author":"V Lyzinski","year":"2016","unstructured":"Lyzinski, V., Fishkind, D. E., Fiori, M., Vogelstein, J. T., Priebe, C. E., & Sapiro, G. (2016). Graph matching: Relax at your own risk. IEEE Transactions on Pattern Analysis Machine Intelligence, 38(1), 60\u201373.","journal-title":"IEEE Transactions on Pattern Analysis Machine Intelligence"},{"issue":"2","key":"5764_CR62","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10115-009-0215-1","volume":"23","author":"D Mavroeidis","year":"2010","unstructured":"Mavroeidis, D., & Bingham, E. (2010). Enhancing the stability and efficiency of spectral ordering with partial supervision and feature selection. Knowledge and Information Systems, 23(2), 243\u2013265.","journal-title":"Knowledge and Information Systems"},{"key":"5764_CR63","unstructured":"McAuley, J., & Leskovec, J. (2012). Learning to discover social circles in ego networks. In Proceedings of the 25th international conference on neural information processing systems, Curran Associates Inc., USA (pp. 539\u2013547)."},{"key":"5764_CR64","unstructured":"M\u00fchlenbein, H. (1989). Parallel genetic algorithms population genetics and combinatorial optimization. In Proceedings of the 3rd international conference on genetic algorithms, Morgan Kaufmann Publishers Inc., San Francisco, CA (pp. 416\u2013421)."},{"issue":"10","key":"5764_CR65","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1109\/TPAMI.2009.184","volume":"32","author":"N Quadrianto","year":"2010","unstructured":"Quadrianto, N., Smola, A. J., Song, L., & Tuytelaars, T. (2010). Kernelized sorting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(10), 1809\u20131821.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5764_CR66","doi-asserted-by":"crossref","unstructured":"Rangarajan, A., & Chellappa, R. (1990). Generalized graduated nonconvexity algorithm for maximum a posteriori image estimation. In Proceedings of the 10th international conference on pattern recognition (Vol.\u00a02, pp. 127\u2013133).","DOI":"10.1109\/ICPR.1990.119342"},{"issue":"20","key":"5764_CR67","doi-asserted-by":"publisher","first-page":"3188","DOI":"10.1093\/bioinformatics\/btx370","volume":"33","author":"A Recanati","year":"2017","unstructured":"Recanati, A., Br\u00fcls, T., & d\u2019Aspremont, A. (2017). A spectral algorithm for fast de novo layout of uncorrected long nanopore reads. Bioinformatics, 33(20), 3188\u20133194.","journal-title":"Bioinformatics"},{"key":"5764_CR68","unstructured":"Recanati, A., Servant, N., Vert, J. P., & d\u2019Aspremont, A. (2018). Robust seriation and applications to cancer genomics. ArXiv e-prints arXiv:1806.00664 ."},{"issue":"4","key":"5764_CR69","doi-asserted-by":"publisher","first-page":"293","DOI":"10.2307\/276978","volume":"16","author":"WS Robinson","year":"1951","unstructured":"Robinson, W. S. (1951). A method for chronologically ordering archaeological deposits. American Antiquity, 16(4), 293\u2013301.","journal-title":"American Antiquity"},{"issue":"1","key":"5764_CR70","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1186\/1471-2105-9-155","volume":"9","author":"YJ Tien","year":"2008","unstructured":"Tien, Y. J., Lee, Y. S., Wu, H. M., & Chen, C. H. (2008). Methods for simultaneously identifying coherent local clusters with smooth global patterns in gene expression profiles. BMC Bioinformatics, 9(1), 155.","journal-title":"BMC Bioinformatics"},{"issue":"10","key":"5764_CR71","doi-asserted-by":"publisher","first-page":"2301","DOI":"10.1093\/bioinformatics\/bti329","volume":"21","author":"D Tsafrir","year":"2005","unstructured":"Tsafrir, D., Tsafrir, I., Ein-Dor, L., Zuk, O., Notterman, D. A., & Domany, E. (2005). Sorting points into neighborhoods (SPIN): Data analysis and visualization by ordering distance matrices. Bioinformatics, 21(10), 2301\u20132308.","journal-title":"Bioinformatics"},{"key":"5764_CR72","doi-asserted-by":"crossref","unstructured":"Tuytelaars, T. (2010). Dense interest points. In IEEE computer society conference on computer vision and pattern recognition (pp. 2281\u20132288).","DOI":"10.1109\/CVPR.2010.5539911"},{"issue":"4","key":"5764_CR73","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0121002","volume":"10","author":"JT Vogelstein","year":"2015","unstructured":"Vogelstein, J. T., Conroy, J. M., Lyzinski, V., Podrazik, L. J., Kratzer, S. G., Harley, E. T., et al. (2015). Fast approximate quadratic programming for graph matching. PLOS ONE, 10(4), 1\u201317.","journal-title":"PLOS ONE"},{"key":"5764_CR74","doi-asserted-by":"crossref","unstructured":"Weinberger, K. Q., & Saul, L. K. (2004). Unsupervised learning of image manifolds by semidefinite programming. In Proceedings of the 2004 IEEE computer society conference on computer vision and pattern recognition, IEEE computer society, Washington, DC (pp. 988\u2013995).","DOI":"10.1109\/CVPR.2004.1315272"},{"issue":"6","key":"5764_CR75","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.cor.2009.09.002","volume":"37","author":"Y Xia","year":"2010","unstructured":"Xia, Y. (2010). An efficient continuation method for quadratic assignment problems. Computers & Operations Research, 37(6), 1027\u20131032.","journal-title":"Computers & Operations Research"},{"key":"5764_CR76","volume-title":"Nature-inspired metaheuristic algorithms","author":"XS Yang","year":"2008","unstructured":"Yang, X. S. (2008). Nature-inspired metaheuristic algorithms. Bristol: Luniver Press."},{"issue":"12","key":"5764_CR77","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., Bach, F., & Vert, J. P. (2009). A path following algorithm for the graph matching problem. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(12), 2227\u20132242.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5764-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-5764-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5764-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T18:01:43Z","timestamp":1720720903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-5764-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,23]]},"references-count":77,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["5764"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-5764-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2018,10,23]]},"assertion":[{"value":"27 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}