Moohong Min, Donjung Choi, Jaekwang Kim, Jee-Hyong Lee
{"title":"个人社交网络中亲密朋友的识别","authors":"Moohong Min, Donjung Choi, Jaekwang Kim, Jee-Hyong Lee","doi":"10.1109/CASON.2011.6085950","DOIUrl":null,"url":null,"abstract":"Nowadays, social network services, such as Twitter and Facebook, are widely being exploited. Many people have participated in social network services to enjoy the communication with their friends and to extend personal social networks. Since it is easy to extend their relations to others, people usually have a large acquaintance list in social network services. In the lists, various users, not only friends but also unfamiliar users such as celebrities, news media, or even unknown users, can be included. Because of large acquaintance lists, it is usually hard to hear from intimate users because of heavy posting from unfamiliar users. So, social network services need to identify intimate friends of users for better services. We propose a new method to identify intimate users in the acquaintance list. This method ranks people in the list based on the amount of communication and common acquaintances. We combine those with weighted parameters, which are experimentally found. It is found that users had a higher satisfaction with our method through experimentations.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The identification of intimate friends in personal social network\",\"authors\":\"Moohong Min, Donjung Choi, Jaekwang Kim, Jee-Hyong Lee\",\"doi\":\"10.1109/CASON.2011.6085950\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, social network services, such as Twitter and Facebook, are widely being exploited. Many people have participated in social network services to enjoy the communication with their friends and to extend personal social networks. Since it is easy to extend their relations to others, people usually have a large acquaintance list in social network services. In the lists, various users, not only friends but also unfamiliar users such as celebrities, news media, or even unknown users, can be included. Because of large acquaintance lists, it is usually hard to hear from intimate users because of heavy posting from unfamiliar users. So, social network services need to identify intimate friends of users for better services. We propose a new method to identify intimate users in the acquaintance list. This method ranks people in the list based on the amount of communication and common acquaintances. We combine those with weighted parameters, which are experimentally found. It is found that users had a higher satisfaction with our method through experimentations.\",\"PeriodicalId\":342597,\"journal\":{\"name\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Aspects of Social Networks (CASoN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASON.2011.6085950\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASON.2011.6085950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The identification of intimate friends in personal social network
Nowadays, social network services, such as Twitter and Facebook, are widely being exploited. Many people have participated in social network services to enjoy the communication with their friends and to extend personal social networks. Since it is easy to extend their relations to others, people usually have a large acquaintance list in social network services. In the lists, various users, not only friends but also unfamiliar users such as celebrities, news media, or even unknown users, can be included. Because of large acquaintance lists, it is usually hard to hear from intimate users because of heavy posting from unfamiliar users. So, social network services need to identify intimate friends of users for better services. We propose a new method to identify intimate users in the acquaintance list. This method ranks people in the list based on the amount of communication and common acquaintances. We combine those with weighted parameters, which are experimentally found. It is found that users had a higher satisfaction with our method through experimentations.