IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v305y2023i2p617-629.html
   My bibliography  Save this article

Seriation using tree-penalized path length

Author

Listed:
  • Aliyev, Denis A.
  • Zirbel, Craig L.

Abstract

Given a sample of n data points and an n by n dissimilarity matrix, data seriation methods produce a linear ordering of the objects, putting similar objects nearby in the ordering. One may visualize the reordered dissimilarity matrix with a heat map and thus understand the structure of the data, while still displaying the full matrix of dissimilarities. Good orderings produce heat maps that are easy to read and allow for clear interpretation.

Suggested Citation

  • Aliyev, Denis A. & Zirbel, Craig L., 2023. "Seriation using tree-penalized path length," European Journal of Operational Research, Elsevier, vol. 305(2), pages 617-629.
    • Handle: RePEc:eee:ejores:v:305:y:2023:i:2:p:617-629
    DOI: 10.1016/j.ejor.2022.06.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172200501X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.06.026?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. Hahsler, Michael & Hornik, Kurt & Buchta, Christian, 2008. "Getting Things in Order: An Introduction to the R Package seriation," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 25(i03).
    2. Rego, César & Gamboa, Dorabela & Glover, Fred & Osterman, Colin, 2011. "Traveling salesman problem heuristics: Leading methods, implementations and latest advances," European Journal of Operational Research, Elsevier, vol. 211(3), pages 427-441, June.
    3. Hahsler, Michael, 2017. "An experimental comparison of seriation methods for one-mode two-way data," European Journal of Operational Research, Elsevier, vol. 257(1), pages 133-143.
    4. Hahsler, Michael & Hornik, Kurt, 2007. "TSPInfrastructure for the Traveling Salesperson Problem," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 23(i02).
    Full references (including those not matched with items on IDEAS)

    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. Wu, Han-Ming & Tien, Yin-Jing & Chen, Chun-houh, 2010. "GAP: A graphical environment for matrix visualization and cluster analysis," Computational Statistics & Data Analysis, Elsevier, vol. 54(3), pages 767-778, March.
    2. Maciej Jagódka & Małgorzata Snarska, 2021. "The State of Human Capital and Innovativeness of Polish Voivodships in 2004–2018," Sustainability, MDPI, vol. 13(22), pages 1-20, November.
    3. Kamini Yadav & Hatim M. E. Geli, 2021. "Prediction of Crop Yield for New Mexico Based on Climate and Remote Sensing Data for the 1920–2019 Period," Land, MDPI, vol. 10(12), pages 1-27, December.
    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. Lancia, Giuseppe & Vidoni, Paolo, 2020. "Finding the largest triangle in a graph in expected quadratic time," European Journal of Operational Research, Elsevier, vol. 286(2), pages 458-467.
    6. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    7. Jiang, Zhongzhou & Liu, Jing & Wang, Shuai, 2016. "Traveling salesman problems with PageRank Distance on complex networks reveal community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 463(C), pages 293-302.
    8. Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Zhou, Xiaoyang, 2024. "An effective two phase heuristic for synchronized seru production scheduling and 3PL transportation problems," International Journal of Production Economics, Elsevier, vol. 268(C).
    9. Troxler, David & Zabel, Astrid, 2021. "Clearing forests to make way for a sustainable economy transition in Switzerland," Forest Policy and Economics, Elsevier, vol. 129(C).
    10. Nametala, Ciniro Aparecido Leite & Faria, Wandry Rodrigues & Lage, Guilherme Guimarães & Pereira, Benvindo Rodrigues, 2023. "Analysis of hourly price granularity implementation in the Brazilian deregulated electricity contracting environment," Utilities Policy, Elsevier, vol. 81(C).
    11. Mladenović, Nenad & Urošević, Dragan & Hanafi, Saı¨d & Ilić, Aleksandar, 2012. "A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 220(1), pages 270-285.
    12. Gary R. Waissi & Pragya Kaushal, 2020. "A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 73-87, March.
    13. Harold A. Hernández-Roig & M. Carmen Aguilera-Morillo & Rosa E. Lillo, 2021. "Functional Modeling of High-Dimensional Data: A Manifold Learning Approach," Mathematics, MDPI, vol. 9(4), pages 1-22, February.
    14. Maria Michela Dickson & Yves Tillé, 2016. "Ordered spatial sampling by means of the traveling salesman problem," Computational Statistics, Springer, vol. 31(4), pages 1359-1372, December.
    15. Piccarreta, Raffaella & Struffolino, Emanuela, 2019. "An Integrated Heuristic for Validation in Sequence Analysis," SocArXiv v7mj8, Center for Open Science.
    16. Shengbin Wang & Weizhen Rao & Yuan Hong, 2020. "A distance matrix based algorithm for solving the traveling salesman problem," Operational Research, Springer, vol. 20(3), pages 1505-1542, September.
    17. Martin Junge & Rainer Reisenzein, 2015. "Maximum Likelihood Difference Scaling versus Ordinal Difference Scaling of emotion intensity: a comparison," Quality & Quantity: International Journal of Methodology, Springer, vol. 49(5), pages 2169-2185, September.
    18. Nicholas J. Croucher & Joseph J. Campo & Timothy Q. Le & Jozelyn V. Pablo & Christopher Hung & Andy A. Teng & Claudia Turner & François Nosten & Stephen D. Bentley & Xiaowu Liang & Paul Turner & David, 2024. "Genomic and panproteomic analysis of the development of infant immune responses to antigenically-diverse pneumococci," Nature Communications, Nature, vol. 15(1), pages 1-20, December.
    19. Telcs, András & Kosztyán, Zsolt Tibor & Banász, Zsuzsanna & Csányi, Vivien Valéria, 2019. "Felsőoktatási ligák, parciális rangsorok képzése biklaszterezési eljárásokkal [How to rate higher education systems partial rankings using bi-clustering methods]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(9), pages 905-931.
    20. Piccarreta, Raffaella & Bonetti, Marco, 2019. "Assessing and comparing models for sequence data by microsimulation (with Supplementary Material)," SocArXiv 3mcfp, Center for Open Science.

    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:eee:ejores:v:305:y:2023:i:2:p:617-629. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.