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

筛选
英文 中文
An Implicit Crowdsourcing Approach to Rumor Identification in Online Social Networks 基于隐式众包方法的在线社交网络谣言识别
Abiola Osho, Caden Waters, G. Amariucai
{"title":"An Implicit Crowdsourcing Approach to Rumor Identification in Online Social Networks","authors":"Abiola Osho, Caden Waters, G. Amariucai","doi":"10.1109/ASONAM49781.2020.9381339","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381339","url":null,"abstract":"With the increasing use of online social networks as a source of news and information, the propensity for a rumor to disseminate widely and quickly poses a great concern, especially in disaster situations where users do not have enough time to fact-check posts before making the informed decision to react to a post that appears to be credible. At the same time, we know that misinformation is easily detectable by a certain few, very skeptical, or very informed users. In this study, we demonstrate how blending artificial intelligence and human skills can create a new paradigm for credibility prediction. The crowdsourcing part of the detection mechanism is implemented implicitly, by simply observing the natural interaction between users encountering the messages. Specifically, we explore the spread of information on Twitter at the microscopic (user-to-user propagation) level and propose a model that predicts if a message is True or False by observing the latent attributes of the message, along with those of the users interacting with it, and their reactions to the message. We demonstrate the application of this model to the detection of misinformation and rank the relevant message and user features that are most critical in influencing the spread of rumor over the network. Our experiments using real-world data show that the proposed model achieves over 90% accuracy in predicting the credibility of posts on Twitter, a significant boost over state-of-the-art models.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121024929","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
High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs 利用图中的时空轨迹对游客流动进行高质量预测
Shima Moghtasedi, Cristina Ioana Muntean, F. M. Nardini, R. Grossi, Andrea Marino
{"title":"High-Quality Prediction of Tourist Movements using Temporal Trajectories in Graphs","authors":"Shima Moghtasedi, Cristina Ioana Muntean, F. M. Nardini, R. Grossi, Andrea Marino","doi":"10.1109/ASONAM49781.2020.9381450","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381450","url":null,"abstract":"In this paper, we study the problem of predicting the next position of a tourist given his history. In particular, we propose a model to identify the next point of interest that a tourist will visit in the future, by making use of similarity between trajectories on a graph and taking into account the spatial-temporal aspect of trajectories. We compare our method with a well-known machine learning-based technique, as well as with a popularity baseline, using three public real-world datasets. Our experimental results show that our technique outperforms state-of-the-art machine learning-based methods effectively, by providing at least twice more accurate results.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127451633","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
Welcome from the ASONAM 2020 Program Chairs 欢迎各位ASONAM 2020项目主席
{"title":"Welcome from the ASONAM 2020 Program Chairs","authors":"","doi":"10.1109/asonam49781.2020.9381350","DOIUrl":"https://doi.org/10.1109/asonam49781.2020.9381350","url":null,"abstract":"","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124980065","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
Database Knowledge Enrichment Utilizing Trending Topics from Twitter 利用Twitter趋势主题丰富数据库知识
C. Vassilakis, Dimitra Maniataki, George Lepouras, Angeliki Antoniou, D. Spiliotopoulos, V. Poulopoulos, Manolis Wallace, Dionisis Margaris
{"title":"Database Knowledge Enrichment Utilizing Trending Topics from Twitter","authors":"C. Vassilakis, Dimitra Maniataki, George Lepouras, Angeliki Antoniou, D. Spiliotopoulos, V. Poulopoulos, Manolis Wallace, Dionisis Margaris","doi":"10.1109/ASONAM49781.2020.9381421","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381421","url":null,"abstract":"Every day, many people use at least one social network (or social media) account. This development has been boosted by the rapid growth of technology, making both smartphones and mobile data much more accessible and inexpensive. Therefore, the number of social networks users is growing rapidly, accounting more than 1 billion active users worldwide. The ease of use, as well as the ability to communicate without spatial and temporal restrictions underpinned the rapid increase of the popularity of social networks, as well as their wide acceptance by the general public. This popularity influences people's opinion on many issues, shapes consumer habits and behaviour, mood, etc. The work of many scientists across multiple disciplines has focused on studying social media from various perspectives, including marketing, journalism and sociology. This paper investigates how trending information from social media can be used to match topics of interest from cultural database indices. Matches identified in this process are then presented to cultural venue curators, who can then review matches, mark them as useful or reject them, and exploit them for various tasks, and most notably for the promotion of the venue and its content. More specifically, we have developed an application, which collects the 10 most popular twitter trends and then matches their content with the contents of a given cultural database. Using the results of this match, items from the database that may be related to current issues may be recommended to the user. As a result, these matches, after being inspected and approved by the administrator, can be used to attract the interest of the target audience, highlighting the correlation of current issues with the database's items.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126861558","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
Semantics Embedded Sequential Recommendation for E-Commerce Products (SEMSRec) 电子商务产品语义嵌入式顺序推荐(SEMSRec)
Mahreen Nasir, C. Ezeife
{"title":"Semantics Embedded Sequential Recommendation for E-Commerce Products (SEMSRec)","authors":"Mahreen Nasir, C. Ezeife","doi":"10.1109/ASONAM49781.2020.9381352","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381352","url":null,"abstract":"In Collaborative Filtering methods, tailored recommendations cannot be obtained when the user-item matrix is sparse (i.e., has low user-item interactions such as item ratings or purchases). Conventional recommendation systems (ChoiRec12, HPCRec18, HSPRec19) utilizing mining techniques such as clustering, frequent and sequential pattern mining along with click and purchase similarity measures for item recommendation cannot perform well when the user-item interactions are less, as the number of items keep increasing rapidly. Additionally, they have not explored the integration of semantic information of products extracted from customers' purchase histories into the item matrix and the pattern mining process. To address this problem, this paper proposes (SEMSRec) which integrates semantic information of E-commerce products extracted from purchase histories into all phases of recommendation process (pre-processing, pattern mining and recommendation). This is achieved by i) learning semantic similarities between items from customers' purchase histories using Prod2vec model, ii) leveraging this information to mine semantically rich sequential purchase patterns and, iii) enriching the item matrix with semantic and sequential product purchase information before applying item based collaborative filtering. Thus, SEMSRec can provide Top-K personalized recommendations based on semantic similarities between items without the need for users' ratings on items. Experimental results on publically available E-commerce data set show that SEMSRec provides more relevant recommendations over other existing methods.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122531291","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
Opening and Closing Dynamics of Competing Shop Groups over Spatial Networks 空间网络中竞争商店群的开放与关闭动态
Takayasu Fushimi, Kazumi Saito, K. Ohara, M. Kimura, H. Motoda
{"title":"Opening and Closing Dynamics of Competing Shop Groups over Spatial Networks","authors":"Takayasu Fushimi, Kazumi Saito, K. Ohara, M. Kimura, H. Motoda","doi":"10.1109/ASONAM49781.2020.9381388","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381388","url":null,"abstract":"We address the problem of opening and closing shops in group competitive environment, i.e., shops in the same group work cooperatively and those in different groups competitively, and analyze how the market share and location changes over time. We formulate a stochastic utility of each shop as a function of shop distance and attractiveness from which a market share is computed by weighting consumers buying power. We further place a constraint on the traveling time, which is crucial to reduce the computation time, and use a marginal gain of the market share as a measure to rank the candidate location. Using the real dataset of three convenience stores in four cities in Japan, we confirm that, despite the simplification we made in the model, rankings of the existing shops are shown to be high which implies that our model is reasonable. Further, comparison with the baseline gravity model shows that our model gives much more realistic results. Analyses of the dynamics of opening and closing shops indicate that the reasonable time-bound for walking is about 10 min., the market share of each group, thus total share, eventually increases although small, and the difference of the share within each group gradually becomes smaller, revealing that the spatial distribution of the shops in each group becomes more uniform.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122059749","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
IEEE/ACM ASONAM 2020 ASONAM 2020 Program Committee
{"title":"IEEE/ACM ASONAM 2020 ASONAM 2020 Program Committee","authors":"","doi":"10.1109/asonam49781.2020.9381376","DOIUrl":"https://doi.org/10.1109/asonam49781.2020.9381376","url":null,"abstract":"","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116677440","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
Network Analysis of Bilateral Trade Data Under Asymmetry 不对称条件下双边贸易数据的网络分析
N. Meshcheryakova
{"title":"Network Analysis of Bilateral Trade Data Under Asymmetry","authors":"N. Meshcheryakova","doi":"10.1109/ASONAM49781.2020.9381408","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381408","url":null,"abstract":"Trade statistics is a vivid example of bilateral data with asymmetry. Exporter and importer report their own versions of a flow between them, that frequently differ in dozens of times. In order to construct a network of trade relations we need to choose only one value for each weighted edge. We propose new methodology that aims to deal with the problem of mirror statistics. Our approach includes outliers detection step, the analysis of National Compilation and Reporting Practices survey and the construction of coherence metric of trade. We apply the proposed approach to real global trade data and compare several network statistics with corresponding statistics of networks that are constructed on export and import data. The key advantage of our methodology is that it does not depend on commodity selection and can be applied to trade networks on various levels.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114685468","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
Ideology Detection in the Indian Mass Media 印度大众传媒中的意识形态侦查
Ankur Sharma, N. Kaur, Anirban Sen, Aaditeshwar Seth
{"title":"Ideology Detection in the Indian Mass Media","authors":"Ankur Sharma, N. Kaur, Anirban Sen, Aaditeshwar Seth","doi":"10.1109/ASONAM49781.2020.9381344","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381344","url":null,"abstract":"Ideological biases in the mass media can shape public opinion. In this study, we aim to understand ideological bias in the Indian mass media, in terms of the coverage it provides to statements made by prominent people on key economic and technology policies. We build an end-to-end system that starts with a news article and parses it to obtain statements made by people in the article; on these statements, we apply a Recursive Neural Network based model to detect whether the statements express an ideological bias or not. The system then classifies the stance of the non-neutral statements. For economic policies, we determine if the statements express a pro or anti slant about the policy, and for technology policies, we determine if the statements are positive or skeptical about technology. The proposed research method can be applied to other domains as well and can serve as a basis to contrast social media self-expression by prominent people with how the mass media portrays them.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124097924","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
Using Communication Networks to Predict Team Performance in Massively Multiplayer Online Games 利用通讯网络预测大型多人在线游戏中的团队表现
S. Müller, Raji Ghawi, J. Pfeffer
{"title":"Using Communication Networks to Predict Team Performance in Massively Multiplayer Online Games","authors":"S. Müller, Raji Ghawi, J. Pfeffer","doi":"10.1109/ASONAM49781.2020.9381481","DOIUrl":"https://doi.org/10.1109/ASONAM49781.2020.9381481","url":null,"abstract":"Virtual teams are becoming increasingly important. Since they are digital in nature, their “trace data” enable a broad set of new research opportunities. Online Games are especially useful for studying social behavior patterns of collaborative teams. In our study we used longitudinal data from the Massively Multiplayer Online Game (MMOG) Travian collected over a 12-month period that included 4,753 teams with 18,056 individuals and their communication networks. For predicting team performance, we selected 13 SNA-based attributes frequently used in team and leadership research. Using machine learning algorithms, the added explanatory power derived from the patterns of the communication networks enabled us to achieve an adjusted R2 = 0.67 in the best fitting performance prediction model and a prediction accuracy of up to 95.3% in the classification of top performing teams.","PeriodicalId":196317,"journal":{"name":"2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115918629","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}
引用次数: 7
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学术官方微信