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

筛选
英文 中文
Potential Gain as a Centrality Measure 作为中心性度量的潜在增益
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352559
P. D. Meo, M. Levene, A. Provetti
{"title":"Potential Gain as a Centrality Measure","authors":"P. D. Meo, M. Levene, A. Provetti","doi":"10.1145/3350546.3352559","DOIUrl":"https://doi.org/10.1145/3350546.3352559","url":null,"abstract":"Navigability is a distinctive features of graphs associated with artificial or natural systems whose primary goal is the transportation of information or goods. We say that a graph G is navigable when an agent is able to efficiently reach any target node in G by means of local routing decisions. In a social network navigability translates to the ability of reaching an individual through personal contacts. Graph navigability is well-studied, but a fundamental question is still open: why are some individuals more likely than others to be reached via short, friend-of-a-friend, communication chains? In this article we answer the question above by proposing a novel centrality metric called the potential gain, which, in an informal sense, quantifies the easiness at which a target node can be reached. We define two variants of the potential gain, called the geometric and the exponential potential gain, and present fast algorithms to compute them. The geometric and the potential gain are the first instances of a novel class of composite centrality metrics, i.e., centrality metrics which combine the popularity of a node in G with its similarity to all other nodes. As shown in previous studies, popularity and similarity are two main criteria which regulate the way humans seek for information in large networks such as Wikipedia. We give a formal proof that the potential gain of a node is always equivalent to the product of its degree centrality (which captures popularity) and its Katz centrality (which captures similarity). CCS CONCEPTS • Information systems → Web crawling; Web indexing.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"4 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":"128263665","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
Incremental Blocking for Entity Resolution over Web Streaming Data Web流数据上实体解析的增量阻塞
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352542
T. Araújo, K. Stefanidis, Carlos Eduardo S. Pires, J. Nummenmaa, T. Nóbrega
{"title":"Incremental Blocking for Entity Resolution over Web Streaming Data","authors":"T. Araújo, K. Stefanidis, Carlos Eduardo S. Pires, J. Nummenmaa, T. Nóbrega","doi":"10.1145/3350546.3352542","DOIUrl":"https://doi.org/10.1145/3350546.3352542","url":null,"abstract":"The widespread use of information systems has become a valuable source of semi-structured data. In this context, Entity Resolution (ER) emerges as a fundamental task to integrate multiple knowledge bases or identify similarities between data items (i.e., entities). Since ER is an inherently quadratic task, blocking techniques are often used to improve efficiency. Beyond the challenges related to the data volume and heterogeneity, blocking techniques also face two other challenges: streaming data and incremental processing. To address these challenges, we propose PRIME, a novel incremental schema-agnostic blocking technique that utilizes parallelism to enhance blocking efficiency. The proposed technique deals with streaming and incremental data using a distributed computational infrastructure. To improve efficiency, the technique avoids unnecessary comparisons and applies a time window strategy to prevent excessive memory consumption. CCS CONCEPTS … Information systems → Entity resolution; Semi-structured data.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"6 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":"124685743","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
Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation 基于主从令牌循环的仙人掌图自稳定拓扑计算(识别)
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352536
Yihua Ding, J. Wang, P. Srimani
{"title":"Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation","authors":"Yihua Ding, J. Wang, P. Srimani","doi":"10.1145/3350546.3352536","DOIUrl":"https://doi.org/10.1145/3350546.3352536","url":null,"abstract":"In this paper we propose a self stabilizing algorithm to compute the topology of a given arbitrary cactus graph; we use the most recent self stabilizing algorithm for token circulation in Cactus graphs [2] and design the proposed algorithm by making a single token traverse the graph multiple times and accumulating the topology information at the master node incrementally after each round in a space efficient way. The topology computation is completed in $O(n^{2})$ steps with $O (Delta)$ bits extra storage at each node, where n is the number of nodes in the graph, and $lt pgt Delta$ is the maximum degree of the cactus graph.","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":"128859020","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
Graph-based Knowledge Tracing: Modeling Student Proficiency Using Graph Neural Network 基于图的知识追踪:用图神经网络建模学生的熟练程度
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352513
Hiromi Nakagawa, Yusuke Iwasawa, Y. Matsuo
{"title":"Graph-based Knowledge Tracing: Modeling Student Proficiency Using Graph Neural Network","authors":"Hiromi Nakagawa, Yusuke Iwasawa, Y. Matsuo","doi":"10.1145/3350546.3352513","DOIUrl":"https://doi.org/10.1145/3350546.3352513","url":null,"abstract":"Recent advancements in computer-assisted learning systems have caused an increase in the research of knowledge tracing, wherein student performance on coursework exercises is predicted over time. From the viewpoint of data structure, the coursework can be potentially structured as a graph. Incorporating this graph-structured nature into the knowledge tracing model as a relational inductive bias can improve its performance; however, previous methods, such as deep knowledge tracing, did not consider such a latent graph structure. Inspired by the recent successes of the graph neural network (GNN), we herein propose a GNN-based knowledge tracing method, i.e., graph-based knowledge tracing. Casting the knowledge structure as a graph enabled us to reformulate the knowledge tracing task as a time-series node-level classification problem in the GNN. As the knowledge graph structure is not explicitly provided in most cases, we propose various implementations of the graph structure. Empirical validations on two open datasets indicated that our method could potentially improve the prediction of student performance and demonstrated more interpretable predictions compared to those of the previous methods, without the requirement of any additional information.CCS CONCEPTS • Computing methodologies → Neural networks; • Information systems → Data mining; • Applied computing → Learning management systems.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"1 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":"131040648","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}
引用次数: 133
Image Recall on Image-Text Intertwined Lifelogs 图像-文本交织生活日志的图像回忆
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352555
Tzu-Hsuan Chu, Hen-Hsen Huang, Hsin-Hsi Chen
{"title":"Image Recall on Image-Text Intertwined Lifelogs","authors":"Tzu-Hsuan Chu, Hen-Hsen Huang, Hsin-Hsi Chen","doi":"10.1145/3350546.3352555","DOIUrl":"https://doi.org/10.1145/3350546.3352555","url":null,"abstract":"People engage in lifelogging by taking photos with cameras and cellphones anytime anywhere and share the photos, intertwined with captions or descriptions, on social media platforms. The imagetext intertwined data provides richer information for image recall. When images cannot keep the complete information, the textual information is a complement to describe the life experiences under the photos. This work proposes a multimodal retrieval model for image recall in image-text intertwined lifelogs. Our Attentive Image-Story model combines an Image model, which transfers visual information and textual information to a single representation space, and a Story model, which captures text-based contextual information, with an attention mechanism to reduce the semantic gap between visual and textual information. Experimental results show our model outperforms a state-of-the-art image-based retrieval model and the image/text hybrid system.CCS CONCEPTS• Information systems → Multimedia and multimodal retrieval; • Computing methodologies → Natural language processing; Image representations.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"1 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":"129471970","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}
引用次数: 6
Agent-based Business Process Orchestration for IoT 基于代理的物联网业务流程编排
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352554
Timotheus Kampik, A. Malhi, Kary Främling
{"title":"Agent-based Business Process Orchestration for IoT","authors":"Timotheus Kampik, A. Malhi, Kary Främling","doi":"10.1145/3350546.3352554","DOIUrl":"https://doi.org/10.1145/3350546.3352554","url":null,"abstract":"The so-called Internet of Things is of increasing importance for facilitating productivity across industries, i.e., by connecting sensors with manufacturing lines and IT system landscapes with an increasing degree of autonomy. In this context, a common challenge is enabling reasonable trade-offs between structure and control on the one hand and flexibility and human-like intelligent behavior on the other hand. To address this challenge, we establish the need for and requirements of a hybrid IoT-/agent-based business process orchestration architecture that utilizes open standards. We propose a four-layered architecture, which integrates autonomous agents and business process orchestration for IoT/agents, and provide a running example for a supply chain management (purchasing) use case. CCS CONCEPTS• Applied computing → Business process management; • Information systems; • Software and its engineering → Software as a service orchestration system;","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"98 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":"133673852","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
Social Network Chatbots for Smoking Cessation: Agent and Multi-Agent Frameworks 戒烟的社交网络聊天机器人:代理和多代理框架
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352532
D. Calvaresi, J. Calbimonte, Fabien Dubosson, A. Najjar, M. Schumacher
{"title":"Social Network Chatbots for Smoking Cessation: Agent and Multi-Agent Frameworks","authors":"D. Calvaresi, J. Calbimonte, Fabien Dubosson, A. Najjar, M. Schumacher","doi":"10.1145/3350546.3352532","DOIUrl":"https://doi.org/10.1145/3350546.3352532","url":null,"abstract":"Asynchronous messaging is leading human-machine interaction due to the boom of mobile devices and social networks. The recent release of dedicated APIs from messaging platforms boosted the development of computer programs able to conduct conversations, (i.e., chatbots), which have been adopted in several domain-specific contexts. This paper proposes SMAG: a chatbot framework supporting a smoking cessation program (JDF) deployed on a social network. In particular, it details the single-agent implementation, the campaign results, a multi-agent design for SMAG enabling the modelization of personalized behavior and user profiling, and highlighting of coupling chatbot technology with and multi-agent systems. CCS CONCEPTS • Applied computing → Health informatics; • Information systems → Personalization; Social networks; • Human-centered computing → Web-based interaction; Natural language interfaces.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"53 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":"127566633","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}
引用次数: 22
Mentions of Security Vulnerabilities on Reddit, Twitter and GitHub 在Reddit, Twitter和GitHub上提到安全漏洞
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352519
Sameera Horawalavithana, Abhishek Bhattacharjee, Renhao Liu, Nazim Choudhury, L. Hall, Adriana Iamnitchi
{"title":"Mentions of Security Vulnerabilities on Reddit, Twitter and GitHub","authors":"Sameera Horawalavithana, Abhishek Bhattacharjee, Renhao Liu, Nazim Choudhury, L. Hall, Adriana Iamnitchi","doi":"10.1145/3350546.3352519","DOIUrl":"https://doi.org/10.1145/3350546.3352519","url":null,"abstract":"Activity on social media is seen as a relevant sensor for different aspects of the society. In a heavily digitized society, security vulnerabilities pose a significant threat that is publicly discussed on social media. This study presents a comparison of user-generated content related to security vulnerabilities on three digital platforms: two social media conversation channels (Reddit and Twitter) and a collaborative software development platform (GitHub). Our data analysis shows that while more security vulnerabilities are discussed on Twitter, relevant conversations go viral earlier on Reddit. We show that the two social media platforms can be used to accurately predict activity on GitHub. CCS CONCEPTS • Networks → Online social networks; • Theory of computation → Social networks.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"287 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":"121426407","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}
引用次数: 33
APNEA: Intelligent Ad-Bidding Using Sentiment Analysis 使用情感分析的智能广告竞价
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352503
Samuel Bushi, Osmar R Zaiane
{"title":"APNEA: Intelligent Ad-Bidding Using Sentiment Analysis","authors":"Samuel Bushi, Osmar R Zaiane","doi":"10.1145/3350546.3352503","DOIUrl":"https://doi.org/10.1145/3350546.3352503","url":null,"abstract":"Online advertising is one of the most lucrative forms of advertising, making it an important channel of advertising media. Contextual Advertising is a type of online display advertising that takes cues from the content of the triggering page and displays advertisements that are relevant to the current context. However, on several occasions, the context may have a negative connotation, and displaying advertisements that are relevant to it might prove to be detrimental to the advertiser. We refer to such a scenario as an unfortunate placement. In this work, we propose APNEA (Ad Positive NEgative Analysis), a light-weight system that uses a sentiment-oriented approach to rank the advertisers such that positively correlated brands are ranked higher than brands that are neutral or negatively correlated. Experiments show that APNEA helps avoid unfortunate placements while maintaining ad-relevance. It outperforms several baselines in terms of accuracy on human-annotated test data while having a lower run-time, which is crucial for real-time bidding systems. CCS CONCEPTS • Information systems → Computational advertising; Content match advertising; Display advertising; Sentiment analysis.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"23 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":"131609485","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
Design and implementation of an open source Greek POS Tagger and Entity Recognizer using spaCy 使用spaCy的开源希腊语POS标记器和实体识别器的设计与实现
2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2019-10-01 DOI: 10.1145/3350546.3352543
Eleni Partalidou, Eleftherios Spyromitros Xioufis, S. Doropoulos, S. Vologiannidis, K. Diamantaras
{"title":"Design and implementation of an open source Greek POS Tagger and Entity Recognizer using spaCy","authors":"Eleni Partalidou, Eleftherios Spyromitros Xioufis, S. Doropoulos, S. Vologiannidis, K. Diamantaras","doi":"10.1145/3350546.3352543","DOIUrl":"https://doi.org/10.1145/3350546.3352543","url":null,"abstract":"This paper proposes a machine learning approach to part-of-speech tagging and named entity recognition for Greek, focusing on the extraction of morphological features and classification of tokens into a small set of classes for named entities. The architecture model that was used is introduced. The greek version of the spaCy platform was added into the source code, a feature that did not exist before our contribution, and was used for building the models. Additionally, a part of speech tagger was trained that can detect the morphology of the tokens and performs higher than the state-of-the-art results when classifying only the part of speech. For named entity recognition using spaCy, a model that extends the standard ENAMEX type (organization, location, person) was built. Certain experiments that were conducted indicate the need for flexibility in out-of-vocabulary words and there is an effort for resolving this issue. Finally, the evaluation results are discussed. CCS CONCEPTS • Computing methodologies → Natural language processing.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"9 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":"114319462","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}
引用次数: 28
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学术官方微信