Quantum theory has recently been employed to further advance thetheory of information retrieval (IR). A challenging research topicis to investigate the so called quantum-like interference in users'relevance judgment process, where users are involved to judge therelevance degree of each document with respect to a given query. Inthis process, users' relevance judgment for the current document isoften interfered by the judgment for previous documents, due to theinterference on users' cognitive status. Research from cognitivescience has demonstrated some initial evidence of quantum-likecognitive interference in human decision making, which underpins theuser's relevance judgment process. This motivates us to model suchcognitive interference in the relevance judgment process, which inour belief will lead to a better modeling and explanation of userbehaviors in relevance judgement process for IR and eventually leadto more user-centric IR models. In this paper, we propose to useprobabilistic automaton (PA) and quantum finite automaton (QFA),which are suitable to represent the transition of user judgmentstates, to dynamically model the cognitive interference when theuser is judging a list of documents.

A key concept in many Information Retrieval (IR) tasks, e.g. document indexing, query language modelling, aspect and diversity retrieval, is the relevance measurement of topics, i.e. to what extent an information object (e.g. a document or a query) is about the topics. This paper investigates the interference of relevance measurement of a topic caused by another topic. For example, consider that two user groups are required to judge whether a topic q is relevant to a document d, and q is presented together with another topic (referred to as a companion topic). If different companion topics are used for different groups, interestingly different relevance probabilities of q given d can be reached. In this paper, we present empirical results showing that the relevance of a topic to a document is greatly affected by the companion topic’s relevance to the same document, and the extent of the impact differs with respect to different companion topics. We further analyse the phenomenon from classical and quantum-like interference perspectives, and connect the phenomenon to nonreality and contextuality in quantum mechanics. We demonstrate that quantum like model fits in the empirical data, could be potentially used for predicting the relevance when interference exists.

In computational linguistics, information retrieval and applied cognition, words and concepts are often represented as vectors in high dimensional spaces computed from a corpus of text. These high dimensional spaces are often referred to as Semantic Spaces. We describe a novel and efficient approach to computing these semantic spaces via the use of complex valued vector representations. We report on the practical implementation of the proposed method and some associated experiments. We also briefly discuss how the proposed system relates to previous theoretical work in Information Retrieval and Quantum Mechanics and how the notions of probability, logic and geometry are integrated within a single Hilbert space representation. In this sense the proposed system has more general application and gives rise to a variety of opportunities for future research.

This paper presents an anytime algorithm for  incremental intention recognition in a changing world.  The algorithm is performed by dynamically constructing the intention recognition model on top of a prior domain knowledge base. The model is occasionally reconfigured by situating itself in the changing world and removing newly found out irrelevant intentions. We also discuss some approaches to knowledge base representation for supporting situation-dependent model construction. Reconfigurable Bayesian Networks are employed to produce the intention recognition model.

This position paper presents an approach to computational narrative based in cognitive linguistics and sociolinguistics accounts of conceptual blending, metaphor, and narrative, multimedia semantics, human-centered interface design, and digital media art practice. In particular, as a case study, we describe the Living Liberia Fabric, an AI-based interactive narrative system developed in affiliation with the Truth and Reconciliation Commission (TRC) of Liberia to memorialize a fourteen-year civil war. The Living Liberia Fabric project is led by Fox Harrell and executed in the Imagination, Computation, and Expression (ICE) Laboratory at Georgia Tech. The system exemplifies a cultural computing approach (grounding computing practices in a wider range of specific cultural traditions and values than those that are privileged in computer science).

In the literature on reasoning on the basis of evidence, two traditions exist: one argument-based, and one based on narratives. Recently, we have proposed a hybrid perspective in which argumentation and narratives are combined. This formalized hybrid theory has been tested in a sense-making software prototype for criminal investigators and decision makers. In the present paper, we elaborate on the role of commonsense knowledge. We argue that two kinds of knowledge are essential: argumentation schemes and story schemes. We discuss some of the research issues that need to be addressed.

In this paper we investigate the performance of Cultural Algorithms over the complete range of system complexities, from fixed to chaotic.In order to apply the Cultural Algorithm over all complexity classes we generalize on its co-evolutionary nature to keep the variation in the population across all complexities. Based on previous cultural algorithm approaches, we were to extend the existing models to produce a more general one that could be applied across all complexity classes. We produced a new version of the Cultural Algorithms Toolkit, CAT 2.0, which supported a variety of co-evolutionary features at both the Knowledge and Population levels. We then applied the system to the solution of a 150 randomly generated problems that ranged from simple to chaotic complexity classes. As a result we were able to produce the following conclusions: No homogeneous Social Fabric tested was dominant over all categories of complexity. As the complexity of problems increased, so did the complexity of the Social Fabric that was need to deal with it efficiently. In other words, there was experimental evidence that social structure can be related to the frequency and complexity type of the problems that presented to a cultural system.

We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an ever-increasing demand for methods of dimension reduction in order to undertake the statistical analysis of interest. Our algorithm uses a gradient-based approach which can be used with an arbitrary loss function provided the latter is differentiable. The speed and effectiveness of our algorithm for dimension reduction is demonstrated in the context of supervised classification of some real high-dimensional data sets from the bioinformatics literature.

This technical report is the union of two contributions to the discussion of the Read Paper "Riemann manifold Langevin and Hamiltonian Monte Carlo methods" by B. Calderhead and M. Girolami, presented in front of the Royal Statistical Society on October 13th 2010 and to appear in the Journal of the Royal Statistical Society Series B. The first comment establishes a parallel and possible interactions with Adaptive Monte Carlo methods. The second comment exposes a detailed study of Riemannian Manifold Hamiltonian Monte Carlo (RMHMC) for a weakly identifiable model presenting a strong ridge in its geometry.

In this paper, we show that personalized levels can be auto- matically generated for platform games. We build on previ- ous work, where models were derived that predicted player experience based on features of level design and on playing styles. These models are constructed using preference learn- ing, based on questionnaires administered to players after playing different levels. The contributions of the current pa- per are (1) more accurate models based on a much larger data set; (2) a mechanism for adapting level design parameters to given players and playing style; (3) evaluation of this adap- tation mechanism using both algorithmic and human players. The results indicate that the adaptation mechanism effectively optimizes level design parameters for particular players.