2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)最新文献

筛选
英文 中文
Alike people, alike interests? A large-scale study on interest similarity in social networks 相似的人,相同的兴趣?社交网络中兴趣相似性的大规模研究
Xiao Han, Leye Wang, Soochang Park, Ángel Cuevas, N. Crespi
{"title":"Alike people, alike interests? A large-scale study on interest similarity in social networks","authors":"Xiao Han, Leye Wang, Soochang Park, Ángel Cuevas, N. Crespi","doi":"10.1109/ASONAM.2014.6921631","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921631","url":null,"abstract":"This paper presents a comprehensive empirical study on the correlations between users' interest similarity and various social features across three interest domains (i.e., movie, music and TV). This study relies on a large dataset, containing 479, 048 users and 5, 263, 351 user-generated interests, captured from Facebook. We identify the social features from three types of the users' information - demographic information (e.g., age, gender, location), social relations (i.e., friendship), and users' interests. The results reveal that the interest similarity follows the homophily principle. Particularly, the results show that two users are more likely to be alike in their interests 1) if they exhibit more similarity in their demographic characteristics (e.g., similar age, same gender, or close to each other geographically), or 2) if they are more intimate in their friendship, or 3) if they present a higher average interest individuality (i.e., a measurement for estimating the personalized characteristics of a user's interests). The empirical observations could be exploited to infer how two users are alike in their interests according to the social features, which could be further harnessed by various practical applications and services, such as recommendation system and advertisement service.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
Dynamic feedback mechanism for maximizing interaction in online social network services 在线社交网络服务互动最大化的动态反馈机制
Kyudong Park, Seungjae Oh, Heung-Chang Lee, H. So
{"title":"Dynamic feedback mechanism for maximizing interaction in online social network services","authors":"Kyudong Park, Seungjae Oh, Heung-Chang Lee, H. So","doi":"10.1109/ASONAM.2014.6921684","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921684","url":null,"abstract":"Online social network services have embedded social rating systems that users can evaluate and share the quality of content such as the “Like” button for Facebook. This rating system is an important mechanism in social interaction since the system can affect the degree of user connection and the spread of information sharing. Most of such social rating systems, however, are based on the fixed feedback mechanism, where users cannot communicate their emotion and evaluation toward certain content in a real-time manner. In this research, we propose a novel feedback method that dynamically updates rating scores in social network services to give users immediate feedback. To confirm the usefulness of dynamic feedback mechanism compared to the current static feedback mechanism, we conducted an exploratory experiment with 46 participants in a simulated Facebook situation. Since types of content matter for the nature and degree of social interaction, we assumed that the dynamic feedback mechanism might yield different effects to different types of content. Hence, in the experiment, we included three different types of content, namely a) user-generated content, b) news article, and c) commercial advertisement, to examine the interaction effect between feedback mechanism and content types. The dependent variable was the number of “Like” clicks. The results indicate that the dynamic feedback type received significantly higher “Like” clicks than the fixed feedback type. Further, there was a significant interaction effect between feedback types and content types. The dynamic feedback mechanism was the most effective for the user-generated content type.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127913176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Empirical study on overlapping community detection in question and answer sites 问答网站重叠社区检测的实证研究
Zide Meng, Fabien L. Gandon, C. Faron-Zucker, Ge Song
{"title":"Empirical study on overlapping community detection in question and answer sites","authors":"Zide Meng, Fabien L. Gandon, C. Faron-Zucker, Ge Song","doi":"10.1109/ASONAM.2014.6921608","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921608","url":null,"abstract":"In many social networks, people interact based on their interests. Community detection algorithms are then useful to reveal the sub-structures of a network and help us find interest groups. Identifying these social communities can bring benefit to understanding and predicting users behaviors. However, for some kind of online community sites such as question-and-answer (Q&A) sites or forums, there is no friendship based social network structure, which means people are not aware who they are in contact with. Therefore, many traditional community detection techniques do not apply directly. In this paper, we propose an empirical approach for extracting data from Q&A sites suitable to apply community detection methods. Then we compare three kinds of community detection methods we applied on a dataset extracted from the popular Q&A site StackOverflow. We analyze and comment the results of each method.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128181848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Are communities as strong as we think? 社区真的像我们想象的那么强大吗?
M. A. Alim, Alan Kuhnle, M. Thai
{"title":"Are communities as strong as we think?","authors":"M. A. Alim, Alan Kuhnle, M. Thai","doi":"10.1109/ASONAM.2014.6921603","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921603","url":null,"abstract":"Many complex systems, from World Wide Web and online social networks to mobile networks, exhibit community structure in which nodes can be grouped into densely interconnected communities. This special structure has been exploited extensively to design better solutions for many operations and applications such as routing in wireless networks, worm containment and interest prediction in social networks. The outcome of these solutions are sensitive to the network structures, which raises an important question: can communities be broken easily in a network? To answer this question, we introduce a density-based problem formulation for analyzing the vulnerability of communities. Our approach includes the NP-completeness and a O(log k) approximation algorithm for solving the problem where k is the number of communities to be broken. Additionally, we analyze the vulnerability of communities in the context of arbitrary community detection algorithms. The empirical results show that communities are vulnerable to edge removal and in some cases the removal of a small fraction of edges can break the community structure.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124315569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Estimating the size of hidden data sources by queries 通过查询估计隐藏数据源的大小
Yan Wang, Jie Liang, Jianguo Lu
{"title":"Estimating the size of hidden data sources by queries","authors":"Yan Wang, Jie Liang, Jianguo Lu","doi":"10.1109/ASONAM.2014.6921664","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921664","url":null,"abstract":"The sizes of hidden data sources are of great interests to public, researchers and even business competitors. Estimating the size of hidden data sources has been a challenging problem. Most existing methods are derived from the classic capture-recapture methods. Another approach is based on a large query pool. This method is not accurate due to the large variance of the document frequencies of queries in the query pool. Targeting this problem, we propose a new method to reduce the variance by constructing a query pool from a sample of the target data source so that document frequency variance is reduced, yet most of the documents can be covered. Our method is tested on a variety of large textual corpora, and outperforms the baseline random query method and the Broder et al's estimation method on all the datasets.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114716179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Research and implementation of algorithm for short videos recommendation 短视频推荐算法的研究与实现
Lai Jiang, Xiangling Fu
{"title":"Research and implementation of algorithm for short videos recommendation","authors":"Lai Jiang, Xiangling Fu","doi":"10.1109/ASONAM.2014.6921677","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921677","url":null,"abstract":"As the approaching of the UGC era, numerous short videos flood into the Internet every day, but at the present stage, it costs much resources and takes a lot of time to calculate the recommended videos. It is inevitable to search for a feasible recommended algorithm. In this paper, this issue has been studied based on distributed computing, innovatively combining the optimization of user tag cloud model. And then we has proposed practical schemes. Experimental results show that the proposed scheme is feasible but also efficient.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114994175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Start-up firms' networks for innovation: Embedded in entrepreneurs' networks in private and public spheres 创业公司的创新网络:嵌入在私人和公共领域的企业家网络中
K. W. Jensen, T. Schøtt
{"title":"Start-up firms' networks for innovation: Embedded in entrepreneurs' networks in private and public spheres","authors":"K. W. Jensen, T. Schøtt","doi":"10.1109/ASONAM.2014.6921560","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921560","url":null,"abstract":"We develop a model of how a start-up firm's networking for innovation is embedded in the personal network around the entrepreneur. Using data from the Global Entrepreneurships Monitor including 11,792 start-ups from 38 countries surveyed in 2012-13, we examine how entrepreneurs' networking in private and public spheres is impacting (1) innovation (2) firms' collaborative networking, and (3) the effectiveness of firms' collaborative networking for innovation. The analyses show that entrepreneurs' networking in the public sphere has a direct positive impact on start-ups' innovation, while networking in the private sphere reduces innovation. Firms' networking for innovation intensifies with larger public sphere networks around the entrepreneurs but decreases with larger private sphere networking. Also, large private sphere networks around the entrepreneurs decrease effectiveness of networking for innovation. These findings refine our knowledge of the functioning of start-up firms' networking for innovation, especially the positive and negative imprints of the entrepreneurs' networking in the public and private spheres.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117017607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Geographic focus detection using multiple location taggers 使用多个位置标记器进行地理焦点检测
Philipp Berger, Patrick Hennig, Dustin Glaeser, Hauke Klement, C. Meinel
{"title":"Geographic focus detection using multiple location taggers","authors":"Philipp Berger, Patrick Hennig, Dustin Glaeser, Hauke Klement, C. Meinel","doi":"10.1109/ASONAM.2014.6921618","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921618","url":null,"abstract":"Being able to identify locations associated to a Web resource is essential for providing location-based Web applications. However, geographical information in Web documents is rarely supplied in a machine-readable way and therefore not easily discoverable. As a consequence, it is necessary to extract geographical keywords from Web documents and to associate locations with them. This method is called location tagging. In this paper we present a location tagging approach for unstructured documents which utilizes multiple external location providers. Detected locations are ranked according to their relevance for the document, in order to identify a document's geographical focus, which is its most representative location. We present an exemplary implementation of our proposed approach using two location providers and evaluate our method's applicability.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122079046","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Do neighbor buddies make a difference in reblog likelihood? An analysis on SINA Weibo data 邻居朋友对博客的转载可能性有影响吗?新浪微博数据分析
Lumin Zhang, J. Pei, Yan Jia, Bin Zhou, Xiang Wang
{"title":"Do neighbor buddies make a difference in reblog likelihood? An analysis on SINA Weibo data","authors":"Lumin Zhang, J. Pei, Yan Jia, Bin Zhou, Xiang Wang","doi":"10.1109/ASONAM.2014.6921585","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921585","url":null,"abstract":"Reblogging, also known as retweeting in Twitter parlance, is a major type of activities in many online social networks. Although there are many studies on reblogging behaviors and potential applications, whether neighbors who are well connected with each other (called “buddies” in our study) may make a difference in reblog likelihood has not been examined systematically. In this paper, we tackle the problem by conducting a systematic statistical study on a large SINA Weibo data set, which is a sample of 135, 859 users, 10, 129, 028 followers, and 2, 296, 290, 930 reblog messages in total. To the best of our knowledge, this data set has more reblog messages than any data sets reported in literature. We examine a series of hypotheses about how essential neighborhood structures may help to boost the likelihood of reblogging, including buddy neighbors versus buddyless neighbors, traffic between buddy neighbors, activeness (i.e., the total number of blog messages a user sends), and the number of buddy triangles a user participates in. Our empirical study discloses several interesting phenomena that are not reported in literature, which may imply interesting and valuable new applications.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123992785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Competition between real-life friends and virtual-life friends 现实朋友和虚拟朋友之间的竞争
Bin Fang, Q. Ye
{"title":"Competition between real-life friends and virtual-life friends","authors":"Bin Fang, Q. Ye","doi":"10.1109/ASONAM.2014.6921673","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921673","url":null,"abstract":"With the rapid growth of social gaming market, it is of importance to investigate how to encourage players to contribute more economic value to the company. We analyzed a social gaming dataset from one of the social media leaders in China. The result suggests social influence from players' friends is one factor derive players to spend money. Also, it suggests social influence generated by friends known only in the game is statistically stronger than by friends known also in the real world.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129996619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信