東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Finding communities in social networks using graph embeddings

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Finding communities in social networks using graph embeddings/ by Mosab Alfaqeeh, David B. Skillicorn.
作者:	Alfaqeeh, Mosab.
其他作者:	Skillicorn, David B.
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	ix, 177 p. :ill. (some col.), digital ;24 cm.
內容註:	Chapter 1: Introduction -- Chapter 2: Background -- Chapter 3: Building blocks -- Chapter 4: Social network data -- Chapter 5: Methodology -- Chapter 6: Results and validation -- Chapter 7: Conclusions.
Contained By:	Springer Nature eBook
標題:	Social networks - Mathematical models. -
電子資源:	https://doi.org/10.1007/978-3-031-60916-9
ISBN:	9783031609169

Finding communities in social networks using graph embeddings
Alfaqeeh, Mosab.

Finding communities in social networks using graph embeddings[electronic resource] /by Mosab Alfaqeeh, David B. Skillicorn. - Cham :Springer Nature Switzerland :2024. - ix, 177 p. :ill. (some col.), digital ;24 cm. - Lecture notes in social networks,2190-5436. - Lecture notes in social networks..

Chapter 1: Introduction -- Chapter 2: Background -- Chapter 3: Building blocks -- Chapter 4: Social network data -- Chapter 5: Methodology -- Chapter 6: Results and validation -- Chapter 7: Conclusions.

Community detection in social networks is an important but challenging problem. This book develops a new technique for finding communities that uses both structural similarity and attribute similarity simultaneously, weighting them in a principled way. The results outperform existing techniques across a wide range of measures, and so advance the state of the art in community detection. Many existing community detection techniques base similarity on either the structural connections among social-network users, or on the overlap among the attributes of each user. Either way loses useful information. There have been some attempts to use both structure and attribute similarity but success has been limited. We first build a large real-world dataset by crawling Instagram, producing a large set of user profiles. We then compute the similarity between pairs of users based on four qualitatively different profile properties: similarity of language used in posts, similarity of hashtags used (which requires extraction of content from them), similarity of images displayed (which requires extraction of what each image is 'about'), and the explicit connections when one user follows another. These single modality similarities are converted into graphs. These graphs have a common node set (the users) but different sets a weighted edges. These graphs are then connected into a single larger graph by connecting the multiple nodes representing the same user by a clique, with edge weights derived from a lazy random walk view of the single graphs. This larger graph can then be embedded in a geometry using spectral techniques. In the embedding, distance corresponds to dissimilarity so geometric clustering techniques can be used to find communities. The resulting communities are evaluated using the entire range of current techniques, outperforming all of them. Topic modelling is also applied to clusters to show that they genuinely represent users with similar interests. This can form the basis for applications such as online marketing, or key influence selection.

ISBN: 9783031609169

Standard No.: 10.1007/978-3-031-60916-9doiSubjects--Topical Terms:

598894
Social networks
--Mathematical models.

LC Class. No.: HM741

Dewey Class. No.: 302.3

Finding communities in social networks using graph embeddings
LDR:03332nmm a2200337 a 4500 001 2372170
003 DE-He213
005 20240629125235.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031609169 $q (electronic bk.)
020 $a 9783031609152 $q (paper)
024 7 $a 10.1007/978-3-031-60916-9 $2 doi
035 $a 978-3-031-60916-9
040 $a GP $c GP
041 0 $a eng
050 4 $a HM741
072 7 $a UF $2 bicssc
072 7 $a COM005000 $2 bisacsh
072 7 $a UXJ $2 thema
082 0 4 $a 302.3 $2 23
090 $a HM741 $b .A385 2024
100 1 $a Alfaqeeh, Mosab. $3 3718705
245 1 0 $a Finding communities in social networks using graph embeddings $h [electronic resource] / $c by Mosab Alfaqeeh, David B. Skillicorn.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a ix, 177 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in social networks, $x 2190-5436
505 0 $a Chapter 1: Introduction -- Chapter 2: Background -- Chapter 3: Building blocks -- Chapter 4: Social network data -- Chapter 5: Methodology -- Chapter 6: Results and validation -- Chapter 7: Conclusions.
520 $a Community detection in social networks is an important but challenging problem. This book develops a new technique for finding communities that uses both structural similarity and attribute similarity simultaneously, weighting them in a principled way. The results outperform existing techniques across a wide range of measures, and so advance the state of the art in community detection. Many existing community detection techniques base similarity on either the structural connections among social-network users, or on the overlap among the attributes of each user. Either way loses useful information. There have been some attempts to use both structure and attribute similarity but success has been limited. We first build a large real-world dataset by crawling Instagram, producing a large set of user profiles. We then compute the similarity between pairs of users based on four qualitatively different profile properties: similarity of language used in posts, similarity of hashtags used (which requires extraction of content from them), similarity of images displayed (which requires extraction of what each image is 'about'), and the explicit connections when one user follows another. These single modality similarities are converted into graphs. These graphs have a common node set (the users) but different sets a weighted edges. These graphs are then connected into a single larger graph by connecting the multiple nodes representing the same user by a clique, with edge weights derived from a lazy random walk view of the single graphs. This larger graph can then be embedded in a geometry using spectral techniques. In the embedding, distance corresponds to dissimilarity so geometric clustering techniques can be used to find communities. The resulting communities are evaluated using the entire range of current techniques, outperforming all of them. Topic modelling is also applied to clusters to show that they genuinely represent users with similar interests. This can form the basis for applications such as online marketing, or key influence selection.
650 0 $a Social networks $x Mathematical models. $3 598894
650 0 $a Communities $x Mathematical models. $3 630899
650 1 4 $a Computer Application in Social and Behavioral Sciences. $3 3538516
650 2 4 $a Machine Learning. $3 3382522
650 2 4 $a Computer and Information Systems Applications. $3 3538505
700 1 $a Skillicorn, David B. $3 1602525
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in social networks. $3 2058983
856 4 0 $u https://doi.org/10.1007/978-3-031-60916-9
950 $a Computer Science (SpringerNature-11645)