Optimal Least-Squares Unidimensional Scaling: Improved Branch-and-Bound Procedures and Comparison to Dynamic Programming
Author
Abstract
Suggested Citation
DOI: 10.1007/s11336-002-1032-6
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Patrick Groenen & Willem Heiser, 1996. "The tunneling method for global optimization in multidimensional scaling," Psychometrika, Springer;The Psychometric Society, vol. 61(3), pages 529-550, September.
- Vadim Pliner, 1996. "Metric unidimensional scaling and global optimization," Journal of Classification, Springer;The Classification Society, vol. 13(1), pages 3-18, March.
- L. Hubert & R. Golledge, 1981. "Matrix reorganization and dynamic programming: Applications to paired comparisons and unidimensional seriation," Psychometrika, Springer;The Psychometric Society, vol. 46(4), pages 429-441, December.
- P. J. F. Groenen & W. J. Heiser & J. J. Meulman, 1999. "Global Optimization in Least-Squares Multidimensional Scaling by Distance Smoothing," Journal of Classification, Springer;The Classification Society, vol. 16(2), pages 225-254, July.
- Michael Brusco, 2002. "A branch-and-bound algorithm for fitting anti-robinson structures to symmetric dissimilarity matrices," Psychometrika, Springer;The Psychometric Society, vol. 67(3), pages 459-471, September.
- Lawrence Hubert & Phipps Arabie & Jacqueline Meulman, 1998. "Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices," Psychometrika, Springer;The Psychometric Society, vol. 63(4), pages 341-358, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Michael Brusco & Renu Singh & Douglas Steinley, 2009. "Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis," Psychometrika, Springer;The Psychometric Society, vol. 74(4), pages 705-726, December.
- Michael J. Brusco & Douglas Steinley & Ashley L. Watts, 2022. "Disentangling relationships in symptom networks using matrix permutation methods," Psychometrika, Springer;The Psychometric Society, vol. 87(1), pages 133-155, March.
- Michael Brusco & Douglas Steinley, 2011. "A Tabu-Search Heuristic for Deterministic Two-Mode Blockmodeling of Binary Network Matrices," Psychometrika, Springer;The Psychometric Society, vol. 76(4), pages 612-633, October.
- Michael Brusco & Hans-Friedrich Köhn & Stephanie Stahl, 2008. "Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis," Psychometrika, Springer;The Psychometric Society, vol. 73(3), pages 503-522, September.
- Dorit S. Hochbaum & Erick Moreno-Centeno & Phillip Yelland & Rodolfo A. Catena, 2011. "Rating Customers According to Their Promptness to Adopt New Products," Operations Research, INFORMS, vol. 59(5), pages 1171-1183, October.
- Michael Brusco & Patrick Doreian, 2015. "An Exact Algorithm for the Two-Mode KL-Means Partitioning Problem," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 481-515, October.
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.- Michael Brusco & Hans-Friedrich Köhn & Stephanie Stahl, 2008. "Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis," Psychometrika, Springer;The Psychometric Society, vol. 73(3), pages 503-522, September.
- Michael Brusco & Stephanie Stahl, 2001. "An interactive multiobjective programming approach to combinatorial data analysis," Psychometrika, Springer;The Psychometric Society, vol. 66(1), pages 5-24, March.
- Michael J. Brusco & Douglas Steinley & Ashley L. Watts, 2022. "Disentangling relationships in symptom networks using matrix permutation methods," Psychometrika, Springer;The Psychometric Society, vol. 87(1), pages 133-155, March.
- Michael Brusco, 2002. "A branch-and-bound algorithm for fitting anti-robinson structures to symmetric dissimilarity matrices," Psychometrika, Springer;The Psychometric Society, vol. 67(3), pages 459-471, September.
- Groenen, Patrick J. F. & Franses, Philip Hans, 2000. "Visualizing time-varying correlations across stock markets," Journal of Empirical Finance, Elsevier, vol. 7(2), pages 155-172, August.
- Groenen, P.J.F. & Kaymak, U. & van Rosmalen, J.M., 2006. "Fuzzy clustering with Minkowski distance," Econometric Institute Research Papers EI 2006-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Köhn, Hans-Friedrich, 2010. "Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition," Computational Statistics & Data Analysis, Elsevier, vol. 54(10), pages 2343-2357, October.
- Groenen, P.J.F. & Borg, I., 2013. "The Past, Present, and Future of Multidimensional Scaling," Econometric Institute Research Papers EI 2013-07, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Groenen, P.J.F. & van de Velden, M., 2004. "Multidimensional scaling," Econometric Institute Research Papers EI 2004-15, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- S. Hess & E. Suárez & J. Camacho & G. Ramírez & B. Hernández, 2001. "Reliability of Coordinates Obtained by MINISSA Concerning the Order of Presented Stimuli," Quality & Quantity: International Journal of Methodology, Springer, vol. 35(2), pages 117-128, May.
- Antanas Žilinskas & Julius Žilinskas, 2008. "A hybrid method for multidimensional scaling using city-block distances," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 429-443, December.
- Julius Žilinskas, 2012. "Parallel branch and bound for multidimensional scaling with city-block distances," Journal of Global Optimization, Springer, vol. 54(2), pages 261-274, October.
- de Leeuw, Jan & Mair, Patrick, 2009. "Multidimensional Scaling Using Majorization: SMACOF in R," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 31(i03).
- van den Burg, G.J.J. & Groenen, P.J.F., 2014. "GenSVM: A Generalized Multiclass Support Vector Machine," Econometric Institute Research Papers EI 2014-33, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- K. Van Deun & P. J. F. Groenen, 2005.
"Majorization Algorithms for Inspecting Circles, Ellipses, Squares, Rectangles, and Rhombi,"
Operations Research, INFORMS, vol. 53(6), pages 957-967, December.
- van Deun, K. & Groenen, P.J.F., 2003. "Majorization algorithms for inspecting circles, ellipses, squares, rectangles, and rhombi," Econometric Institute Research Papers EI 2003-35, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Marc Robini & Pierre-Jean Reissman, 2013. "From simulated annealing to stochastic continuation: a new trend in combinatorial optimization," Journal of Global Optimization, Springer, vol. 56(1), pages 185-215, May.
- Hua Zhou & Kenneth L. Lange, 2010. "On the Bumpy Road to the Dominant Mode," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 37(4), pages 612-631, December.
- K. Deun & P. Groenen & W. Heiser & F. Busing & L. Delbeke, 2005. "Interpreting degenerate solutions in unfolding by use of the vector model and the compensatory distance model," Psychometrika, Springer;The Psychometric Society, vol. 70(1), pages 45-69, March.
- Dorit S. Hochbaum & Erick Moreno-Centeno & Phillip Yelland & Rodolfo A. Catena, 2011. "Rating Customers According to Their Promptness to Adopt New Products," Operations Research, INFORMS, vol. 59(5), pages 1171-1183, October.
- Michael Brusco & Patrick Doreian, 2015. "An Exact Algorithm for the Two-Mode KL-Means Partitioning Problem," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 481-515, October.
More about this item
Keywords
combinatorial data analysis; least-squares unidimensional scaling; branch-and-bound; dynamic programming;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:spr:psycho:v:70:y:2005:i:2:p:253-270. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.