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

筛选
英文 中文
Using Belief Change Principles for Evolving Bayesian Network Structures in Probabilistic Knowledge Representations 基于信念变化原理的概率知识表示贝叶斯网络结构演化
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0013
E. Jembere, S. S. Xulu
{"title":"Using Belief Change Principles for Evolving Bayesian Network Structures in Probabilistic Knowledge Representations","authors":"E. Jembere, S. S. Xulu","doi":"10.1109/WI.2016.0013","DOIUrl":"https://doi.org/10.1109/WI.2016.0013","url":null,"abstract":"Belief change in Probabilistic Graphical Models in general, and Bayesian Networks in particular, is often thought of as change in the model parameters when data consistent with the graphical model is observed. The assumption is the network structure for the graphical model is a true representation of the knowledge about the domain and therefore it does not change. In dynamic environments, this assumption is not always true. The network structure is bound to change in response to changes in the domain or correction of mistaken propositions. In such domains, the true Bayesian Network structure at any given point in time, and the events that provides an impetus for change in the network structure are unobservable and are not known with certainty. This paper presents, the Unified Belief Change Operator for Bayesian Networks (UBCOBaN). The UBCOBaN effects both belief revision and update on a given Bayesian network structure based on the data emitted from the domain modelled by the Bayesian Network. We present the conceptualization and implementation of the operator, and its evaluation based on synthetic data simulated from the Alarm Network. The operator was found to be more rational, with respect to the principle minimal change, than the classical search-and-score algorithm. The operator was also found to be faster in adapting to necessary changes than the classical search-and-score algorithm.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"27 1","pages":"9-17"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81000322","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
Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs 大型网络图中完美邻域集的自稳定计算
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0069
Yihua Ding, J. Wang, P. Srimani
{"title":"Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs","authors":"Yihua Ding, J. Wang, P. Srimani","doi":"10.1109/WI.2016.0069","DOIUrl":"https://doi.org/10.1109/WI.2016.0069","url":null,"abstract":"Given a graph G = (V, E), a node is called perfect (with respect to a set S ⊆ V) if its closed neighborhood contains exactly one node in set S, a node is called nearly perfect if it is not perfect but is adjacent to a perfect node. S is called a perfect neighborhood set if each node is either perfect or nearly perfect. We present the first self-stabilizing algorithm for computing a perfect neighborhood set in an arbitrary graph. This anonymous, constant space algorithm terminates in O(n2) steps using an unfair central daemon, where n is the number of nodes in the graph.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"2 1","pages":"435-438"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89987220","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
A Sparse Image Recommendation Model Using Content and User Preference Information 基于内容和用户偏好信息的稀疏图像推荐模型
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0041
Lei Liu
{"title":"A Sparse Image Recommendation Model Using Content and User Preference Information","authors":"Lei Liu","doi":"10.1109/WI.2016.0041","DOIUrl":"https://doi.org/10.1109/WI.2016.0041","url":null,"abstract":"With the incredibly growing amount of multimedia data uploaded and shared via the social media web sites, recommender systems have become an important necessity to ease users'burden on the information overload. In such a scenario, extensive amount of content information, such as tags, image content and user to item preferences are also available and extremely valuable for making effective recommendations. In this paper, we explore a novel topic model for image recommendation that jointly considers the problem of image content analysis with the users' preference on the basis of sparse representation. Our model is based on the classical probabilistic matrix factorization and can be easily extended to incorporate other useful information such as the social relationship. We evaluate our approach with a newly collected large scale social image data set from Flickr. The experimental results demonstrate that sparse topic modeling of the image content leads to more effective recommendations.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"5 1","pages":"232-239"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86766689","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
Adding Search Queries to Picture Lifelogs for Memory Retrieval 添加搜索查询的图片生活日志的记忆检索
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0123
Akira Kubota, T. Tominaga, Y. Hijikata, Nobuchika Sakata
{"title":"Adding Search Queries to Picture Lifelogs for Memory Retrieval","authors":"Akira Kubota, T. Tominaga, Y. Hijikata, Nobuchika Sakata","doi":"10.1109/WI.2016.0123","DOIUrl":"https://doi.org/10.1109/WI.2016.0123","url":null,"abstract":"A picture lifelog is a type of lifelog that consists of pictures, mainly taken by the user. Recently, users have been able to easily create picture lifelogs because many portable devices such as smart phones have a camera. When a user sees a picture in their picture lifelog, it is sometimes difficult to recall the events related to the picture. Therefore, we proposed to combine search queries on a picture lifelog in order to support memory retrieval. Search queries are input into a web search engine to satisfy a user's need for information. Recently, because of the prevalence of smart phones, the opportunity to input search queries has increased to anytime and anywhere. Search queries are stored in a cloud user database such as Google search history. In addition, those search queries imply what the user was thinking at the time. We investigated whether search queries enable a user to recall their thoughts regarding picture lifelogs. Thus, we conducted an experiment to ascertain whether search queries reminded a user of past events. As a result, we reveal that displaying a picture with search queries performed around the time it was taken tends to improve users' memories better than its time, location, or emails sent during that time.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"88 1","pages":"689-694"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85899459","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
Wikipedia Editing History in DBpedia: Extracting and Publishing the Encyclopedia Editing Activity as Linked Data DBpedia中的维基百科编辑历史:作为关联数据的百科全书编辑活动的提取和发布
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0079
Fabien L. Gandon, R. Boyer, O. Corby, Alexandre Monnin
{"title":"Wikipedia Editing History in DBpedia: Extracting and Publishing the Encyclopedia Editing Activity as Linked Data","authors":"Fabien L. Gandon, R. Boyer, O. Corby, Alexandre Monnin","doi":"10.1109/WI.2016.0079","DOIUrl":"https://doi.org/10.1109/WI.2016.0079","url":null,"abstract":"DBpedia is a huge dataset essentially extracted from the content and structure of Wikipedia. We present a new extraction producing a linked data representation of the editing history of Wikipedia pages. This supports custom querying and combining with other data providing new indicators and insights. We explain the architecture, representation and an immediate application to monitoring events.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"146 1","pages":"479-482"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86645739","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
Predicting Web User Click Intention Using Pupil Dilation and Electroencephalogram Analysis 利用瞳孔扩张和脑电图分析预测网络用户点击意图
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0065
Gino Slanzi, Jorge A. Balazs, J. D. Velásquez
{"title":"Predicting Web User Click Intention Using Pupil Dilation and Electroencephalogram Analysis","authors":"Gino Slanzi, Jorge A. Balazs, J. D. Velásquez","doi":"10.1109/WI.2016.0065","DOIUrl":"https://doi.org/10.1109/WI.2016.0065","url":null,"abstract":"In this work, a new approach for analysing the Web user behavior is introduced, consisting of a physiological-based click intention assessment, based on pupil dilation and electroencephalogram (EEG) responses evaluation. For this, an empirical study was conducted, where the mentioned responses of 21 subjects were recorded while performing diverse information foraging tasks from five real web sites. We found a statistical difference between click and not-click pupil dilation curves, more precisely, fixations corresponding to clicks had greater pupil size than fixations without clicks. In addition, seven classification models were applied, using 15 out 789 pupil dilation and EEG features obtained from a Random Lasso feature selection process. Results showed good performance for Accuracy (71,09% using Logistic Regression), whereas for Precision, Recall and F-Measure remained low, which indicates the behavior we were studying was not well classified. Despite the quality of these results, it is possible to mention that the reviewed responses could be used from a Web Intelligence perspective as a proxy of Web user behavior, for example, to generate an online recommender to improve websites structure or content. However, we concluded that better quality instruments are necessary to achieve higher results.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"33 1","pages":"417-420"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87530092","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
DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents 具有隐私的csp被重新定义为自利益主体的规划问题
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0057
Julien Savaux, Julien Vion, S. Piechowiak, R. Mandiau, T. Matsui, K. Hirayama, M. Yokoo, Shakre Elmane, M. Silaghi
{"title":"DisCSPs with Privacy Recast as Planning Problems for Self-Interested Agents","authors":"Julien Savaux, Julien Vion, S. Piechowiak, R. Mandiau, T. Matsui, K. Hirayama, M. Yokoo, Shakre Elmane, M. Silaghi","doi":"10.1109/WI.2016.0057","DOIUrl":"https://doi.org/10.1109/WI.2016.0057","url":null,"abstract":"Much of the Distributed Constraint Satisfaction Problem (DisCSP) solving research has addressed cooperating agents, and privacy was frequently mentioned as a significant motivation of the decentralization. While privacy may have a role for cooperating agents, it is easier understood in the context of self-interested utility-based agents, and this is the situation considered here. With utility-based agents, the DisCSP framework can be extended to model privacy and satisfaction under the concept of utility. We introduce Utilitarian Distributed Constraint Satisfaction Problems (UDisCSP), an extension of the DisCSP that exploits the rewards for finding a solution and the costs for losing privacy as guidance for the utility-based agents. A parallel can be drawn between Partially Observable Markov Decision Processes (POMDPs) and the problems solved by individual agents for UDisCSPs. Common DisCSP solvers are extended to take into account the utility function. In these extensions we assume that the planning problem is further restricting the set of communication actions to only the ones available in the corresponding solver protocols. The solvers obtained propose the action to be performed in each situation, defining thereby the policy of the agents.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"29 1","pages":"359-366"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86150314","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
Just-In-Time Recommendation Approach within a Mobile Context 移动环境下的即时推荐方法
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0112
Imen Akermi, M. Boughanem, R. Faiz
{"title":"Just-In-Time Recommendation Approach within a Mobile Context","authors":"Imen Akermi, M. Boughanem, R. Faiz","doi":"10.1109/WI.2016.0112","DOIUrl":"https://doi.org/10.1109/WI.2016.0112","url":null,"abstract":"Just-In-Time Recommender Systems involve all systems able to provide recommendations tailored to the preferences and needs of users in order to help them access useful and interesting resources within a large data space. The user does not need to formulate a query, this latter is implicit and corresponds to the resources that match the user's interests at the right time. In this paper, we propose a proactive context-aware recommendation approach for mobile devices that covers many domains. It aims at recommending relevant items that match users' personal interests at the right time without waiting for users to initiate any interaction.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"58 1","pages":"636-639"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91338741","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
Modeling User Expectations & Satisfaction for SaaS Applications Using Multi-agent Negotiation 使用多代理协商对SaaS应用程序的用户期望和满意度建模
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0062
A. Najjar, C. Gravier, Xavier Serpaggi, O. Boissier
{"title":"Modeling User Expectations & Satisfaction for SaaS Applications Using Multi-agent Negotiation","authors":"A. Najjar, C. Gravier, Xavier Serpaggi, O. Boissier","doi":"10.1109/WI.2016.0062","DOIUrl":"https://doi.org/10.1109/WI.2016.0062","url":null,"abstract":"As more personal and interactive applications are moving to the cloud, modeling the end-user expectations and satisfaction is becoming necessary for any SaaS provider to survive and thrive in today's competitive market. However, most of existing works addressing cloud elasticity management adopt a centralized approach where user preferences are mostly overlooked. Based on evidence from the fields of customer expectation management and psychophysics, in this article we propose a personal user model to represent end-user satisfaction and her expectations. To integrate the end-user into the decision loop we develop multi-agent negotiation architecture in which the end-user model is embodied by a personal agent who negotiates on her behalf. The results of the evaluation process show that automated negotiation provides a useful platform to empower the user choices, fulfill her expectations, and maximize her satisfaction hereby outperforming centralized approaches where the provider acts in a unilateral manner.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"61 1","pages":"399-406"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73595369","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}
引用次数: 16
Web Page Recommendation Based on Bitwise Frequent Pattern Mining 基于位频繁模式挖掘的网页推荐
2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI) Pub Date : 2016-10-01 DOI: 10.1109/WI.2016.0111
Fan Jiang, C. Leung, Adam G. M. Pazdor
{"title":"Web Page Recommendation Based on Bitwise Frequent Pattern Mining","authors":"Fan Jiang, C. Leung, Adam G. M. Pazdor","doi":"10.1109/WI.2016.0111","DOIUrl":"https://doi.org/10.1109/WI.2016.0111","url":null,"abstract":"In many 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 mining in general—or frequent pattern mining in specific—can be applicable. Since its introduction, frequent pattern mining has drawn attention from many researchers. Consequently, many frequent pattern mining algorithms have been proposed, which include levelwise Apriori-based algorithms, tree-based algorithms, hyperlinked array structure based algorithms, as well as vertical mining algorithms. While these algorithms are popular, they also suffer from some drawbacks. To avoid these drawbacks, we propose an alternative frequent pattern mining algorithm called BW-mine in this paper. Evaluation results show that our proposed algorithm is both space-and time-efficient. Furthermore, to show the practicality of BW-mine in real-life applications, we apply BW-mine to discover popular pages on the web, which in turn gives the web surfers recommendation of web pages that might be interested to them.","PeriodicalId":6513,"journal":{"name":"2016 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"8 1","pages":"632-635"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76468248","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}
引用次数: 17
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学术官方微信