{"title":"Analyzing the performance of multiple agents with varying bidding behaviors and standard bidders in online auctions","authors":"Jacob Sow, P. Anthony, Chong Mun Ho","doi":"10.3233/WIA-130270","DOIUrl":"https://doi.org/10.3233/WIA-130270","url":null,"abstract":"Online auctions have provided an alternative trading method to exchange items without the geographical and time constraints. However, buyers would face difficulties in searching, monitoring, and selecting an auction to participate in. As a consequence, agent technology is introduced to overcome these pitfalls. In this paper, heterogeneous intelligent agents and heterogeneous standard bidders are generated in a simulated auction market and their performances are measured. By doing so, it would further simulate the real online auction marketplace where bidders may have different bidding behaviors or implement different bidder agents. From the simulated results, the average winner's utility, the average number of winning auctions, the average closing price and the average median consumer surplus ratio are used to evaluate the winners' performances. From the results obtained, it is generalized that by using intelligent bidder agents to participate in online auctions, it benefits the bidders. Besides that, market economy is reviewed based on the results obtained.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115395456","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":"Investigating query bursts in a web search engine","authors":"Ilija Subasic, C. Castillo","doi":"10.3233/WIA-130265","DOIUrl":"https://doi.org/10.3233/WIA-130265","url":null,"abstract":"The Internet has become for many the most important medium for staying informed about current news events. Some events cause heightened interest on a topic, which in turn yields a higher frequency of the search queries related to it. These queries are going through a “query burst”. In this paper we examine the behavior of search engine users during a query burst, compared to before and after the burst. We are interested in how this behavior changes, and how it affects other stake-holders in web search.We analyze one year of web-search and news-search logs, looking at query bursts from multiple perspectives. First, we adopt the perspective of search engine users, describing changes in their effort and interest while searching. Second, we adopt the perspective of news providers by comparing web search and news search query bursts. Third, we look at the burst from the perspective of content providers.We study the conditions under which content providers can “ride” a wave of increased interest on a topic, and obtain a share of the user's increased attention. We do so by identifying the class of queries that can be considered as an opportunity for content providers that are “late-comers” for a query, in the sense of not being among the first to write about its topic. We also present a simple model for predicting the click share content providers could obtain if they decide to provide content about these queries.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"89 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132418668","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":"Predicting community preference of comments on the Social Web","authors":"Chiao-Fang Hsu, James Caverlee, Elham Khabiri","doi":"10.3233/WIA-2012-0256","DOIUrl":"https://doi.org/10.3233/WIA-2012-0256","url":null,"abstract":"Large-scale socially-generated metadata --like user-contributed tags, comments, and ratings --is one of the key features driving the growth and success of the emerging Social Web. While tags and ratings provide succinct metadata about Social Web content e.g., a tag is often a single keyword, user-contributed comments offer the promise of a rich source of contextual information about Social Web content but in a potentially “messier” form, considering the wide variability in quality, style, and substance of comments generated by a legion of Social Web participants. In this paper, we study how an online community perceives the relative quality of its own user-contributed comments, which has important implications for the successful self-regulation and growth of the Social Web in the presence of increasing spam and a flood of Social Web metadata. Concretely, we propose and evaluate a machine learning-based approach for ranking comments on the Social Web based on the community's expressed preferences, which can be used to promote high-quality comments and filter out low-quality comments. We study several factors impacting community preference, including the contributor's reputation and community activity level, as well as the complexity and richness of the comment. Through experiments over three social news platforms Digg, Reddit, and the New York Times, we find that the proposed approach results in significant improvement in ranking quality versus alternative approaches.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"50 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131475112","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}
Mohamad El Falou, M. Bouzid, A. Mouaddib, Thierry Vidal
{"title":"A distributed multi-agent planning approach for automated web services composition","authors":"Mohamad El Falou, M. Bouzid, A. Mouaddib, Thierry Vidal","doi":"10.3233/WIA-2012-0255","DOIUrl":"https://doi.org/10.3233/WIA-2012-0255","url":null,"abstract":"The ability to automatically answer a request that requires the composition of a set of web services has received much interest in the last decade, as it supports B2B applications. It aims at selecting and inter-connecting services provided by different partners in response to client requests. Planning techniques are used widely in the literature to describe web services composition problem. However, since web services proliferate day after day, classical planners are no longer well suited to compose web services in a reasonable time. This weakness is due to the explosion of the search space caused by the large number of services and the broad range of data exchanged among services. Therefore it is more interesting to use a decentralized planner to distribute the search space and the computing load taking into account the distributed nature of the problem. In this paper, we propose a distributed multi-agent approach to solving the web services composition problem at runtime. Our approach consists of a set of web services agents where each agent has a set of services organised in a graph. To respond to a request, agents propose their best local partial plans which are partial paths in the graph. They then coordinate their partial plans to provide the best global plan for the submitted request. The analysis of the complexity and the results of the implementation show the ability of our approach to scaling up when compared to the state-of-the-art techniques for automated web services composition.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"37 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134427681","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":"Minimization of decoy effects in recommender result sets","authors":"E. Teppan, A. Felfernig","doi":"10.3233/WIA-2012-0253","DOIUrl":"https://doi.org/10.3233/WIA-2012-0253","url":null,"abstract":"Recommender systems are common web applications which support users in finding suitable products in large and/or complex product domains. Although state-of-the-art systems manage to accomplish the task of finding and presenting suitable products they show big deficits in their models of human behavior. Time limitations, cognitive capacities and willingness to cognitive effort bound rational decision making which can lead to unforeseen side effects and consequently to sub-optimal decisions. Decoy effects are cognitive phenomena which are omni-present on result pages but state-of-the-art recommender systems are completely unaware of such effects. Due to the fact that such effects constitute one source of irrational decisions their identification and, if necessary, the neutralization of their biasing potential is extremely important. This paper introduces an approach for identifying and minimizing decoy effects on recommender result pages. To support the suggested approach we present the results of a corresponding user study which clearly proves the concept. Moreover, this paper also investigates whether the decreasing impact of decoys on uncertainty levels during decision making is affected by the decoy minimization approach.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128755343","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":"Learning web-service task descriptions from traces","authors":"Thomas J. Walsh, M. Littman, Alexander Borgida","doi":"10.3233/WIA-2012-0254","DOIUrl":"https://doi.org/10.3233/WIA-2012-0254","url":null,"abstract":"This paper considers the problem of learning task specific web-service descriptions from traces of users successfully completing a task. Unlike prior approaches, we take a traditional machine-learning perspective to the construction of web-service models from data. Our representation models both syntactic features of web-service schemas including lists and optional elements, as well as semantic relations between objects in the task. Together, these learned models form a full schematic model of the dataflow. Our theoretical results, which are the main novelty in the paper, show that this structure can be learned efficiently: the number of traces required for learning grows polynomially with the size of the task. We also present real-world task descriptions mined from tasks using online services from Amazon and Google.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134141770","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 approach to deriving a virtual thematic folksonomy based system from a social inter-folksonomy based scenario","authors":"Antonino Nocera, D. Ursino","doi":"10.3233/WIA-2012-0252","DOIUrl":"https://doi.org/10.3233/WIA-2012-0252","url":null,"abstract":"The diffusion of social networks has stimulated folksonomy-based systems hereafter, folk-systems to equip themselves with functionalities for the management of social relationships among users. This suggests that folk-systems and social networks have many “points of contact”. At the same time, social networks are evolving toward social internetworking systems, i.e. systems where several social networks are simultaneously considered and where users are allowed to interact with each other, even if they belong to different social networks. This trend, presumably, could extend to folk-systems. In this paper, we investigate this issue. In particular, first we introduce the concept of social inter-folksonomy based systems hereafter, SIFS; after this, we introduce a hypergraph-based model to represent and handle a SIFS. Finally, we present an approach for the derivation of a virtual thematic folk-system from a SIFS, i.e. a fragment of SIFS centered on one or more topics which has all the properties and the functionalities of a real folk-system.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121695168","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":"Modeling agents with a theory of mind: Theory-theory versus simulation theory","authors":"M. Harbers, K. Bosch, J. Meyer","doi":"10.3233/WIA-2012-0250","DOIUrl":"https://doi.org/10.3233/WIA-2012-0250","url":null,"abstract":"Virtual training systems with intelligent agents provide an effective means to train people for complex, dynamic tasks like crisis management or firefighting. For successful training, intelligent virtual agents should be able to show believable behavior, adapt their behavior to the trainee's performance and give useful explanations about their behavior. Agents can provide more believable behavior and explanations if they, besides their own, take the assumed knowledge and intentions of other players in the scenario into account. This paper proposes two ways to model agents with a theory of mind, i.e. equip them with the ability to ascribe mental concepts such as knowledge and intentions to others. The first theory of mind model is based on theory--theory TT and the second on simulation theory ST. In a simulation study, agents with no theory of mind, a TT-based theory of mind, and an ST-based theory of mind are compared. The results show that agents with a theory of mind are preferred over agents with no theory of mind, and that, regarding agent development, the ST model has advantages over the TT model.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126202693","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":"Personalized recommender systems integrating tags and item taxonomy","authors":"Huizhi Liang, Yue Xu, Yuefeng Li","doi":"10.3233/WIA-2012-0246","DOIUrl":"https://doi.org/10.3233/WIA-2012-0246","url":null,"abstract":"The social tags in Web 2.0 are becoming another important information source to profile users' interests and preferences to make personalized recommendations. To solve the problem of low information sharing caused by the free-style vocabulary of tags and the long tails of the distribution of tags and items, this paper proposes an approach to integrate the social tags given by users and the item taxonomy with standard vocabulary and hierarchical structure provided by experts to make personalized recommendations. The experimental results show that the proposed approach can effectively improve the information sharing and recommendation accuracy.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115757919","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":"Bricking Semantic Wikipedia by relation population and predicate suggestion","authors":"Haofen Wang, L. Fu, Yong Yu","doi":"10.3233/WIA-2012-0249","DOIUrl":"https://doi.org/10.3233/WIA-2012-0249","url":null,"abstract":"Semantic Wikipedia aims to enhance Wikipedia by adding explicit semantics to links between Wikipedia entities. However, we have observed that it currently suffers the following limitations: lack of semantic annotations and lack of semantic annotators. In this paper, we resort to relation population to automatically extract relations between any entity pair to enrich semantic data, and predicate suggestion to recommend proper relation labels to facilitate semantic annotating. Both tasks leverage relation classification which tries to classify extracted relation instances into predefined relations. However, due to the lack of labeled data and the excessiveness of noise in Semantic Wikipedia, existing approaches cannot be directly applied to these tasks to obtain high-quality annotations. In this paper, to tackle the above problems brought by Semantic Wikipedia, we use a label propagation algorithm and exploit semantic features like domain and range constraints on categories as well as linguistic features such as dependency trees of context sentences in Wikipedia articles. The experimental results on 7 typical relation types show the effectiveness and efficiency of our approach in dealing with both tasks.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131359612","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}