IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v24y2024i4d10.1007_s12351-024-00872-3.html
   My bibliography  Save this article

Enhancing operational research in mechatronic systems via modularization: comparative analysis of four clustering algorithms using validation indices

Author

Listed:
  • Ioannis Mikrou

    (University of Western Macedonia)

  • Nickolas S. Sapidis

    (University of Western Macedonia
    Hellenic Open University)

Abstract

Modularization is one of the most robust methods that industries use to profit. This technique allows Operational Research to manage complex systems by efficiently dividing them into smaller ones and thus lowering the affiliated risks and costs. Mechatronic products are complex systems associated with diverse disciplines, laborious to compose and decompose, and can benefit from modularization. In this research, Partitioning Around Medoids (PAM), Ward’s method, Divisive ANAlysis (DIANA), and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithms are utilized in combination with Design Structure Matrices (DSM) to cluster 175 test subjects, and their results are compared using four validation techniques. Agglomerative Coefficient (AC), Divisive Coefficient (DC), Silhouette Coefficient (SC), Composed Density between and within clusters (CDbw), and the visual inspection of two-dimensional representations of each algorithm's clustering results are the validation techniques used in this research to find the most suitable algorithm for clustering such intricate systems. Additionally, other data that emerged from this research, such as time complexity, total execution time, and average RAM usage, are also used to evaluate the overall performance of each clustering algorithm.

Suggested Citation

  • Ioannis Mikrou & Nickolas S. Sapidis, 2024. "Enhancing operational research in mechatronic systems via modularization: comparative analysis of four clustering algorithms using validation indices," Operational Research, Springer, vol. 24(4), pages 1-44, December.
    • Handle: RePEc:spr:operea:v:24:y:2024:i:4:d:10.1007_s12351-024-00872-3
    DOI: 10.1007/s12351-024-00872-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-024-00872-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-024-00872-3?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. Mayra Z Rodriguez & Cesar H Comin & Dalcimar Casanova & Odemir M Bruno & Diego R Amancio & Luciano da F Costa & Francisco A Rodrigues, 2019. "Clustering algorithms: A comparative approach," PLOS ONE, Public Library of Science, vol. 14(1), pages 1-34, January.
    2. Katsikopoulos, Konstantinos V. & Durbach, Ian N. & Stewart, Theodor J., 2018. "When should we use simple decision models? A synthesis of various research strands," Omega, Elsevier, vol. 81(C), pages 17-25.
    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. Ioannis Mikrou & Nickolas S. Sapidis, 2025. "A Systematic Evaluation of Clustering Algorithms Against Expert-Derived Clustering," SN Operations Research Forum, Springer, vol. 6(2), pages 1-24, June.

    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. Fernandez Martinez, Roberto & Lostado Lorza, Ruben & Santos Delgado, Ana Alexandra & Piedra, Nelson, 2021. "Use of classification trees and rule-based models to optimize the funding assignment to research projects: A case study of UTPL," Journal of Informetrics, Elsevier, vol. 15(1).
    2. Polina Bombina & Dwayne Tally & Zachary B Abrams & Kevin R Coombes, 2024. "SillyPutty: Improved clustering by optimizing the silhouette width," PLOS ONE, Public Library of Science, vol. 19(6), pages 1-17, June.
    3. Narjes Vara & Mahdieh Mirzabeigi & Hajar Sotudeh & Seyed Mostafa Fakhrahmad, 2022. "Application of k-means clustering algorithm to improve effectiveness of the results recommended by journal recommender system," Scientometrics, Springer;Akadémiai Kiadó, vol. 127(6), pages 3237-3252, June.
    4. Cinelli, Marco & Kadziński, Miłosz & Gonzalez, Michael & Słowiński, Roman, 2020. "How to support the application of multiple criteria decision analysis? Let us start with a comprehensive taxonomy," Omega, Elsevier, vol. 96(C).
    5. Théophile Carniel & José Halloy & Jean-Michel Dalle, 2023. "A novel clustering approach to bipartite investor-startup networks," PLOS ONE, Public Library of Science, vol. 18(1), pages 1-20, January.
    6. Alfred Kume & Stephen G Walker, 2021. "The utility of clusters and a Hungarian clustering algorithm," PLOS ONE, Public Library of Science, vol. 16(8), pages 1-23, August.
    7. Mark, Ebba & Rafaty, Ryan & Schwarz, Moritz, 2024. "Spatial–temporal dynamics of structural unemployment in declining coal mining regions and potentialities of the ‘just transition’," Energy Policy, Elsevier, vol. 195(C).
    8. Katsikopoulos, Konstantinos V. & Şimşek, Özgür & Buckmann, Marcus & Gigerenzer, Gerd, 2022. "Transparent modeling of influenza incidence: Big data or a single data point from psychological theory?," International Journal of Forecasting, Elsevier, vol. 38(2), pages 613-619.
    9. Katsikopoulos, Konstantinos V. & Egozcue, Martin & Garcia, Luis Fuentes, 2022. "A simple model for mixing intuition and analysis," European Journal of Operational Research, Elsevier, vol. 303(2), pages 779-789.
    10. Tohalino, Jorge A.V. & Amancio, Diego R., 2022. "On predicting research grants productivity via machine learning," Journal of Informetrics, Elsevier, vol. 16(2).
    11. Christian Hennig, 2022. "An empirical comparison and characterisation of nine popular clustering methods," 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. 16(1), pages 201-229, March.
    12. Yair Neuman & Yochai Cohen, 2022. "Predicting Change in Emotion through Ordinal Patterns and Simple Symbolic Expressions," Mathematics, MDPI, vol. 10(13), pages 1-18, June.
    13. Hossam M J Mustafa & Masri Ayob & Mohd Zakree Ahmad Nazri & Graham Kendall, 2019. "An improved adaptive memetic differential evolution optimization algorithms for data clustering problems," PLOS ONE, Public Library of Science, vol. 14(5), pages 1-28, May.
    14. Giovana D da Silva & Filipi N Silva & Henrique F de Arruda & Bárbara C e Souza & Luciano da F Costa & Diego R Amancio, 2024. "Using full-text content to characterize and identify best seller books: A study of early 20th-century literature," PLOS ONE, Public Library of Science, vol. 19(4), pages 1-20, April.
    15. Kivikangas, J. Matias & Vilkkumaa, Eeva & Blank, Julian & Harjunen, Ville & Malo, Pekka & Deb, Kalyanmoy & Ravaja, Niklas J. & Wallenius, Jyrki, 2025. "Effects of many conflicting objectives on decision-makers’ cognitive burden and decision consistency," European Journal of Operational Research, Elsevier, vol. 322(1), pages 182-197.
    16. Corrêa, Edilson A. & Marinho, Vanessa Q. & Amancio, Diego R., 2020. "Semantic flow in language networks discriminates texts by genre and publication date," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    17. Ebba Mark & Ryan Rafaty & Moritz Schwarz, 2022. "Spatial-temporal dynamics of employment shocks in declining coal mining regions and potentialities of the 'just transition'," Papers 2211.12619, arXiv.org.
    18. Simon Crase & Suresh N Thennadil, 2022. "An analysis framework for clustering algorithm selection with applications to spectroscopy," PLOS ONE, Public Library of Science, vol. 17(3), pages 1-24, March.
    19. K. S. Sablin & E. S. Kagan & E. S. Chernova, 2020. "Clustering of the Russian coal mining regions: Investment and innovation activity," Journal of New Economy, Ural State University of Economics, vol. 21(1), pages 89-106, March.
    20. Chong, Woon Kian & Chang, Chiachi, 2024. "Information exploitation of human resource data with persistent homology," Journal of Business Research, Elsevier, vol. 172(C).

    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:operea:v:24:y:2024:i:4:d:10.1007_s12351-024-00872-3. 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.