On the proximity for community detection
碩士 === 國立臺北大學 === 統計學系 === 101 === Social network analysis (SNA) provides a systematic method to uncover social network structures. One of the main components of SNA is the adjacency matrix, which carries information about the relationship between pairs of vertices in a network. This thesis work pre...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/27788511939498279561 |
id |
ndltd-TW-101NTPU0337011 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101NTPU03370112016-03-23T04:13:30Z http://ndltd.ncl.edu.tw/handle/27788511939498279561 On the proximity for community detection 社群網絡偵測之相鄰矩陣轉換 Yeh, Ying-Ling 葉盈伶 碩士 國立臺北大學 統計學系 101 Social network analysis (SNA) provides a systematic method to uncover social network structures. One of the main components of SNA is the adjacency matrix, which carries information about the relationship between pairs of vertices in a network. This thesis work presents an approach that can help to strengthen this information. By simple operations on the adjacency matrix, proximity matrices are created. Each proximity matrix quantifies the relationship between pairs of vertices from a different point of view. With the use of the proximity matrices, additional information may be retrieved. To detect community structures from the proximity matrices, the elliptical seriation algorithm (Chen, 2002) implemented in GAP (generalized association plots, Chen, 2002) is considered, which is a java-designed exploratory data analysis (EDA) software. The performance of GAP is compared to that of the Girvan-Newman algorithm (Girvan and Newman, 2002). Community structures detected by the two algorithms are evaluated and examined. Shiu, Shang-Ying 須上英 2013 學位論文 ; thesis 51 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺北大學 === 統計學系 === 101 === Social network analysis (SNA) provides a systematic method to uncover social network structures. One of the main components of SNA is the adjacency matrix, which carries information about the relationship between pairs of vertices in a network. This thesis work presents an approach that can help to strengthen this information. By simple operations on the adjacency matrix, proximity matrices are created. Each proximity matrix quantifies the relationship between pairs of vertices from a different point of view. With the use of the proximity matrices, additional information may be retrieved.
To detect community structures from the proximity matrices, the elliptical seriation algorithm (Chen, 2002) implemented in GAP (generalized association plots, Chen, 2002) is considered, which is a java-designed exploratory data analysis (EDA) software. The performance of GAP is compared to that of the Girvan-Newman algorithm (Girvan and Newman, 2002). Community structures detected by the two algorithms are evaluated and examined.
|
author2 |
Shiu, Shang-Ying |
author_facet |
Shiu, Shang-Ying Yeh, Ying-Ling 葉盈伶 |
author |
Yeh, Ying-Ling 葉盈伶 |
spellingShingle |
Yeh, Ying-Ling 葉盈伶 On the proximity for community detection |
author_sort |
Yeh, Ying-Ling |
title |
On the proximity for community detection |
title_short |
On the proximity for community detection |
title_full |
On the proximity for community detection |
title_fullStr |
On the proximity for community detection |
title_full_unstemmed |
On the proximity for community detection |
title_sort |
on the proximity for community detection |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/27788511939498279561 |
work_keys_str_mv |
AT yehyingling ontheproximityforcommunitydetection AT yèyínglíng ontheproximityforcommunitydetection AT yehyingling shèqúnwǎngluòzhēncèzhīxiānglínjǔzhènzhuǎnhuàn AT yèyínglíng shèqúnwǎngluòzhēncèzhīxiānglínjǔzhènzhuǎnhuàn |
_version_ |
1718210346467983360 |