IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v54y2012i2p261-274.html
   My bibliography  Save this article

Parallel branch and bound for multidimensional scaling with city-block distances

Author

Listed:
  • Julius Žilinskas

Abstract

Multidimensional scaling is a technique for exploratory analysis of multidimensional data. The essential part of the technique is minimization of a multimodal function with unfavorable properties like invariants and non-differentiability. Recently a branch and bound algorithm for multidimensional scaling with city-block distances has been proposed for solution of medium-size problems exactly. The algorithm exploits piecewise quadratic structure of the objective function. In this paper a parallel version of the branch and bound algorithm for multidimensional scaling with city-block distances has been proposed and investigated. Parallel computing enabled solution of larger problems what was not feasible with the sequential version. Copyright Springer Science+Business Media, LLC. 2012

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jglopt:v:54:y:2012:i:2:p:261-274
    DOI: 10.1007/s10898-010-9624-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9624-7
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9624-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lawrence Hubert & Phipps Arabie & Matthew Hesson-Mcinnis, 1992. "Multidimensional scaling in the city-block metric: A combinatorial approach," Journal of Classification, Springer;The Classification Society, vol. 9(2), pages 211-236, December.
    2. Bernard Gendron & Teodor Gabriel Crainic, 1994. "Parallel Branch-and-Branch Algorithms: Survey and Synthesis," Operations Research, INFORMS, vol. 42(6), pages 1042-1066, December.
    3. Phipps Arabie, 1991. "Was euclid an unnecessarily sophisticated psychologist?," Psychometrika, Springer;The Psychometric Society, vol. 56(4), pages 567-587, December.
    4. 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.
    5. Jan Leeuw, 1984. "Differentiability of Kruskal's stress at a local minimum," Psychometrika, Springer;The Psychometric Society, vol. 49(1), pages 111-113, March.
    6. Michael J. Brusco, 2001. "A Simulated Annealing Heuristic for Unidimensional and Multidimensional (City-Block) Scaling of Symmetric Proximity Matrices," Journal of Classification, Springer;The Classification Society, vol. 18(1), pages 3-33, January.
    7. J. Žilinskas, 2006. "Multidimensional Scaling In Protein And Pharmacological Sciences," World Scientific Book Chapters, in: I D L Bogle & J Žilinskas (ed.), Computer Aided Methods In Optimal Design And Operations, chapter 15, pages 139-148, World Scientific Publishing Co. Pte. Ltd..
    8. Leung, Pui Lam & Lau, Kin-nam, 2004. "Estimating the city-block two-dimensional scaling model with simulated annealing," European Journal of Operational Research, Elsevier, vol. 158(2), pages 518-524, October.
    9. Patrick Groenen & Rudolf Mathar & Willem Heiser, 1995. "The majorization approach to multidimensional scaling for Minkowski distances," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 3-19, March.
    10. J. Fernando Vera & Willem J. Heiser & Alex Murillo, 2007. "Global Optimization in Any Minkowski Metric: A Permutation-Translation Simulated Annealing Algorithm for Multidimensional Scaling," Journal of Classification, Springer;The Classification Society, vol. 24(2), pages 277-301, September.
    11. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Juan F. R. Herrera & José M. G. Salmerón & Eligius M. T. Hendrix & Rafael Asenjo & Leocadio G. Casado, 2017. "On parallel Branch and Bound frameworks for Global Optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 547-560, November.
    2. Carrizosa, Emilio & Guerrero, Vanesa & Romero Morales, Dolores, 2018. "On Mathematical Optimization for the visualization of frequencies and adjacencies as rectangular maps," European Journal of Operational Research, Elsevier, vol. 265(1), pages 290-302.

    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.
    1. 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.
    2. 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.
    3. 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.
    4. Carrizosa, Emilio & Guerrero, Vanesa & Romero Morales, Dolores, 2018. "On Mathematical Optimization for the visualization of frequencies and adjacencies as rectangular maps," European Journal of Operational Research, Elsevier, vol. 265(1), pages 290-302.
    5. Andrew Webb, 1997. "Radial basis functions for exploratory data analysis: An iterative majorisation approach for Minkowski distances based on multidimensional scaling," Journal of Classification, Springer;The Classification Society, vol. 14(2), pages 249-267, September.
    6. Eva Ceulemans & Iven Mechelen & Iwin Leenen, 2007. "The Local Minima Problem in Hierarchical Classes Analysis: An Evaluation of a Simulated Annealing Algorithm and Various Multistart Procedures," Psychometrika, Springer;The Psychometric Society, vol. 72(3), pages 377-391, September.
    7. 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.
    8. 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.
    9. J. Vera & Rodrigo Macías & Willem Heiser, 2009. "A Latent Class Multidimensional Scaling Model for Two-Way One-Mode Continuous Rating Dissimilarity Data," Psychometrika, Springer;The Psychometric Society, vol. 74(2), pages 297-315, June.
    10. Groenen, P.J.F. & Winsberg, S. & Rodriguez, O. & Diday, E., 2006. "I-Scal: Multidimensional scaling of interval dissimilarities," Computational Statistics & Data Analysis, Elsevier, vol. 51(1), pages 360-378, November.
    11. Kohn, Hans-Friedrich, 2006. "Combinatorial individual differences scaling within the city-block metric," Computational Statistics & Data Analysis, Elsevier, vol. 51(2), pages 931-946, November.
    12. Stephen L. France & Wen Chen & Yumin Deng, 2017. "ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 11(2), pages 371-393, June.
    13. 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.
    14. Oliver Hinz & Jochen Eckert, 2010. "The Impact of Search and Recommendation Systems on Sales in Electronic Commerce," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 2(2), pages 67-77, April.
    15. Roland G. Fryer & Matthew O. Jackson, 2002. "Categorical Cognition: A Psychological Model of Categories and Identification in Decision Making," Microeconomics 0211002, University Library of Munich, Germany.
    16. Patrick Groenen & Rudolf Mathar & Willem Heiser, 1995. "The majorization approach to multidimensional scaling for Minkowski distances," Journal of Classification, Springer;The Classification Society, vol. 12(1), pages 3-19, March.
    17. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    18. Y. Xu & T. K. Ralphs & L. Ladányi & M. J. Saltzman, 2009. "Computational Experience with a Software Framework for Parallel Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 383-397, August.
    19. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    20. Vera, J. Fernando & Di­az-Garci­a, Jose A., 2008. "A global simulated annealing heuristic for the three-parameter lognormal maximum likelihood estimation," Computational Statistics & Data Analysis, Elsevier, vol. 52(12), pages 5055-5065, August.

    Corrections

    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:jglopt:v:54:y:2012:i:2:p:261-274. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.