M. Al-Mardini, Ayman Hajja, L. Clover, D. Olaleye, Youngjin Park, Jay Paulson, Yang Xiao
{"title":"Reduction of Hospital Readmissions through Clustering Based Actionable Knowledge Mining","authors":"M. Al-Mardini, Ayman Hajja, L. Clover, D. Olaleye, Youngjin Park, Jay Paulson, Yang Xiao","doi":"10.1109/WI.2016.0071","DOIUrl":"https://doi.org/10.1109/WI.2016.0071","url":null,"abstract":"Healthcare spending has been increasing in the last few decades. One of the main reasons for this increase is hospital readmissions, which is defined as a re-hospitalization of a patient after being discharged from a hospital within a short period of time. The excessive amount of money spent every year on hospital readmissions and the urge to enhance healthcare quality make reducing hospital readmissions a necessity. In this paper, we extract knowledge from a medical dataset and apply the concept of mining actionable rules to guide the health domain experts in their decision-making process. We present novel algorithms to increase the predictability of the patients' paths (the sequence of procedures that patients undertakes to reach a desired treatment) by clustering the patients according to their set of diagnoses. Moreover, we present a scoring metric to evaluate procedures in procedure graphs (the tree of all possible procedure paths) and a scoring metric to evaluate clusters of diagnoses which would allow us to anticipate the number of following readmissions for a new patient. Finally, we present an algorithm to evaluate the score (average number of following readmissions) for new patients prior to applying the action rules and after. The results presented in this paper show that our algorithms are able to reduce the average number of readmissions to a high degree.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"26 1","pages":"444-448"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90707020","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}
{"title":"A Basic Study on Spoiler Detection from Review Comments Using Story Documents","authors":"Kyosuke Maeda, Y. Hijikata, Satoshi Nakamura","doi":"10.1109/WI.2016.0098","DOIUrl":"https://doi.org/10.1109/WI.2016.0098","url":null,"abstract":"In many shopping sites such as Amazon.com it is possible to view and write reviews of items (products and content). Reviews of items including stories, such as novels, movies, and comics, include reviewers' opinions. Often, these reviews also include descriptions of the story. In some cases, these descriptions may spoil later reader's or viewer's enjoyment and excitement. Hereinafter, we call these descriptions spoilers. Spoilers may be related to the position in the story line. In this study we use story documents. Story documents are documents that record all of the details of the given story. Using the story documents, we investigate the location to which the content of the spoilers correspond in the story documents. Based on the result of the investigation, we consider how to detect spoilers in reviewers' comments.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"1 1","pages":"572-577"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79488998","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}
Alberto Bartoli, A. D. Lorenzo, Eric Medvet, D. Morello, F. Tarlao
{"title":"\"Best Dinner Ever!!!\": Automatic Generation of Restaurant Reviews with LSTM-RNN","authors":"Alberto Bartoli, A. D. Lorenzo, Eric Medvet, D. Morello, F. Tarlao","doi":"10.1109/WI.2016.0130","DOIUrl":"https://doi.org/10.1109/WI.2016.0130","url":null,"abstract":"Consumer reviews are an important information resource for people and a fundamental part of everyday decision-making. Product reviews have an economical relevance which may attract malicious people to commit a review fraud, by writing false reviews. In this work, we investigate the possibility of generating hundreds of false restaurant reviews automatically and very quickly. We propose and evaluate a method for automatic generation of restaurant reviews tailored to the desired rating and restaurant category. A key feature of our work is the experimental evaluation which involves human users. We assessed the ability of our method to actually deceive users by presenting to them sets of reviews including a mix of genuine reviews and of machine-generated reviews. Users were not aware of the aim of the evaluation and the existence of machine-generated reviews. As it turns out, it is feasible to automatically generate realistic reviews which can manipulate the opinion of the user.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"15 1","pages":"721-724"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78733677","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}
{"title":"Arabic Ontology Learning from Un-structured Text","authors":"Saeed Al-Bukhitan, T. Helmy","doi":"10.1109/WI.2016.0082","DOIUrl":"https://doi.org/10.1109/WI.2016.0082","url":null,"abstract":"Ontology Learning (OL) from a text is a process that consists of text processing, knowledge extraction, and ontology construction. For Arabic language, text processing, and knowledge extraction tasks are not mature as for Latin languages. They have not been integrated into the full Arabic OL pipeline. Currently, there is very little automated support for using knowledge from Arabic literature in semantically-enabled systems. This paper demonstrates the feasibility of using some existing OL methods for Arabic text and elicits proposals for further work toward building open domain OL systems for Arabic. This is done by building an OL system based on some available NLP tools for Arabic text utilizing GATE text analysis system for corpus and annotation management. The prototype is evaluated similarly to other OL systems and its performance is promising and recommended to enable more effective research and application of Arabic ontology learning.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"8 1","pages":"492-496"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84887577","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}
{"title":"On Learning and Co-learning Effective Strategies in Iterated Travelers' Dilemma","authors":"Predrag T. Tosic","doi":"10.1109/WI.2016.0120","DOIUrl":"https://doi.org/10.1109/WI.2016.0120","url":null,"abstract":"In this short paper, we summarize our previous results, and share some new insights, ideas and challenges about what types of adaptable strategies generally tend to get rewarded in Iterated Travelers' Dilemma (ITD). Our primary motivation for studying ITD is that this strategic 2-person game provides implicit incentives for cooperation – but only if both players cooperate. ITD is a non-zero-sum two-player game that generalizes the better known Iterated Prisoner's Dilemma (IPD). Both IPD and ITD can be viewed as repeated exchanges of proposals or bids, where the payoff to each agent at the end of a round is based on i) how close were the two agents' bids to each other and ii) who bid lower in that round. Our broader goal is to understand how a resource-bounded rational agent can learn about the behavior of other self-interested agents, in order to adjust his or her own bidding strategy in a manner that is most likely to be rewarding in the long run. In addition to exploring traditional reinforcement learning mechanisms in this setting, we also initiate studying the potential promise of co-learning between pairs of adaptive, self-interested but non-malicious agents with bounded computational resources.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"51 1","pages":"674-677"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83297280","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}
{"title":"An Heuristics-Based, Weakly-Supervised Approach for Classification of Stance in Tweets","authors":"Marcelo Dias, Karin Becker","doi":"10.1109/WI.2016.0021","DOIUrl":"https://doi.org/10.1109/WI.2016.0021","url":null,"abstract":"Stance detection is the task of automatically identifying if the text author is in favor or against a subject or target. This paper presents a weakly supervised approach for stance detection in tweets based solely on their contents. The approach relies on a set of heuristics used to automatically label tweets with regard to stance, which has a twofold purpose: a) automatic creation of a training corpus to develop a predictive model using a supervised learning algorithm, and b) to complement the predictive model when determining the stance of tweets. The paper analyzes the performance of the approach considering six distinct stance targets. We achieved promising results, with weighted F-measure varying from 52% to 67%.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"3 1","pages":"73-80"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88472011","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}
{"title":"Leveraging Item Connections to Improve Social Recommendations with Ratings and Reviews","authors":"Jiajin Huang, N. Zhong","doi":"10.1109/WI.2016.0035","DOIUrl":"https://doi.org/10.1109/WI.2016.0035","url":null,"abstract":"Recommender systems aim to provide users with preferred items to tackle the information overload problem in the Web era. Social relations, item connections, and usergenerated reviews on items contain abundant potential information. By combining matrix factorization with latent Dirichlet allocation, we integrate ratings, reviews, user similarity and item similarity in recommender systems. The experimental result on a real-world dataset proves that both item connection and user connection contain useful sources for recommendation, and our model can effectively improve recommendation quality.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"12 1","pages":"185-191"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89706331","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}
{"title":"Practical Web Data Extraction: Are We There Yet? - A Short Survey","authors":"Andreas Schulz, Jörg Lässig, M. Gaedke","doi":"10.1109/WI.2016.0096","DOIUrl":"https://doi.org/10.1109/WI.2016.0096","url":null,"abstract":"The number of web documents as well as the inherent data and information is growing at a rapid pace. The interest in extracting and utilizing this data is rising likewise. The prospects that are unlocked by Web Data Extraction to its users are as broad as the extensiveness of topics and fields on the Web. The major obstacle is to utilize the available data, contents and processes. Several, mostly older survey papers have already shown developments and approaches to solve Web Data Extraction tasks, but there is a need for a more up-to-date review, showing the latest developments. Additionally when looking from the user perspective, there is still a gap between research results and practical applicability. Available solutions, including research results, commercial products and open source solutions lack certain capabilities or suffer from severe usability issues. This paper therefore gives a short review of the state of the art in Web Data Extraction and relates this to the practical application of these technologies.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"29 1","pages":"562-567"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74003489","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}
Qiong Wu, Siyuan Liu, C. Miao, Y. Liu, Cyril Leung
{"title":"A Social Curiosity Inspired Recommendation Model to Improve Precision, Coverage and Diversity","authors":"Qiong Wu, Siyuan Liu, C. Miao, Y. Liu, Cyril Leung","doi":"10.1109/WI.2016.0042","DOIUrl":"https://doi.org/10.1109/WI.2016.0042","url":null,"abstract":"With the prevalence of social networks, social recommendation is rapidly gaining popularity. Currently, social information has mainly been utilized for enhancing rating prediction accuracy, which may not be enough to satisfy user needs. Items with high prediction accuracy tend to be the ones that users are familiar with and may not interest them to explore. In this paper, we take a psychologically inspired view to recommend items that will interest users based on the theory of social curiosity and study its impact on important dimensions of recommender systems. We propose a social curiosity inspired recommendation model which combines both user preferences and user curiosity. The proposed recommendation model is evaluated using large scale real world datasets and the experimental results demonstrate that the inclusion of social curiosity significantly improves recommendation precision, coverage and diversity.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"27 1","pages":"240-247"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79023113","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}
{"title":"Statistical-Based Image Tagging","authors":"M. Masoud, Sanghoon Lee, S. Belkasim","doi":"10.1109/WI.2016.0106","DOIUrl":"https://doi.org/10.1109/WI.2016.0106","url":null,"abstract":"The automation of image tagging is extremely important research topic in recent years due to its importance in building large image databases. The optimal goal of recent research is to automatically annotate images and overcome the semantic gap between the image content and the associated text representation. Image retrieval from large databases is one of the important domains that can benefit from automatic tagging. The automatic tagging task is currently associated with many challenges ranging from inaccuracy of retrieval technique to the efficiency and speed of the tagging approaches. In this paper we propose a statistical based tagging approach that uses normalized multidimensional color histograms as a global descriptor of low level features of images. Our results demonstrate that our proposed approach can outperform the Learning based methods in terms of accuracy and speed.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"7 1","pages":"610-613"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77508187","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}