IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v17y2025i7p2827-d1618242.html
   My bibliography  Save this article

Importance Classification Method for Signalized Intersections Based on the SOM-K-GMM Clustering Algorithm

Author

Listed:
  • Ziyi Yang

    (School of Transportation and Vehicle Engineering, Shandong University of Technology, Zibo 255000, China)

  • Yang Chen

    (School of Transportation and Vehicle Engineering, Shandong University of Technology, Zibo 255000, China)

  • Dong Guo

    (School of Transportation and Vehicle Engineering, Shandong University of Technology, Zibo 255000, China)

  • Fangtong Jiao

    (School of Transportation and Vehicle Engineering, Shandong University of Technology, Zibo 255000, China)

  • Bin Zhou

    (State Key Lab of Intelligent Transportation System, Beijing 100088, China)

  • Feng Sun

    (School of Transportation and Vehicle Engineering, Shandong University of Technology, Zibo 255000, China)

Abstract

Urbanization has intensified traffic loads, posing significant challenges to the efficiency and stability of urban road networks. Overloaded nodes risk congestion, thus making accurate intersection importance classification essential for resource optimization. This study proposes a hybrid clustering method that combines Self-Organizing Maps (SOMs), K-Means, and the Gaussian Mixture Model (GMM), which is supported by the Traffic Flow–Network Topology–Social Economy (TNS) evaluation framework. This framework integrates three dimensions—traffic flow, road network topology, and socio-economic features—capturing six key indicators: intersection saturation, traffic flow balance, mileage coverage, capacity, betweenness efficiency, and node activity. The SOMs method determines the optimal k value and centroids for K-Means, while GMM validates the cluster membership probabilities. The proposed model achieved a silhouette coefficient of 0.737, a Davies–Bouldin index of 1.003, and a Calinski–Harabasz index of 57.688, with the silhouette coefficient improving by 78.1% over SOMs alone, 65.2% over K-Means, and 11.5% over SOM-K-Means, thus demonstrating high robustness. The intersection importance ranking was conducted using the Mahalanobis distance method, and it was validated on 40 intersections within the road network of Zibo City. By comparing the importance rankings across static, off-peak, morning peak, and evening peak periods, a dynamic ranking approach is proposed. This method provides a robust basis for optimizing resource allocation and traffic management at urban intersections.

Suggested Citation

  • Ziyi Yang & Yang Chen & Dong Guo & Fangtong Jiao & Bin Zhou & Feng Sun, 2025. "Importance Classification Method for Signalized Intersections Based on the SOM-K-GMM Clustering Algorithm," Sustainability, MDPI, vol. 17(7), pages 1-26, March.
  • Handle: RePEc:gam:jsusta:v:17:y:2025:i:7:p:2827-:d:1618242
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/17/7/2827/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/17/7/2827/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gary Reyes & Roberto Tolozano-Benites & Laura Lanzarini & César Estrebou & Aurelio F. Bariviera & Julio Barzola-Monteses, 2023. "Methodology for the Identification of Vehicle Congestion Based on Dynamic Clustering," Sustainability, MDPI, vol. 15(24), pages 1-18, December.
    2. Ziwei Wang & Lin Hu & Fang Wang & Miao Lin & Ning Wu, 2024. "Assessing the Impact of Different Population Density Scenarios on Two-Wheeler Accident Characteristics at Intersections," Sustainability, MDPI, vol. 16(5), pages 1-14, February.
    3. Sun, Chenshuo & Pei, Xin & Hao, Junheng & Wang, Yewen & Zhang, Zuo & Wong, S.C., 2018. "Role of road network features in the evaluation of incident impacts on urban traffic mobility," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 101-116.
    4. Wu, Peijie & Chen, Tianyi & Diew Wong, Yiik & Meng, Xianghai & Wang, Xueqin & Liu, Wei, 2023. "Exploring key spatio-temporal features of crash risk hot spots on urban road network: A machine learning approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    5. Gomez, Daniel & Gonzalez-Aranguena, Enrique & Manuel, Conrado & Owen, Guillermo & del Pozo, Monica & Tejada, Juan, 2003. "Centrality and power in social networks: a game theoretic approach," Mathematical Social Sciences, Elsevier, vol. 46(1), pages 27-54, August.
    6. Hossein Moradi & Sara Sasaninejad & Sabine Wittevrongel & Joris Walraevens, 2023. "Dynamically estimating saturation flow rate at signalized intersections: a data-driven technique," Transportation Planning and Technology, Taylor & Francis Journals, vol. 46(2), pages 160-181, February.
    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. Felix Fritz & Stefano Moretti & Jochen Staudacher, 2023. "Social Ranking Problems at the Interplay between Social Choice Theory and Coalitional Games," Mathematics, MDPI, vol. 11(24), pages 1-22, December.
    2. Sridhar Mandyam & Usha Sridhar, 2017. "DON and Shapley Value for Allocation among Cooperating Agents in a Network: Conditions for Equivalence," Studies in Microeconomics, , vol. 5(2), pages 143-161, December.
    3. González–Arangüena, E. & Manuel, C. & Owen, G. & del Pozo, M., 2017. "The within groups and the between groups Myerson values," European Journal of Operational Research, Elsevier, vol. 257(2), pages 586-600.
    4. C. Manuel & D. Martín, 2021. "A value for communication situations with players having different bargaining abilities," Annals of Operations Research, Springer, vol. 301(1), pages 161-182, June.
    5. Francis Bloch & Matthew O. Jackson & Pietro Tebaldi, 2023. "Centrality measures in networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(2), pages 413-453, August.
    6. Belik, Ivan & Jörnsten, Kurt, 2015. "Shapley-Based Stackelberg Leadership Formation in Networks," Discussion Papers 2015/16, Norwegian School of Economics, Department of Business and Management Science.
    7. van den Brink, René & Rusinowska, Agnieszka, 2022. "The degree measure as utility function over positions in graphs and digraphs," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1033-1044.
    8. Trudeau, Christian & Vidal-Puga, Juan, 2020. "Clique games: A family of games with coincidence between the nucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 103(C), pages 8-14.
    9. Wen, Xiangxi & Tu, Congliang & Wu, Minggong, 2018. "Node importance evaluation in aviation network based on “No Return” node deletion method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 546-559.
    10. Lindelauf, R.H.A. & Hamers, H.J.M. & Husslage, B.G.M., 2013. "Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda," European Journal of Operational Research, Elsevier, vol. 229(1), pages 230-238.
    11. Harald Wiese, 2009. "Applying cooperative game theory to power relations," Quality & Quantity: International Journal of Methodology, Springer, vol. 43(4), pages 519-533, July.
    12. E. C. Gavilán & C. Manuel & R. Brink, 2023. "Directed communication in games with directed graphs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(3), pages 584-617, October.
    13. Navarro, Florian, 2020. "The center value: A sharing rule for cooperative games on acyclic graphs," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 1-13.
    14. Inmaculada Gutiérrez & Juan Antonio Guevara & Daniel Gómez & Javier Castro & Rosa Espínola, 2021. "Community Detection Problem Based on Polarization Measures: An Application to Twitter: The COVID-19 Case in Spain," Mathematics, MDPI, vol. 9(4), pages 1-27, February.
    15. Aguiar, Victor H. & Pongou, Roland & Tondji, Jean-Baptiste, 2018. "A non-parametric approach to testing the axioms of the Shapley value with limited data," Games and Economic Behavior, Elsevier, vol. 111(C), pages 41-63.
    16. Stefano Moretti & Fioravante Patrone, 2008. "Transversality of the Shapley value," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 1-41, July.
    17. Lindelauf, R. & Hamers, H.J.M. & Husslage, B.G.M., 2011. "Game Theoretic Centrality Analysis of Terrorist Networks : The Cases of Jemaah Islamiyah and Al Qaeda," Other publications TiSEM e91f6269-bcac-4790-b42f-3, Tilburg University, School of Economics and Management.
    18. René van den Brink & Agnieszka Rusinowska, 2017. "The degree measure as utility function over positions in networks," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01592181, HAL.
    19. René Van Den Brink & Agnieszka Rusinowska, 2023. "Degree Centrality, von Neumann-Morgenstern Expected Utility and Externalities in Networks," Documents de travail du Centre d'Economie de la Sorbonne 23012, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    20. Belik, Ivan & Jörnsten, Kurt, 2015. "The Analysis of Leadership Formation in Networks Based on Shapley Value," Discussion Papers 2015/2, Norwegian School of Economics, Department of Business and Management 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:gam:jsusta:v:17:y:2025:i:7:p:2827-:d:1618242. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.