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

筛选
英文 中文
Flexible Compression of Big Data 灵活压缩大数据
C. Leung, Fan Jiang, Yibin Zhang
{"title":"Flexible Compression of Big Data","authors":"C. Leung, Fan Jiang, Yibin Zhang","doi":"10.1145/3341161.3343512","DOIUrl":"https://doi.org/10.1145/3341161.3343512","url":null,"abstract":"High volumes of valuable data and information can be easily collected in the current era of big data. As rich and constant sources of big data, an incredible amount of people from different social stratum take part in social networks. Hence, social networks are desired for many research topics. In social networks, users (or social entities) are often linked by some ‘following’ relationships. As the social networks growing, some famous users account (or social entities) might be followed by a large number of same other users. In this situation, we call those famous users as frequently followed groups, which some researchers (or businesses) may be interested in them for investigating. However, the discovery of those frequently followed groups might be difficult and challenging because the following data in social networks are usually very big but sparse (huge number of users lead to big ‘following’ data, but each user is likely only following a small number of other users). As a result, in this paper, we present a new compression model, which can be used during mining these very big but sparse social networks for discovering the frequently followed groups of users/social entities.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134383132","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}
引用次数: 5
Dynamic Consensus Community Detection and Combinatorial Multi-Armed Bandit 动态共识社区检测与组合多臂强盗
Domenico Mandaglio, Andrea Tagarelli
{"title":"Dynamic Consensus Community Detection and Combinatorial Multi-Armed Bandit","authors":"Domenico Mandaglio, Andrea Tagarelli","doi":"10.1145/3341161.3342910","DOIUrl":"https://doi.org/10.1145/3341161.3342910","url":null,"abstract":"Community detection and evolution has been largely studied in the last few years, especially for network systems that are inherently dynamic and undergo different types of changes in their structure and organization in communities. Because of the inherent uncertainty and dynamicity in such network systems, we argue that temporal community detection problems can profitably be solved under a particular class of multi-armed bandit problems, namely combinatorial multi-armed bandit (CMAB). More specifically, we propose a CMAB-based methodology for the novel problem of dynamic consensus community detection, i.e., to compute a single community structure that is designed to encompass the whole information available in the sequence of observed temporal snapshots of a network in order to be representative of the knowledge available from community structures at the different time steps. Unlike existing approaches, our key idea is to produce a dynamic consensus solution for a temporal network to have unique capability of embedding both long-term changes in the community formation and newly observed community structures.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132364331","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}
引用次数: 3
A Model Based on Random Walk with Restart to Predict CircRNA - Disease Associations on Heterogeneous Network 基于随机行走与重启的异质网络CircRNA -疾病关联预测模型
H. Vural, Mehmet Kaya, R. Alhajj
{"title":"A Model Based on Random Walk with Restart to Predict CircRNA - Disease Associations on Heterogeneous Network","authors":"H. Vural, Mehmet Kaya, R. Alhajj","doi":"10.1145/3341161.3343514","DOIUrl":"https://doi.org/10.1145/3341161.3343514","url":null,"abstract":"Recent studies show that circRNAs have critical roles in many biological processes. Knowing the associations between circRNAs and diseases may contribute to the understanding of the mechanism of circRNAs and to the diagnostic and therapeutic methods of diseases at the molecular level. A small number of computation models have been developed to estimate CircRNA-disease associations. Therefore, in this study, a computational model has been developed. Similarity matrices have been obtained for circRNA and disease respectively by applying gaussian on the data obtained from the circRNADisease database. Then, random walk with restart algorithm applied on the combined matrices. The AUC value was obtained by 5-fold cross validation is 0.861 and this demonstrates the reliability of the model.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114830992","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}
引用次数: 9
Impact of Social Influence on Adoption Behavior: An Online Controlled Experimental Evaluation 社会影响对收养行为的影响:一项在线控制实验评估
Soumajyoti Sarkar, Ashkan Aleali, P. Shakarian, Mika Armenta, Danielle Sanchez, K. Lakkaraju
{"title":"Impact of Social Influence on Adoption Behavior: An Online Controlled Experimental Evaluation","authors":"Soumajyoti Sarkar, Ashkan Aleali, P. Shakarian, Mika Armenta, Danielle Sanchez, K. Lakkaraju","doi":"10.1145/3341161.3342882","DOIUrl":"https://doi.org/10.1145/3341161.3342882","url":null,"abstract":"It is widely believed that the adoption behavior of a decision-maker in a social network is related to the number of signals it receives from its peers in the social network. It is unclear if these same principles hold when the “pattern” by which they receive these signals vary and when potential decisions have different utilities. To investigate that, we manipulate social signal exposure in an online controlled experiment with human participants. Specifically, we change the number of signals and the pattern through which participants receive them over time. We analyze its effect through a controlled game where each participant makes a decision to select one option when presented with six choices with differing utilities, with one choice having the most utility. We avoided network effects by holding the neighborhood network of the users constant. Over multiple rounds of the game, we observe the following: (1) even in the presence of monetary risks and previously acquired knowledge of the six choices, decision-makers tend to deviate from the obvious optimal decision when their peers make similar choices, (2) when the quantity of social signals vary over time, the probability that a participant selects the decision similar to the one reflected by the social signals and therefore being responsive to social influence does not necessarily correlate proportionally to the absolute quantity of signals and (3) an early subjugation to higher quantity of peer social signals turned out to be a more effective strategy of social influence when aggregated over the rounds.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395076","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}
引用次数: 3
A Postmortem of Suspended Twitter Accounts in the 2016 U.S. Presidential Election 2016年美国总统大选中被暂停的推特账户的事后分析
Huyen T. Le, G. Boynton, Zubair Shafiq, P. Srinivasan
{"title":"A Postmortem of Suspended Twitter Accounts in the 2016 U.S. Presidential Election","authors":"Huyen T. Le, G. Boynton, Zubair Shafiq, P. Srinivasan","doi":"10.1145/3341161.3342878","DOIUrl":"https://doi.org/10.1145/3341161.3342878","url":null,"abstract":"Social media sites such as Twitter have faced significant pressure to mitigate spam and abuse on their platform in the aftermath of congressional investigations into Russian interference in the 2016 U.S. presidential election. Twitter publicly acknowledged the exploitation of their platform and has since conducted aggressive cleanups to suspend the involved accounts. To shed light on Twitter's countermeasures, we conduct a postmortem analysis of about one million Twitter accounts who engaged in the 2016 U.S. presidential election but were later suspended by Twitter. To systematically analyze coordinated activities of these suspended accounts, we group them into communities based on their retweet/mention network and analyze different characteristics such as popular tweeters, domains, and hashtags. The results show that suspended and regular communities exhibit significant differences in terms of popular tweeter and hashtags. Our qualitative analysis also shows that suspended communities are heterogeneous in terms of their characteristics. We further find that accounts suspended by Twitter's new countermeasures are tightly connected to the original suspended communities.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134030956","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}
引用次数: 15
Dormant Bots in Social Media: Twitter and the 2018 U.S. Senate Election 社交媒体中的休眠机器人:推特和2018年美国参议院选举
Richard Takacs, I. McCulloh
{"title":"Dormant Bots in Social Media: Twitter and the 2018 U.S. Senate Election","authors":"Richard Takacs, I. McCulloh","doi":"10.1145/3341161.3343852","DOIUrl":"https://doi.org/10.1145/3341161.3343852","url":null,"abstract":"Bots are often identified on social media due to their behavior. How easily are they identified, however, when they are dormant and exhibit no measurable behavior at all, except for their silence? We identified “dormant bot networks” positioned to influence social media discourse surrounding the 2018 U.S. senate election. A dormant bot is a social media persona that does not post content yet has large follower and friend relationships with other users. These relationships may be used to manipulate online narratives and elevate or suppress certain discussions in the social media feed of users. Using a simple structure-based approach, we identify a large number of dormant bots created in 2017 that begin following the social media accounts of numerous US government politicians running for re-election in 2018. Findings from this research were used by the U.S. Government to suspend dormant bots prior to the elections to prevent any malign influence campaign. Application of this approach by social media providers may provide a novel method to reduce the risk of content manipulation for online platforms.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133635469","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}
引用次数: 9
Understanding Information Operations using YouTubeTracker 了解信息使用YouTubeTracker的操作
Thomas Marcoux, Nitin Agarwal, A. Obadimu, Muhammad Nihal Hussain, K. Galeano, Samer Al-khateeb
{"title":"Understanding Information Operations using YouTubeTracker","authors":"Thomas Marcoux, Nitin Agarwal, A. Obadimu, Muhammad Nihal Hussain, K. Galeano, Samer Al-khateeb","doi":"10.1145/3341161.3343704","DOIUrl":"https://doi.org/10.1145/3341161.3343704","url":null,"abstract":"YouTube is the second most popular website in the world. Over 300 hours worth of videos are uploaded every minute and 5 billion videos are watched every day - almost one video per person worldwide. Because videos can deliver a complex message in a way that captures the audience's attention more effectively than text-based platforms, it has become one of the most relevant platforms in the age of digital mass communication. This makes the analysis of YouTube content and user behavior invaluable not only to information scientists but also communication researchers, journalists, sociologists, and many more. There exists a number of YouTube analysis tools but none of them provide an in-depth qualitative and quantitative insights into user behavior or networks. Towards that direction, we introduce YouTubeTracker - a tool designed to gather YouTube data and gain insights on content and users. This tool can help identify leading actors, networks and spheres of influence, emerging popular trends, as well as user opinion. This analysis can also be used to understand user engagement and social networks. This can help reveal suspicious and inorganic behaviors (e.g., trolling, botting) causing algorithmic manipulations.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132441127","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}
引用次数: 4
Becoming Gatekeepers Together with Allies: Collaborative Brokerage over Social Networks 与盟友一起成为看门人:社交网络上的协作经纪
Yang Chen, Jiamou Liu
{"title":"Becoming Gatekeepers Together with Allies: Collaborative Brokerage over Social Networks","authors":"Yang Chen, Jiamou Liu","doi":"10.1145/3341161.3342874","DOIUrl":"https://doi.org/10.1145/3341161.3342874","url":null,"abstract":"Information brokers control information flow and hold dominating positions in a social network. We study how a team of individuals with heterogeneous influencing power may gain such advantageous position through establishing new links. In particular, a collaborative brokerage problem aims to find the smallest set of nodes for a team of individuals with different influencing power to cover the entire network. We phrase this problem as an extension to the classical graph domination problem and thus this problem is NP-hard. We show that a polynomial-time solution exists for directed trees. We then develop efficient algorithms over arbitrary directed networks. To evaluate the algorithms, we run experiments over networks generated using well-known random graph models and real-world datasets. Experimental results show that our algorithms produce relatively good solutions with faster speed.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"5 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132589507","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
Epidemic Threshold and Lifetime Distribution for Information Diffusion on Simultaneously Growing Networks 同步增长网络上信息扩散的流行阈值和寿命分布
Emily M. Fischer, Souvik Ghosh, G. Samorodnitsky
{"title":"Epidemic Threshold and Lifetime Distribution for Information Diffusion on Simultaneously Growing Networks","authors":"Emily M. Fischer, Souvik Ghosh, G. Samorodnitsky","doi":"10.1145/3341161.3342891","DOIUrl":"https://doi.org/10.1145/3341161.3342891","url":null,"abstract":"We study information diffusion modeled by epidemic models on a class of growing preferential attachment networks. We show through a thorough simulation study that there is a fundamental difference in the nature of the epidemic process on growing temporal networks in comparison to the same process on static networks. The empirical distribution of the epidemic lifetime on growing networks has a considerably heavier, and possibly infinite, tail. Furthermore, the notion of the epidemic threshold has only minor significance in this context, since network growth reduces the critical value of the corresponding static graph.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116131186","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}
引用次数: 3
Reducing Features to Improve Link Prediction Performance in Location Based Social Networks, Non-Monotonically Selected Subset from Feature Clusters 在基于位置的社交网络中减少特征以提高链接预测性能,从特征簇中非单调选择子集
A. Bayrak, Faruk Polat
{"title":"Reducing Features to Improve Link Prediction Performance in Location Based Social Networks, Non-Monotonically Selected Subset from Feature Clusters","authors":"A. Bayrak, Faruk Polat","doi":"10.1145/3341161.3343853","DOIUrl":"https://doi.org/10.1145/3341161.3343853","url":null,"abstract":"In most cases, feature sets available for machine learning algorithms require a feature engineering approach to pick the subset for optimal performance. During our link prediction research, we had observed the same challenge for features of Location Based Social Networks (LBSNs). We applied multiple reduction approaches to avoid performance issues caused by redundancy and relevance interactions between features. One of the approaches was the custom two-step method; starts with clustering features based on the proposed interaction related similarity measurement and ends with non-monotonically selecting optimal feature subset from those clusters. In this study, we applied well-known generic feature reduction algorithms together with our custom method for LBSNs to evaluate novelty and verify the contributions. Results from multiple data groups depict that our custom feature reduction approach makes higher and more stable effectivity optimizations for link prediction when compared with others.","PeriodicalId":403360,"journal":{"name":"2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124778572","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学术文献互助群
群 号:481959085
Book学术官方微信