{"title":"异构社会网络的中心性分析、基于角色的聚类和自我中心抽象","authors":"Cheng-te Li, Shou-de Lin","doi":"10.1109/SocialCom-PASSAT.2012.59","DOIUrl":null,"url":null,"abstract":"The social network is a powerful data structure allowing the depiction of relationship information between entities. Recent researchers have proposed many successful methods on analyzing homogeneous social networks assuming only a single type of node and relation. Nevertheless, real-world complex networks are usually heterogeneous, which presumes a network can be composed of different types of nodes and relations. In this paper, we propose an unsupervised tensor-based mechanism considering higher-order relational information to model the complex semantics of a heterogeneous social network. Based on the model we present solutions to three critical issues in heterogeneous networks. The first concerns identifying central nodes in the heterogeneous network. Second, we propose a role-based clustering method to identify nodes which play similar roles in the network. Finally, we propose an egocentric abstraction mechanism to facilitate further explorations in a complex social network. The evaluations are conducted on a real-world movie dataset and an artificial crime dataset with promising results.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Centrality Analysis, Role-Based Clustering, and Egocentric Abstraction for Heterogeneous Social Networks\",\"authors\":\"Cheng-te Li, Shou-de Lin\",\"doi\":\"10.1109/SocialCom-PASSAT.2012.59\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The social network is a powerful data structure allowing the depiction of relationship information between entities. Recent researchers have proposed many successful methods on analyzing homogeneous social networks assuming only a single type of node and relation. Nevertheless, real-world complex networks are usually heterogeneous, which presumes a network can be composed of different types of nodes and relations. In this paper, we propose an unsupervised tensor-based mechanism considering higher-order relational information to model the complex semantics of a heterogeneous social network. Based on the model we present solutions to three critical issues in heterogeneous networks. The first concerns identifying central nodes in the heterogeneous network. Second, we propose a role-based clustering method to identify nodes which play similar roles in the network. Finally, we propose an egocentric abstraction mechanism to facilitate further explorations in a complex social network. The evaluations are conducted on a real-world movie dataset and an artificial crime dataset with promising results.\",\"PeriodicalId\":129526,\"journal\":{\"name\":\"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SocialCom-PASSAT.2012.59\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SocialCom-PASSAT.2012.59","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Centrality Analysis, Role-Based Clustering, and Egocentric Abstraction for Heterogeneous Social Networks
The social network is a powerful data structure allowing the depiction of relationship information between entities. Recent researchers have proposed many successful methods on analyzing homogeneous social networks assuming only a single type of node and relation. Nevertheless, real-world complex networks are usually heterogeneous, which presumes a network can be composed of different types of nodes and relations. In this paper, we propose an unsupervised tensor-based mechanism considering higher-order relational information to model the complex semantics of a heterogeneous social network. Based on the model we present solutions to three critical issues in heterogeneous networks. The first concerns identifying central nodes in the heterogeneous network. Second, we propose a role-based clustering method to identify nodes which play similar roles in the network. Finally, we propose an egocentric abstraction mechanism to facilitate further explorations in a complex social network. The evaluations are conducted on a real-world movie dataset and an artificial crime dataset with promising results.