Extracting important relations between biological components and semantic events involving genes or proteins from literature has become a focus for the biomedical text mining community. In this paper, we review a subgraph matching-based approach proposed in our previous work for mining relations and events in the biomedical literature. Our subgraph matching algorithm is formally presented, along with a detailed analysis of its complexity. We present three different relation/event extraction tasks in which our approach has been successfully applied. Our approach is of considerable value in extracting highly precise, binary relations when appropriate training data is available.

One common use for swarming agents is in social simulation. This paper reports on such a model developed to track protest activities at the May 2012 NATO summit in Chicago. The use of apoptotic stigmergic agents allows the model to run on-line, consuming two kinds of external data and reporting its results in real time.

Causality discovery has been one of the core tasks in scientific research since the beginning of human scientific history. In the age of data tsunami, the causality discovery task involves identification of causality among millions of variables which cannot be done manually by humans. However, the identification of causality relationships using artificial intelligence and statistical techniques in non-experimental settings faces several challenges. In this work, we address three of the challenges regarding Granger causality, one of the most popular causality inference techniques. First, we analyze the consistency of two most popular Granger causality techniques and show that the significance test is not consistent in high dimensions. Second, we review our nonparametric generalization of the Lasso-Granger technique called Generalized Lasso Granger (GLG) to uncover Granger causality relationships among irregularly sampled time series. Finally, we describe two techniques to uncover the casual dependence in non-linear datasets. Extensive experiments are provided to show the significant advantages of the proposed algorithms over their state-of-the-art counterparts.

Artificial Intelligence researchers have long sought to understand and replicate processes of scientific discovery. This article discusses Discovery Informatics as an emerging area of research that builds on that tradition and applies principles of intelligent computing and information systems to understand, automate, improve, and innovate processes of scientific discovery.

Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of Statistical Relational Learning (SRL) algorithms to these domains. In this article, we examine and categorize techniques for transforming graph-based relational data to improve SRL algorithms. In particular, appropriate transformations of the nodes, links, and/or features of the data can dramatically affect the capabilities and results of SRL algorithms. We introduce an intuitive taxonomy for data representation transformations in relational domains that incorporates link transformation and node transformation as symmetric representation tasks. More specifically, the transformation tasks for both nodes and links include (i) predicting their existence, (ii) predicting their label or type, (iii) estimating their weight or importance, and (iv) systematically constructing their relevant features. We motivate our taxonomy through detailed examples and use it to survey competing approaches for each of these tasks. We also discuss general conditions for transforming links, nodes, and features. Finally, we highlight challenges that remain to be addressed.

Dual decomposition, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language processing (NLP). This tutorial gives an overview of the technique. We describe example algorithms, describe formal guarantees for the method, and describe practical issues in implementing the algorithms. While our examples are predominantly drawn from the NLP literature, the material should be of general relevance to inference problems in machine learning. A central theme of this tutorial is that Lagrangian relaxation is naturally applied in conjunction with a broad class of combinatorial algorithms, allowing inference in models that go significantly beyond previous work on Lagrangian relaxation for inference in graphical models.

Ten Years of AAMAS: Introduction to the Special Issue

Distributed problem solving is a subfield within multiagent systems, where agents are assumed to be part of a team and collaborate with each other to reach a common goal. In this article, we illustrate the motivations for distributed problem solving and provide an overview of two distributed problem solving models, namely distributed constraint satisfaction problems (DCSPs) and distributed constraint optimization problems (DCOPs), and some of their algorithms.

Multiagent systems (MAS) are widely accepted as an important method for solving problems of a distributed nature. A key to the success of MAS is efficient and effective multiagent learning (MAL). The past twenty-five years have seen a great interest and tremendous progress in the field of MAL. This article introduces and overviews this field by presenting its fundamentals, sketching its historical development and describing some key algorithms for MAL. Moreover, main challenges that the field is facing today are indentified.

In 2011 the Autonomous Agents and Multiagent Systems (AAMAS) conference series celebrated its 10th anniversary, having begun as the successful merger of three related events that had run for some years previously.