{"title":"NutRec: Nutrition Oriented Online Recipe Recommender","authors":"Elizabeth Gorbonos, Yang Liu, C. Hoàng","doi":"10.1109/WI.2018.0-111","DOIUrl":"https://doi.org/10.1109/WI.2018.0-111","url":null,"abstract":"In this paper we aim to solve a problem which many home-cooks encounter when searching for recipes online. Namely, finding recipes which best fit a handy set of ingredients while at the same time follow healthy eating guidelines. This task is especially difficult since the lion's share of online recipes have been shown to be unhealthy. In this paper we propose a novel algorithm which utilizes machine-learning techniques such as neural networks and matrix factorization in order to model the interactions between ingredients and their proportions within recipes for the purpose of offering suitable recommendations. The empirical results support the method's intuition and showcase its ability to retrieve healthier recipes.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123934799","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}
Jan Klein, S. Bhulai, M. Hoogendoorn, R. Mei, Raymond Hinfelaar
{"title":"Detecting Network Intrusion beyond 1999: Applying Machine Learning Techniques to a Partially Labeled Cybersecurity Dataset","authors":"Jan Klein, S. Bhulai, M. Hoogendoorn, R. Mei, Raymond Hinfelaar","doi":"10.1109/WI.2018.00017","DOIUrl":"https://doi.org/10.1109/WI.2018.00017","url":null,"abstract":"This paper demonstrates how different machine learning techniques performed on a recent, partially labeled dataset (based on the Locked Shields 2017 exercise) and which features were deemed important. Moreover, a cybersecurity expert analyzed the results and validated that the models were able to classify the known intrusions as malicious and that they discovered new attacks. In a set of 500 detected anomalies, 50 previously unknown intrusions were found. Given that such observations are uncommon, this indicates how well an unlabeled dataset can be used to construct and to evaluate a network intrusion detection system.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127762222","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}
Luis Martín Sánchez-Adame, S. Mendoza, B. González-Beltrán, José Rodríguez, A. Viveros
{"title":"AUX and UX Evaluation of User Tools in Social Networks","authors":"Luis Martín Sánchez-Adame, S. Mendoza, B. González-Beltrán, José Rodríguez, A. Viveros","doi":"10.1109/WI.2018.0-101","DOIUrl":"https://doi.org/10.1109/WI.2018.0-101","url":null,"abstract":"Online social networks provide technological support for making up virtual groups of any size, whose members share common interests and interact through the Internet. A person joins a social network not only owing to its popularity and the quality of its contents, but also thanks to the User Experience (UX) that the platform offers. A crucial factor in the growth and survival of any virtual social group is participation, which should be facilitated by suitable user tools supplied by the platform. However, this is not always the case. Anticipated User eXperience (AUX) allows knowing the idealisations, hopes, and desires of the users in a very early stage of any development. In this paper, we propose an AUX and UX evaluation method for user tools of social networks, whose goal is to improve their design, and through it, the participation of people. We tested our method by an experimental design that included the construction of paper prototypes and execution of tasks in actual platforms. The AUX and UX of the participants were measured with AttrakDiff. As shown by our results, based on their previous experience, participants have fixed ideas on the behaviour of user tools, having a visible impact when their expectations are not met.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130008546","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":"Pricing Strategies with Promotion Time Limitation in Online Social Networks","authors":"Yan Li, V. Li","doi":"10.1109/WI.2018.00-82","DOIUrl":"https://doi.org/10.1109/WI.2018.00-82","url":null,"abstract":"Online social networks provide a platform for customers to share their experience and make viral marketing possible. Through online social networks, sellers can apply marketing strategies to reach more potential buyers and thus gain more revenue. Previous studies on social network marketing based on the influence maximization problem focus on how to propagate information widely and neglect that price is a key factor that influences information diffusion. In this paper, we study the problem of how to design pricing strategies in order to maximize the revenue when the product usage or promotion time is limited. Different from the existing study of optimal pricing scheme over online social networks, we consider how the price may influence the diffusion. In addition, with limited promotion time, the prices assigned in the different promotion stages of the pricing sequence can be increasing. To better understand the problem, we propose a framework which incorporates the influence maximization problem and a multi-state diffusion model. In the diffusion model, users are divided into different groups by their purchasing behavior and have different influence power, which informs how pricing strategies can influence the potential buyers. We design several pricing strategies under our framework with different pricing sequence order and different promotion time. Simulations are performed to illustrate the concepts in our framework and compare different pricing strategies. With our framework, we can provide some guidelines for the seller when designing the pricing strategy.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121349417","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":"[Title page iii]","authors":"","doi":"10.1109/wi.2018.00002","DOIUrl":"https://doi.org/10.1109/wi.2018.00002","url":null,"abstract":"","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"430 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124235844","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":"Conditional Relationship Extraction for Diseases and Symptoms by a Web Search-Based Approach","authors":"Yi-Hui Lee, Jia-Ling Koh","doi":"10.1109/WI.2018.00-38","DOIUrl":"https://doi.org/10.1109/WI.2018.00-38","url":null,"abstract":"This paper studies the strategies of automatically extracting the conditional relationships between diseases and symptoms from a Chinese encyclopedia site and the disease-related web pages searched from the Internet. At first, the seed symptoms of a disease are extracted from an online medical encyclopedia automatically. These seed symptoms are utilized as query keywords to automatically find more symptoms of a disease from the unstructured documents of the disease-related search results. Next, a jointly learning method is used to construct the embedded representations of the conditional terms and pattern terms. Besides, the semantic similarity matrix of conditional terms is computed through the co-clustering algorithm to discover the representative conditional terms of the clusters. The result of experiments shows that the proposed method, which discovers the semantically related symptoms of a disease associated with conditionals, achieves high accuracy. Besides, many unusually known symptoms considered by the medical experts are discovered, which may be noticeable symptoms needing further verification in the future.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124240980","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":"Research on Mathematical Formula Knowledge Base for Formula Recognition","authors":"Zhijun Guo, Yao Liu","doi":"10.1109/WI.2018.00-27","DOIUrl":"https://doi.org/10.1109/WI.2018.00-27","url":null,"abstract":"A mathematical formula image must be able to reproduce its layout, syntax structure, and semantic meaning before it can be widely used. In order to achieve an accurate reproduction of mathematical formulas, the first important thing is to establish an accurate and comprehensive formula model. Based on the ontology thought, this paper presents a mathematical formula model and builds a mathematical knowledge base based on this model. The mathematical formula knowledge base uses an ontology to store mathematical formulas, so that the mathematical symbols, formula structures, and formula semantics are effectively combined to form a semantic network. The mathematical formula knowledge base can be used for the recognition of mathematical formulas. Furthermore, it can accurately describe the computational semantics expressed by the mathematical formula.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122863184","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 Knowledge Graph for Open-Domain Question Answering","authors":"J. Costa, Anagha Kulkarni","doi":"10.1109/WI.2018.00-63","DOIUrl":"https://doi.org/10.1109/WI.2018.00-63","url":null,"abstract":"Rich and comprehensive knowledge graphs (KG) of the Web, such as, Google KG, NELL, and Diffbot KG, are becoming increasingly prevalent and powerful as the underlying AI technology is rapidly progressing. In this work, we leverage this ongoing advancement for the task of answering questions posed from any domain and any type (factoid and non-factoid). We present a framework for knowledge graph based question answering systems, KGQA, and experiment with an instance of this framework that employs Diffbot KG. The unique features offered by KGs, such as, rapid query response time, connections between related graph objects, and structured information, are used to design a QA system that is effective and efficient.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137807","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":"DRIM: MDL-Based Approach for Fast Diverse Summarization","authors":"N. Vanetik, Marina Litvak","doi":"10.1109/WI.2018.00-17","DOIUrl":"https://doi.org/10.1109/WI.2018.00-17","url":null,"abstract":"Automated text summarization extracts essential information from original text and presents it in a predefined number of words. In this paper, we introduce an unsupervised extractive summarization approach that takes its roots from the SLIM dataset compression algorithm [1] based on the Minimum Description Length (MDL) principle [2], [3]. Our approach represents text as a transactional dataset, where sentences are transactions and normalized words are items. We use the SLIM algorithm (SLIM is not an abbreviation, it is Dutch word for 'smart') to solve the main bottleneck of the MDL computation, which is the generation of all frequent itemsets as a first step of the model construction. Additionally, we add a diversity constraint to the model in order to decrease appearance of repeated information in a summary. We introduce DRIM (Diversed SLIM) algorithm that performs unsupervised summarization, both generic and query-based, and does not require parameter tuning. We evaluate our summarizer on texts in English, but it can be easily extended to other languages.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"21 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114105950","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":"Web Page Recommendation from Sparse Big Web Data","authors":"C. Leung, Fan Jiang, Joglas Souza","doi":"10.1109/WI.2018.00-32","DOIUrl":"https://doi.org/10.1109/WI.2018.00-32","url":null,"abstract":"In many real-life web applications, web surfers would like to get recommendation on which collections of web pages that would be interested to them or that they should follow. In order to discover this information and make recommendation, data analytics—and specially, association rule mining or web data mining—is in demand. Since its introduction, association rule mining has drawn attention of many researchers. Consequently, many association rule mining algorithms have been proposed for finding interesting relationships—in the form of association rules—among frequently occurring patterns. For instance, in IEEE/WIC/ACM WI 2016 and 2017, serial and parallel algorithms were proposed to find interesting web pages. However, like most of the existing association rule mining algorithms, these two algorithms also were not designed for mining big data. Moreover, the search space of web pages can sparse in the sense that web pages are connected to a small subset of all web pages in the search space. In this paper, we present a compact bitwise representation for web pages in the search space. Such a representation can then be used with a bitwise serial or parallel association rule mining system for web mining and recommendation. Evaluation results show the effectiveness of our compression and the practicality of our algorithm—which discovers popular pages on the web, which in turn gives the web surfers recommendation of web pages that might be interested to them—in real-life web applications.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123643267","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}