Plotting

 Information Technology


Artificial Intelligence on Mobile Devices: An Introduction to the Special Issue

AI Magazine

We will see more and more applications of AI on the mobile devices. This special issue of AI Magazine is devoted to some exemplary works of AI on mobile devices. We include four works that range from mobile activity recognition and air-quality detection to machine translation and image compression. These works were chosen from a variety of sources, including the International Joint Conference on Artificial Intelligence 2011 Special Track on Integrated and Embedded AI Systems, held in Barcelona, Spain, in July 2011.


AAAI News

AI Magazine

Participation will be open to active no later than Friday, June 19, 2013 finally, two years as immediate Past participants as well as other interested (5:00 PM local hotel time (PDT)).


Distributed Online Big Data Classification Using Context Information

arXiv.org Machine Learning

Distributed, online data mining systems have emerged as a result of applications requiring analysis of large amounts of correlated and high-dimensional data produced by multiple distributed data sources. We propose a distributed online data classification framework where data is gathered by distributed data sources and processed by a heterogeneous set of distributed learners which learn online, at run-time, how to classify the different data streams either by using their locally available classification functions or by helping each other by classifying each other's data. Importantly, since the data is gathered at different locations, sending the data to another learner to process incurs additional costs such as delays, and hence this will be only beneficial if the benefits obtained from a better classification will exceed the costs. We model the problem of joint classification by the distributed and heterogeneous learners from multiple data sources as a distributed contextual bandit problem where each data is characterized by a specific context. We develop a distributed online learning algorithm for which we can prove sublinear regret. Compared to prior work in distributed online data mining, our work is the first to provide analytic regret results characterizing the performance of the proposed algorithm.


Metaheuristics in Flood Disaster Management and Risk Assessment

arXiv.org Artificial Intelligence

A conceptual area is divided into units or barangays, each was allowed to evolve under a physical constraint. A risk assessment method was then used to identify the flood risk in each community using the following risk factors: the area's urbanized area ratio, literacy rate, mortality rate, poverty incidence, radio/TV penetration, and state of structural and non-structural measures. Vulnerability is defined as a weighted-sum of these components. A penalty was imposed for reduced vulnerability. Optimization comparison was done with MatLab's Genetic Algorithms and Simulated Annealing; results showed 'extreme' solutions and realistic designs, for simulated annealing and genetic algorithm, respectively.


Safeguarding E-Commerce against Advisor Cheating Behaviors: Towards More Robust Trust Models for Handling Unfair Ratings

arXiv.org Artificial Intelligence

In electronic marketplaces, after each transaction buyers will rate the products provided by the sellers. To decide the most trustworthy sellers to transact with, buyers rely on trust models to leverage these ratings to evaluate the reputation of sellers. Although the high effectiveness of different trust models for handling unfair ratings have been claimed by their designers, recently it is argued that these models are vulnerable to more intelligent attacks, and there is an urgent demand that the robustness of the existing trust models has to be evaluated in a more comprehensive way. In this work, we classify the existing trust models into two broad categories and propose an extendable e-marketplace testbed to evaluate their robustness against different unfair rating attacks comprehensively. On top of highlighting the robustness of the existing trust models for handling unfair ratings is far from what they were claimed to be, we further propose and validate a novel combination mechanism for the existing trust models, Discount-then-Filter, to notably enhance their robustness against the investigated attacks.


Hacking Smart Machines with Smarter Ones: How to Extract Meaningful Data from Machine Learning Classifiers

arXiv.org Machine Learning

Machine Learning (ML) algorithms are used to train computers to perform a variety of complex tasks and improve with experience. Computers learn how to recognize patterns, make unintended decisions, or react to a dynamic environment. Certain trained machines may be more effective than others because they are based on more suitable ML algorithms or because they were trained through superior training sets. Although ML algorithms are known and publicly released, training sets may not be reasonably ascertainable and, indeed, may be guarded as trade secrets. While much research has been performed about the privacy of the elements of training sets, in this paper we focus our attention on ML classifiers and on the statistical information that can be unconsciously or maliciously revealed from them. We show that it is possible to infer unexpected but useful information from ML classifiers. In particular, we build a novel meta-classifier and train it to hack other classifiers, obtaining meaningful information about their training sets. This kind of information leakage can be exploited, for example, by a vendor to build more effective classifiers or to simply acquire trade secrets from a competitor's apparatus, potentially violating its intellectual property rights.


h-approximation: History-Based Approximation of Possible World Semantics as ASP

arXiv.org Artificial Intelligence

We propose an approximation of the Possible Worlds Semantics (PWS) for action planning. A corresponding planning system is implemented by a transformation of the action specification to an Answer-Set Program. A novelty is support for postdiction wrt. (a) the plan existence problem in our framework can be solved in NP, as compared to $\Sigma_2^P$ for non-approximated PWS of Baral(2000); and (b) the planner generates optimal plans wrt. a minimal number of actions in $\Delta_2^P$. We demo the planning system with standard problems, and illustrate its integration in a larger software framework for robot control in a smart home.


Dynamic Infinite Mixed-Membership Stochastic Blockmodel

arXiv.org Machine Learning

Directional and pairwise measurements are often used to model inter-relationships in a social network setting. The Mixed-Membership Stochastic Blockmodel (MMSB) was a seminal work in this area, and many of its capabilities were extended since then. In this paper, we propose the \emph{Dynamic Infinite Mixed-Membership stochastic blockModel (DIM3)}, a generalised framework that extends the existing work to a potentially infinite number of communities and mixture memberships for each of the network's nodes. This model is in a dynamic setting, where additional model parameters are introduced to reflect the degree of persistence between one's memberships at consecutive times. Accordingly, two effective posterior sampling strategies and their results are presented using both synthetic and real data.


A Constraint-Based Approach for Proactive, Context-Aware Human Support

AAAI Conferences

In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.


A Constraint-Based Approach for Proactive, Context-Aware Human Support

AAAI Conferences

In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.