?????????????????????????????????????????????????????????? Closeness Centrality
Full Metadata
| Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Chinnapong Angsuchotmetee | - |
| dc.contributor.author | Tinnapat Punnapathiran | - |
| dc.contributor.department | ?????????????? | - |
| dc.contributor.department | Faculty of Science | - |
| dc.date.accessioned | 2024-09-26 16:11 | - |
| dc.date.accessioned | 2026-02-11T02:42:13Z | - |
| dc.date.available | 2024-09-26 16:11 | - |
| dc.date.issued | 2024 | - |
| dc.description | ????????,???????????????????,2567 | - |
| dc.description.abstract | Graph clustering is crucial in logistics, social analysis, semantic-based search engines, and urban planning for uncovering data relationships. One of the most common graph clustering algorithms is Girvan-Newman, which relies on Edge Centrality statistics by iteratively removing edges with high betweenness centrality. However, exploring alternative centrality metrics can enhance its performance. This study presents a modified Girvan-Newman clustering algorithm that adopts a different centrality metric, namely Closeness Centrality, particularly suitable for data where the distance between nodes significantly influences their clustering, such as logistic analysis, urban planning, and network route planning. Our custom closeness-centrality-based modified Girvan-Newman algorithm aims to produce more compact and densely clustered outcomes. Experimental results show that the newly developed algorithm in this project outperforms the original Girvan-Newman in the conductance metric on graph clustering performance evaluation datasets and the Hat Yai tourism area dataset. | - |
| dc.description.abstract | ???????????????????????????????????????????????????????? ???????????? Social Network ?????????????????????????? ????????????????? ???????????????????????????????????????????????????????????? Girvan-Newman ??????????????????????????????????????????????? Edge Betweenness Centrality ?????????????????????????????????????????????????????????????? Edge Betweenness Centrality ?????? Girvan-Newman ????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????? ???????????????????????????????????????????????????????????????????????????? Closeness Centrality ??????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????? ???? ?????????????????????????????????? ??????? ????????????????? Closeness Centrality ????? Girvan-Newman ???????????????????????????????????????? Edge Betweenness Centrality ???????????????????????????????????????????????????????????????????????????????? Girvan-Newman ???????????????? Conductance ?????????????????????????????????????????????????????????? ????????????????????????????????????????? | - |
| dc.identifier.uri | https://kb.psu.ac.th/handle/2025/19746 | - |
| dc.language.iso | th | - |
| dc.publisher | Prince of Songkla University | - |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Thailand | - |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/th/ | - |
| dc.subject | ??????????????? | - |
| dc.subject | Closeness Centrality | - |
| dc.subject | Girvan-Newman Algorith | - |
| dc.title | ?????????????????????????????????????????????????????????? Closeness Centrality | - |
| dc.title.alternative | ?????????????????????????????????????????????????????????? Closeness Centrality | - |
| dc.type | Thesis | - |
Files
Files
Collections


