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

筛选
英文 中文
Hackers Hedging Bets: A Cross-Community Analysis of Three Online Hacking Forums 黑客对冲赌注:三个在线黑客论坛的跨社区分析
Andrew J. Park, Richard Frank, A. Mikhaylov, Myfanwy Thomson
{"title":"Hackers Hedging Bets: A Cross-Community Analysis of Three Online Hacking Forums","authors":"Andrew J. Park, Richard Frank, A. Mikhaylov, Myfanwy Thomson","doi":"10.1109/ASONAM.2018.8508613","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508613","url":null,"abstract":"Online hacking forums have been used as communities where users, possibly cybercriminals, can learn and exchange knowledge, and purchase the necessary tools and information to commit various offences such as hacking, credit card/identity fraud, money laundering, and even cyberattacks on infrastructure. Monitoring these forums and identifying key players are important when investigating emergent threats and developing efficient disruption strategies. Literature shows the lack of studies regarding users' cross-forum activity. This paper presents an analysis of forum users' cross-posting in three hacking forums including user overlap among different hacking communities/forums and identify user roles based on the type of posts and their frequencies. This allows us to assess the impact of users and forums in terms of cybercrime victimization.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122104589","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
Analyzing Social and Communication Network Structures of Social Bots and Humans 分析社会机器人和人类的社会和通信网络结构
Tuja Khaund, Kiran Kumar Bandeli, Muhammad Nihal Hussain, A. Obadimu, Samer Al-khateeb, Nitin Agarwal
{"title":"Analyzing Social and Communication Network Structures of Social Bots and Humans","authors":"Tuja Khaund, Kiran Kumar Bandeli, Muhammad Nihal Hussain, A. Obadimu, Samer Al-khateeb, Nitin Agarwal","doi":"10.1109/ASONAM.2018.8508665","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508665","url":null,"abstract":"Recently, several journalistic accounts have suggested that Twitter is becoming a bellwether for mis- and disinformation due to the pervasiveness of bots. These bots are either automated or semi-automated. Understanding the intent and usage of these bots has piqued the scientific curiosity among researchers. To that effect, in this study, we analyze the role of bots in two distinct categories of real-world events, i.e., natural disasters and sports. We collected over 1.2 million tweets that were generated by nearly 800,000 users for Hurricane Harvey, Hurricane Irma, Hurricane Maria, and Mexico Earthquake. We corroborate our analysis by examining bots that engaged with the 2018 Winter Olympics. We collected over 1.4 million tweets generated by nearly 700,000 users based on the hashtags #Olympics2018 and #PyeongChang2018. We examined the social and communication network of bots and humans for the aforementioned events. Our results show distinctive patterns in the network structures of bots when compared with that of humans. Content analysis of the tweets further revealed that bots used hashtags more uniformly than humans, across all the events.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125752872","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
ALGeoSPF: A Hierarchical Factorization Model for POI Recommendation 基于层次分解的POI推荐模型
Jean-Benoît Griesner, T. Abdessalem, Hubert Naacke, Pierre Dosne
{"title":"ALGeoSPF: A Hierarchical Factorization Model for POI Recommendation","authors":"Jean-Benoît Griesner, T. Abdessalem, Hubert Naacke, Pierre Dosne","doi":"10.1109/ASONAM.2018.8508249","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508249","url":null,"abstract":"The task of points-of-interest (POI) recommendations has become an essential feature in location-based social networks (LBSNs) with the significant growth of shared data on LBSNs. However it remains a challenging problem, because the decision process of a user choosing to visit a POI depends on numerous factors. The high level of sparsity of the data in LBSNs makes the POI recommendation problem even more challenging, especially for large geographical areas and worldwide datasets. Moreover, in this context the mobility behavior of the users is very heterogeneous, ranging from urban to worldwide mobility. In this paper, we explore the impact of spatial clustering on the recommendation quality. The proposed approach combines spatial clustering with users' influences. It is based on a Poisson factorization model built on an implicit social network, inferred from the geographical mobility patterns. We conduct a comprehensive performance evaluation of our approach on the YFCC dataset (a very large-scale real-world dataset). The experiments show that our approach achieves a significantly superior recommendation quality compared to other state-of-the-art recommendation techniques.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125010769","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
Measuring the Information-Foraging Behaviors of Social Bots Through Word Usage 通过词汇使用来衡量社交机器人的信息采集行为
Zachary Kimo Stine, Tuja Khaund, Nitin Agarwal
{"title":"Measuring the Information-Foraging Behaviors of Social Bots Through Word Usage","authors":"Zachary Kimo Stine, Tuja Khaund, Nitin Agarwal","doi":"10.1109/ASONAM.2018.8508811","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508811","url":null,"abstract":"Automated social bots are reported to account for a large sum of activity on social media sites such as Twitter. In this short paper, we study the information-foraging behaviors of social media users including bots. We present here a preliminary investigation which compares the behaviors of a set of suspected bots with non-automated accounts. To do so, we measure the distance between word distributions on a daily basis. We posit that this methodology provides a quantitative measure of behavior, which allows for more rigorous descriptions of bot behaviors that move beyond the assumption of bots as a monolithic category.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126164160","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
AI Robo-Advisor with Big Data Analytics for Financial Services 金融服务大数据分析AI机器人顾问
Min-Yuh Day, Tun-Kung Cheng, Jheng-Gang Li
{"title":"AI Robo-Advisor with Big Data Analytics for Financial Services","authors":"Min-Yuh Day, Tun-Kung Cheng, Jheng-Gang Li","doi":"10.1109/ASONAM.2018.8508854","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508854","url":null,"abstract":"Robo-Advisors has been growing attraction from the financial industry for offering financial services by using algorithms and acting as like human advisors to support investors making investment decisions. During the investment planning stage, portfolio optimization plays a crucial role, especially for the medium and long-term investors, in determining the allocation weight of assets to achieve the balance between investors expectation return and risk tolerance. The literature on the topic of portfolio optimization has been offering plenty of theoretical and practical guidance for implementing the theory; however, there is a paucity of studies focusing on the applications which are designed for Robo-Advisors. In this research, we proposed a modular system and focused on integrating big data analysis, deep learning method and the Black-Litterman model to generate asset allocation weight. We developed a portfolio optimization module which takes the information from a variety of sources, such as stocks prices, investor profile and the other alternative data, and used them as input to calculate optimal weights of assets in the portfolio. The module we developed could be used as a sub-system for Robe-Advisors, which offers a customized optimal portfolio based on investors preference.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129166872","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}
引用次数: 13
Individual-Level Social Capital in Weighted and Attributed Social Networks 加权和归因社会网络中的个人层面社会资本
Rajesh Sharma, Kevin McAreavey, Jun Hong, Faisal Ghaffar
{"title":"Individual-Level Social Capital in Weighted and Attributed Social Networks","authors":"Rajesh Sharma, Kevin McAreavey, Jun Hong, Faisal Ghaffar","doi":"10.1109/ASONAM.2018.8508302","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508302","url":null,"abstract":"There is no agreed definition of social capital in the literature. However, one interpretation is that it refers to those resources embedded in an individual's social network offering benefits to that individual in relation to achieving goals and facilitating actions. This can be viewed as a resource-based interpretation of social capital aimed at the level of individuals. In this paper, we propose a family of social capital measures in line with this interpretation. Our measures are designed for a model of social networks based on weighted and attributed graphs, and cover four dimensions of social capital: (i) access to resources, (ii) access to superiors, (iii) homogeneity of ties, and (iv) heterogeneity of ties. We demonstrate the real-world application of our measures by exploring an illustrative use case in the form of a workplace social network.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126283730","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
Interactive Kernel Dimension Alternative Clustering on GPUs gpu上的交互式内核维度可选聚类
Xiangyu Li, Chieh Wu, Shi Dong, Jennifer G. Dy, D. Kaeli
{"title":"Interactive Kernel Dimension Alternative Clustering on GPUs","authors":"Xiangyu Li, Chieh Wu, Shi Dong, Jennifer G. Dy, D. Kaeli","doi":"10.1109/ASONAM.2018.8508264","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508264","url":null,"abstract":"Machine learning has seen tremendous growth in recent years thanks to two key advances in technology: massive data generation and highly-parallel accelerator architectures. The rate that data is being generated is exploding across multiple domains, including medical research, environmental science, web-search, and e-commerce. Many of these advances have benefited from emergent web-based applications, and improvements in data storage and sensing technologies. Innovations in parallel accelerator hardware, such as GPUs, has made it possible to process massive amounts of data in a timely fashion. Given these advanced data acquisition technology and hardware, machine learning researchers are equipped to generate and sift through much larger and complex datasets quickly. In this work, we focus on accelerating Kernel Dimension Alternative Clustering algorithms using GPUs. We conduct a thorough performance analysis by using both synthetic and real-world datasets, while also modifying both the structure of the data, and the size of the datasets. Our GPU implementation reduces execution time from minutes to seconds, which enables us to develop a web-based application for users to, interactively, view alternative clustering solutions.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126435630","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
End-to-End Compromised Account Detection 端到端入侵账户检测
Hamid Karimi, Courtland VanDam, L. Ye, Jiliang Tang
{"title":"End-to-End Compromised Account Detection","authors":"Hamid Karimi, Courtland VanDam, L. Ye, Jiliang Tang","doi":"10.1109/ASONAM.2018.8508296","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508296","url":null,"abstract":"Social media, e.g. Twitter, has become a widely used medium for the exchange of information, but it has also become a valuable tool for hackers to spread misinformation through compromised accounts. Hence, detecting compromised accounts is a necessary step toward a safe and secure social media environment. Nevertheless, detecting compromised accounts faces several challenges. First, social media activities of users are temporally correlated which plays an important role in compromised account detection. Second, data associated with social media accounts is inherently sparse. Finally, social contagions where multiple accounts become compromised, take advantage of the user connectivity to propagate their attack. Thus how to represent each user's network features for compromised account detection is an additional challenge. To address these challenges, we propose an End-to-End Compromised Account Detection framework (E2ECAD). E2ECAD effectively captures temporal correlations via an LSTM (Long Short-Term Memory) network. Further, it addresses the sparsity problem by defining and employing a user context representation. Meanwhile, informative network-related features are modeled efficiently. To verify the working of the framework, we construct a real-world dataset of compromised accounts on Twitter and conduct extensive experiments. The results of experiments show that E2ECAD outperforms the state of the art compromised account detection algorithms.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127652619","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}
引用次数: 23
A Statistical Framework for Handling Network Anomalies 网络异常处理的统计框架
M. Bouguessa, Amani Chouchane
{"title":"A Statistical Framework for Handling Network Anomalies","authors":"M. Bouguessa, Amani Chouchane","doi":"10.1109/ASONAM.2018.8508299","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508299","url":null,"abstract":"This paper proposes a statistical framework to automatically identify anomalous nodes in static networks. In our approach, we first associate to each node a neighborhood cohesiveness feature vector such that each element of this vector corresponds to a score quantifying the node's neighborhood connectivity, as estimated by a specific similarity measure. Next, based on the estimated node's feature vectors, we view the task of identifying anomalous nodes from a mixture modeling perspective, based on which we elaborate a statistical approach that exploits the Dirichlet distribution to automatically identify anomalies. The suitability of the proposed method is illustrated through experiments on both synthesized and real networks.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115172207","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
A Model of Homophily, Common Knowledge and Collective Action Through Facebook 通过Facebook的同质性、共同知识和集体行动模型
Gizem Korkmaz, C. Kuhlman, Joshua Goldstein, F. Vega-Redondo
{"title":"A Model of Homophily, Common Knowledge and Collective Action Through Facebook","authors":"Gizem Korkmaz, C. Kuhlman, Joshua Goldstein, F. Vega-Redondo","doi":"10.1109/ASONAM.2018.8508834","DOIUrl":"https://doi.org/10.1109/ASONAM.2018.8508834","url":null,"abstract":"In this paper, we introduce homophily to a game-theoretic model of collective action (e.g., protests) on Facebook and study the effect of homophily in individuals' willingness to participate in collective action, i.e., their thresholds, on the emergence and spread of collective action. We use a real Facebook network and conduct computational experiments to study contagion dynamics (the size and the speed of diffusion) with respect to the level of homophily.","PeriodicalId":135949,"journal":{"name":"2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122613132","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
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学术官方微信