发布求助
文献互助 智能选刊 最新文献

2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)最新文献

筛选
英文 中文
Towards an End-User Layer for Data Integrity 迈向数据完整性的终端用户层
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352538
Lu'ay Abu Rayyan, Hakim Hacid, Andrew Leoncé
{"title":"Towards an End-User Layer for Data Integrity","authors":"Lu'ay Abu Rayyan, Hakim Hacid, Andrew Leoncé","doi":"10.1145/3350546.3352538","DOIUrl":"https://doi.org/10.1145/3350546.3352538","url":null,"abstract":"Data Integrity (DI) is the ability to ensure that a data retrieved from a database is the same as that stored and processed. It is a major component of data security and has an important role for the quality of decision making. While most of the existing approaches rely on a reinforcement of security mechanisms, e.g., access control or cryptography techniques, to ensure a high data integrity quality, we follow an end-user perspective to this end to complement the security approach. Simple, yet powerful, the proposed approach is promising in the inclusion of the end-user into the complex problem of DI. CCS CONCEPTS • Information systems → Integrity checking; Database utilities and tools; • Security and privacy → Database activity monitoring; Information accountability and usage control.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114966390","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
Generating Objective Summaries of Sports Matches Using Social Media 利用社交媒体生成客观的体育比赛摘要
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352546
Chahine Koleejan, Hiroya Takamura, M. Okumura
{"title":"Generating Objective Summaries of Sports Matches Using Social Media","authors":"Chahine Koleejan, Hiroya Takamura, M. Okumura","doi":"10.1145/3350546.3352546","DOIUrl":"https://doi.org/10.1145/3350546.3352546","url":null,"abstract":"Social media has become a platform where users post their messages about a wide range of topics, making it a useful source of information to summarize events such as sports matches. Previous summaries of sports matches generated using social media tended to be biased towards one of the teams, due to a high proportion of the posts used being from fans of the teams involved. This is problematic because in general people desire summaries that are free from bias and objective. To remedy this problem and generate higher quality summaries, we propose two approaches. The first is a function maximization method which measures the objectivity of each post based on its constituent words. The second is a neural network-based approach, where we use an encoder-decoder architecture. Then, we compare them with an existing approach and show promising results that indicate the effectiveness of our methods.CCS CONCEPTS • Information systems → Social networks; • Computing methodologies → Natural language generation; Information extraction.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116759100","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 MuItilayer Perceptron Architecture for Detecting Deceptive Cryptocurrencies in Coin Market Capitalization Data 用于在硬币市值数据中检测欺骗性加密货币的多层感知器架构
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352564
Harshita Dalal, M. Abulaish
{"title":"A MuItilayer Perceptron Architecture for Detecting Deceptive Cryptocurrencies in Coin Market Capitalization Data","authors":"Harshita Dalal, M. Abulaish","doi":"10.1145/3350546.3352564","DOIUrl":"https://doi.org/10.1145/3350546.3352564","url":null,"abstract":"Due to increasing popularity of Bitcoin and other cryptocurrencies, proliferation of deceptive cryptocurrencies over the internet is a global concern. In this paper, we have identified a set of 24 features through analyzing Cryptocurrency Market Capitalization (CMC) data and propose a Multilayer Perceptron (MLP) architecture for detecting deceptive cryptocurrencies. The proposed MLP architecture is compared with three traditional machine learning algorithms over a real cryptocurrency dataset crawled from CMC website, and it performs significantly better. CCS CONCEPTS • Security and privacy $rightarrow$ Web application security; • Information systems $rightarrow$ Data analytics; • Computing methodologies $rightarrow$ Supervised learning.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116247243","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
Combining Visual and Contextual Information for Fraudulent Online Store CIassification 结合视觉和上下文信息进行欺诈性在线商店分类
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352504
Wouter Mostard, Bastiaan Zijlema, M. Wiering
{"title":"Combining Visual and Contextual Information for Fraudulent Online Store CIassification","authors":"Wouter Mostard, Bastiaan Zijlema, M. Wiering","doi":"10.1145/3350546.3352504","DOIUrl":"https://doi.org/10.1145/3350546.3352504","url":null,"abstract":"Following the rise of e-commerce there has been a dramatic increase in online criminal activities targeting online shoppers. Considering that the number of online stores has risen dramatically, manually checking these stores has become intractable. An automated process is therefore required. We approached this problem by applying machine learning techniques to extract and detect instances of fraudulent online stores. Two sources of information were used to determine the legitimacy of an online store. First, contextual features extracted from the HTML and meta information were used to train various machine learning algorithms. Second, visual information, like the presence of social media logos, was added to make improvements on this baseline model. Results show a positive effect for adding visual information, increasing the Fl-score from 0.93 to 0.98 over the baseline model. Finally, this research shows that visual information can improve recall during web crawling.CCS CONCEPTS • Information systems → Web mining; • Computing methodologies → Machine learning.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128961897","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
Bayesian Deep Learning with Trust and Distrust in Recommendation Systems 推荐系统中基于信任和不信任的贝叶斯深度学习
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352496
Dimitrios Rafailidis
{"title":"Bayesian Deep Learning with Trust and Distrust in Recommendation Systems","authors":"Dimitrios Rafailidis","doi":"10.1145/3350546.3352496","DOIUrl":"https://doi.org/10.1145/3350546.3352496","url":null,"abstract":"Exploiting the selections of social friends and foes can efficiently face the data scarcity of user preferences and the cold-start problem. In this paper, we present a Social Deep Pairwise Learning model, namely SDPL. According to the Bayesian Pairwise Ranking criterion, we design a loss function with multiple ranking criteria based on the selections of users, and those in their friends and foes to improve the accuracy in the top-k recommendation task. We capture the nonlinearity in user preferences and the social information of trust and distrust relationships by designing a deep learning architecture. In each backpropagation step, we perform social negative sampling to meet the multiple ranking criteria of our loss function. Our experiments on a benchmark dataset from Epinions, among the largest publicly available that has been reported in the relevant literature, demonstrate the effectiveness of the proposed approach, outperforming other state-of-the art methods. In addition, we show that our deep learning strategy plays an important role in capturing the nonlinear associations between user preferences and the social information of trust and distrust relationships, and demonstrate that our social negative sampling strategy is a key factor in SDPL.CCS CONCEPTS • Information systems → Collaborative and social computing systems and tools.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129924940","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}
引用次数: 8
Co-learning Multiple Browsing Tendencies of a User by Matrix Factorization-based Multitask Learning 基于矩阵分解的多任务学习共同学习用户的多种浏览倾向
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352526
Guo-Jhen Bai, Cheng-You Lien, Hung-Hsuan Chen
{"title":"Co-learning Multiple Browsing Tendencies of a User by Matrix Factorization-based Multitask Learning","authors":"Guo-Jhen Bai, Cheng-You Lien, Hung-Hsuan Chen","doi":"10.1145/3350546.3352526","DOIUrl":"https://doi.org/10.1145/3350546.3352526","url":null,"abstract":"Predicting an online user’s future behavior is beneficial for many applications. For example, online retailers may utilize such information to customize the marketing strategy and maximize profit. This paper aims to predict the types of webpages a user is going to click on. We observe that instead of building independent models to predict each individual type of web page, it is more effective to use a unified model to predict a user’s future clicks on different types of web pages simultaneously. The proposed model makes predictions based on the latent variables that represent possible interactions among the multiple targets and among the features. The experimental results show that this method outperforms the carefully tuned single-target training models most of the time. If the size of the training data is limited, the model shows a significant improvement over the baseline models, likely because the hidden relationship among different targets can be discovered by our model.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130659951","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
Fair Team Recommendations for Multidisciplinary Projects 多学科项目的公平团队建议
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352533
Lucas Machado, K. Stefanidis
{"title":"Fair Team Recommendations for Multidisciplinary Projects","authors":"Lucas Machado, K. Stefanidis","doi":"10.1145/3350546.3352533","DOIUrl":"https://doi.org/10.1145/3350546.3352533","url":null,"abstract":"The focus of this work is on the problem of team recommendations, in which teams have multidisciplinary requirements and team members’ selection is based on the match of their skills and the requirements. When assembling multiple teams there is also a challenge of allocating the best members in a fair way between the teams. We formally define the problem and propose a brute force and a faster heuristic method as solutions to create team recommendations to multidisciplinary projects. Furthermore, to increase the fairness between the recommended teams, the K-rounds and Pairs-rounds methods are proposed as variations of the heuristic approach. Several different test scenarios are executed to analyze and compare the effectiveness of these methods.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125785336","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}
引用次数: 19
A Multi-Agent System for Energy Management in a Dynamic and Open Environment: Architecture and Optimisation 动态开放环境下的多智能体能源管理系统:体系结构与优化
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352545
O. Kem, Feirouz Ksontini
{"title":"A Multi-Agent System for Energy Management in a Dynamic and Open Environment: Architecture and Optimisation","authors":"O. Kem, Feirouz Ksontini","doi":"10.1145/3350546.3352545","DOIUrl":"https://doi.org/10.1145/3350546.3352545","url":null,"abstract":"The increasing presence of smart and dynamic environments with IoT devices creates new challenges in energy optimisation such as handling environments’ dynamics and privacy concerns. In this paper, we aim at optimising energy consumption in such environments, exploiting building flexibility to reduce energy bills, while respecting user preferences as well as device constraints and addressing the complexity of the environment. We propose a multi-agent optimisation system based on Alternating Direction Method of Multipliers to solve the optimisation problem. Various evaluations of the proposal show significant energy cost savings, while addressing dynamics and preserving privacy.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122262654","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
An Evolutionary Approach to Class Disjointness Axiom Discovery 类不相交公理发现的进化方法
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352502
T. Nguyen, A. Tettamanzi
{"title":"An Evolutionary Approach to Class Disjointness Axiom Discovery","authors":"T. Nguyen, A. Tettamanzi","doi":"10.1145/3350546.3352502","DOIUrl":"https://doi.org/10.1145/3350546.3352502","url":null,"abstract":"Axiom learning is an essential task in enhancing the quality of an ontology, a task that sometimes goes under the name of ontology enrichment. To overcome some limitations of recent work and to contribute to the growing library of ontology learning algorithms, we propose an evolutionary approach to automatically discover axioms from the abundant RDF data resource of the Semantic Web. We describe a method applying an instance of an Evolutionary Algorithm, namely Grammatical Evolution, to the acquisition of OWL class disjointness axioms, one important type of OWL axioms which makes it possible to detect logical inconsistencies and infer implicit information from a knowledge base. The proposed method uses an axiom scoring function based on possibility theory and is evaluated against a Gold Standard, manually constructed by knowledge engineers. Experimental results show that the given method possesses high accuracy and good coverage. CCS CONCEPTS • Computing methodologies → Ontology engineering; Machine learning algorithms; Instance-based learning; Evolutionary algorithms;","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131841488","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
Early Detection of Problem Gambling based on Behavioral Changes using Shapelets 基于Shapelets的行为变化的问题赌博早期检测
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352549
H. Suzuki, Ryoko Nakamura, Aozora Inagaki, Isamu Watanabe, T. Takagi
{"title":"Early Detection of Problem Gambling based on Behavioral Changes using Shapelets","authors":"H. Suzuki, Ryoko Nakamura, Aozora Inagaki, Isamu Watanabe, T. Takagi","doi":"10.1145/3350546.3352549","DOIUrl":"https://doi.org/10.1145/3350546.3352549","url":null,"abstract":"Recent years have seen strides achieved in the field of behavior analysis by using online gambling data. However, studies on time-series behavioral changes remain inadequate. In this study, we propose a classifier that quantifies changes in the player’s time series of online gambling behavioral data by using distance measurement with shapelet for the early detection of behaviors in players that could lead to problem gambling. We investigated the prediction capabilities of shapelets that represent behavioral change patterns, and the results showed that shapelet features can improve predictive accuracy. Furthermore, based on this result, we found characteristic behavioral changes leading to problem gambling, such as loss chasing. Subsequently, we demonstrated a possibility for improvements in accuracy using these behavioral change patterns based on expert knowledge. CCS CONCEPTS• Information systems → Data mining; • Applied computing → Computer games.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124229191","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
下一页 尾页
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学术官方微信