Zohar Komarovsky, V. Levit, Tal Grinshpoun, A. Meisels
{"title":"Efficient Equilibria in a Public Goods Game","authors":"Zohar Komarovsky, V. Levit, Tal Grinshpoun, A. Meisels","doi":"10.1109/WI-IAT.2015.91","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.91","url":null,"abstract":"The \"best-shot\" public goods game is a network game, defined on a social network. As in most strategic games, it contains a structured tradeoff between stability and efficiency. The present study considers a multi-agent system, in which each agent represents a player in the \"best-shot\" game. It is demonstrated that any Pure-strategy Nash Equilibrium (PNE) of the \"best-shot\" game is Pareto efficient and that best-response dynamics converge into a PNE within a linear number of steps. It is also shown that the game is a potential game. The potential function can be utilized for the search of PNEs with certain social properties. In order to improve efficiency beyond the limited set of stable states, a mechanism of side payments is proposed. We prove that by using side payments an outcome that maximizes social welfare can be stabilized. A distributed protocol based on asymmetric distributed constraints optimization, which enables the search for efficient outcomes, is proposed. Finally, an extensive experimental evaluation compares the actual social welfare in outcomes achieved by different search paradigms for common social networks structures.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116789676","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":"LAIM: Life Aspect Inference Method Based on Probability Distribution for Real Life Tweets","authors":"Shuhei Yamamoto, N. Kando, T. Satoh","doi":"10.1109/WI-IAT.2015.124","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.124","url":null,"abstract":"Many people share their daily events and opinions on Twitter. Some tweets are beneficial and others are related to such aspects of a user's real life as eating, traffic conditions, weather, and so on. In this paper, we propose an inference method of the real life aspect distribution of tweets using a labeled tweets. Our method infers the aspect probability distributions by a hierarchical estimation framework (HEF), which is hierarchically composed of both unsupervised and supervised machine learning methods. In the first phase, it extracts topics from a sea of tweets using Latent Dirichlet Allocation (LDA). In the second phase, it builds associations between topics and real life aspects using a small set of labeled tweets. The probability distribution of aspects is inferred using the associations based on the bag of terms extracted from unknown tweets. Our sophisticated experimental evaluations with a large amount of actual tweets demonstrate the high efficiency and robustness of our inference method. Especially in the case of single label training, HEF showed significantly-lower JSD values than other baseline methods, such as Naive Bayes, SVM, and L-LDA.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125938455","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}
Yan Li, Xuemei Hu, Yulin Zhang, Abdul-Wahid Mohammed, Yang Xu
{"title":"IOCD-Based Semantic Enablement for Service-Oriented M2M Architecture","authors":"Yan Li, Xuemei Hu, Yulin Zhang, Abdul-Wahid Mohammed, Yang Xu","doi":"10.1109/WI-IAT.2015.119","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.119","url":null,"abstract":"To build a simple picture of M2M communication under service-oriented M2M architecture, a key innovation underlines the enablement of M2M device abstraction and semantics support. However, state of the art structures of M2M devices/software lack common M2M Service Layer for interoperability. Devices/software rely heavily on specific API implementation-oriented data services and the data definition of their own. In this paper, we propose a generic M2M design pattern called IOCD by referring to the SSO pattern used in Semantic Sensor Network ontology to enable interoperability among M2M devices and their services. This briefly abstracts and describes machines from four key properties: input (I), output (O), capability (C) and deployment (D). Based on the design pattern, we extend these four properties to build our IOCD design model. To enable IOCD semantic support, we build our M2M semantic server under oneM2M architecture, and extend the oneM2M Generic semantic functional model. The M2M semantic server retrieves data from the oneM2M platform, and semantically annotates and reasons on the data according to IOCD design model.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125492847","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 Distinguishing between Reliable and Unreliable Sensors Without a Knowledge of the Ground Truth","authors":"A. Yazidi, B. Oommen, M. G. Olsen","doi":"10.1109/WI-IAT.2015.237","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.237","url":null,"abstract":"In many applications, data from different sensors are aggregated in order to obtain more reliable information about the process that the sensors are monitoring. However, the quality of the aggregated information is intricately dependent on the reliability of the individual sensors. In fact, unreliable sensors will tend to report erroneous values of the ground truth, and thus degrade the quality of the fused information. Finding strategies to identify unreliable sensors can assist in having a counter-effect on their respective detrimental influences on the fusion process, and this has has been a focal concern in the literature. The purpose of this paper is to propose a solution to an extremely pertinent problem, namely, that of identifying which sensors are unreliable without any knowledge of the ground truth. This fascinating paradox can be formulated in simple terms as trying to identify stochastic liars without any additional information about the truth. Though apparently impossible, we will show that it is feasible to solve the problem, a claim that is counter-intuitive in and of itself. To the best of our knowledge, this is the first reported solution to the aforementioned paradox. Legacy work and the reported literature have merely addressed assessing the reliability of a sensor by comparing its reading to the ground truth either in an online or an offline manner. The informed reader will observe that the so-called Weighted Majority Algorithm is a representative example of a large class of such legacy algorithms. The essence of our approach involves studying the agreement of each sensor with the rest of the sensors, and not comparing the reading of the individual sensors with the ground truth -- as advocated in the literature. Under some mild conditions on the reliability of the sensors, we can prove that we can, indeed, filter out the unreliable ones. Our approach leverages the power of the theory of Learning Automata (LA) so as to gradually learn the identity of the reliable and unreliable sensors. To achieve this, we resort to a team of LA, where a distinct automaton is associated with each sensor. The solution provided here has been subjected to rigorous experimental tests, and the results presented are, in our opinion, both novel and conclusive.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125537375","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":"Exposing the Underlying Schema of LOD Sources","authors":"Fabio Benedetti, S. Bergamaschi, Laura Po","doi":"10.1109/WI-IAT.2015.99","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.99","url":null,"abstract":"The Linked Data Principles defined by Tim-Berners Lee promise that a large portion of Web Data will be usable as one big interlinked RDF database. Today, with more than one thousand of Linked Open Data (LOD) sources available on the Web, we are assisting to an emerging trend in publication and consumption of LOD datasets. However, the pervasive use of external resources together with a deficiency in the definition of the internal structure of a dataset causes many LOD sources are extremely complex to understand. In this paper, we describe a formal method to unveil the implicit structure of a LOD dataset by building a (Clustered) Schema Summary. The Schema Summary contains all the main classes and properties used within the datasets, whether they are taken from external vocabularies or not, and is conceivable as an RDFS ontology. The Clustered Schema Summary, suitable for large LOD datasets, provides a more high level view of the classes and the properties used by gathering together classes that are object of multiple instantiations.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129850474","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":"Fast Reinforcement Learning under Uncertainties with Self-Organizing Neural Networks","authors":"Teck-Hou Teng, A. Tan","doi":"10.1109/WI-IAT.2015.103","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.103","url":null,"abstract":"Using feedback signals from the environment, a reinforcement learning (RL) system typically discovers action policies that recommend actions effective to the states based on a Q-value function. However, uncertainties over the estimation of the Q-values can delay the convergence of RL. For fast RL convergence by accounting for such uncertainties, this paper proposes several enhancements to the estimation and learning of the Q-value using a self-organizing neural network. Specifically, a temporal difference method known as Q-learning is complemented by a Q-value Polarization procedure, which contrasts the Q-values using feedback signals on the effect of the recommended actions. The polarized Q-values are then learned by the self-organizing neural network using a Bi-directional Template Learning procedure. Furthermore, the polarized Q-values are in turn used to adapt the reward vigilance of the ART-based self-organizing neural network using a Bi-directional Adaptation procedure. The efficacy of the resultant system called Fast Learning (FL) FALCON is illustrated using two single-task problem domains with large MDPs. The experiment results from these problem domains unanimously show FL-FALCON converging faster than the compared approaches.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130308070","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 Pheromone-Like Model for Semantic Context Extraction from Collaborative Networks","authors":"Valentina Franzoni, A. Milani","doi":"10.1109/WI-IAT.2015.21","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.21","url":null,"abstract":"The extraction of semantic contexts is a relevant issue in information retrieval to provide high quality query results. This paper introduces the semantic context underlying a set of given input concepts as defined by the relevant multiple explanation paths connecting the input concepts in a collaborative network. A pheromone-like model based on this approach is introduced for the detection and the extraction of multiple paths of explanation between seed concepts. The exploration of the online collaborative network of explanation uses a heuristic driven random walk, based on semantic proximity measures. Random walks distribute pheromone on the traversed arcs used to evaluate the relevance of concepts in the multiple explanatory paths to be extracted. Experimental results obtained on accepted datasets and contexts extracted from the Wikipedia collaborative network show that the proposed algorithm can extract contexts with high relevance degree, which outperforms other methods. The approach has a general applicability and can be extended to other explanation-based online collaborative networks.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131373344","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":"Probabilistic Classification Using Data Mining","authors":"Yuichiro Kase, T. Miura","doi":"10.1109/WI-IAT.2015.169","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.169","url":null,"abstract":"In this investigation we discuss a multi-label classification problem where documents may have several labels. We put our focus on dependencies among labels in a probabilistic manner, and we extract characteristic features in a form of probabilistic distribution functions by data mining techniques. We show some experimental results, i.e., dependencies among items/labels to see the effectiveness of the approach.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131248177","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 Agent Based Encapsulator System: For Integrating and Composing Legacy System Functionalities","authors":"H. Faycal, Mellah Hakima, D. Habiba","doi":"10.1109/WI-IAT.2015.41","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.41","url":null,"abstract":"Nowadays, Service-Oriented Architectures (SOA) represents the means of Information Technologies (IT) which contribute to the agility of enterprise information systems (IS). Their principle main is to present the applications functionalities as services aligned with the company business. This presentation is promising in the sense that it tends to reduce the costs of integration, to give more importance to the reuse of information system functionalities in different business processes and, of course, to facilitate its adaptation to the unforeseen changes during the life cycle of information system. In this work, we present an approach based on multi-agent systems (MAS) for encapsulating and publishing Legacy system functionalities as web services in the goal to facilitate their integration on a SOA-based Information system. We have on a second part proposed a set of composition templates for composing legacy functionalities.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127863681","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":"Reasoning with Trust and Uncertainty Illustration in the Internet of Things","authors":"Ravi Mondi, Y. Demazeau, F. Ramparany","doi":"10.1109/WI-IAT.2015.174","DOIUrl":"https://doi.org/10.1109/WI-IAT.2015.174","url":null,"abstract":"Trust and uncertainty are important aspects of many distributed systems. Managing them together forms a complex problem, even more in the domain of the Internet of Things (IoT), where having multiple sources of information is very common. The devices of the IoT face two-fold problems of managing trust on sources and the presence of uncertainty in the information. We propose a solution to these problems. Our solution approach involves modeling applications of the IoT as intelligent agents that comprise a trust management module, an inference engine and an enhanced Assumption-based Truth Maintenance System (ATMS) to manage trust of the information sources and uncertainty of the inferred information. We validate our approach using empirical data obtained from simulations.","PeriodicalId":415414,"journal":{"name":"2015 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129636004","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}