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 this article we describe a cognitive heuristic known as the unpacking effect by using a mathematical model, based on the quantum formalism, already introduced for the conjunction fallacy. We present the basic postulates of such quantum-like model and we show that the presence of interference terms is responsible of the unpacking effect. In particular, the sign of the interference and its functional form are able to describe the experimental results about subadditivity, superadditivity and additivity. A comparison with previous models is presented, as well as new experimental predictions, allowing to conclude that this new formalism and the basic concepts of quantum information processing provide a new promising way to describe and understand human judgement and categorization.

Since the early days of quantum theory, the concept of wave function collapse has been looked upon as mathematically unquantifiable, observer-dependent, non-local, or simply inelegant. Consequently, modern interpretations of quantum theory often try to avoid or make irrelevant the need for wave collapse. This is ironic, since experimental quantum physics requires some variant of wave collapse wherever quantum phenomena interact with the classical universe of the observer. This paper proposes a pragmatic view in which wave function collapses are treated as real phenomena that occur in pairs. Paired collapses occur when two wave packets exchange real (vs. virtual) momentum-carrying force particles such as photons. To minimize reversibility, such pairs must be separated by a relativistically time-like interval. The resulting model resembles a network of future-predictive simulations (wave packets) linked together by occasional exchanges of data (force particles). Each data exchange “updates” the wave packets by eliminating the need for them to “consider” some range of possible futures. The rest of the paper explores the information processing implications of this idea of networked wave packets. It is postulated that similar networks of simulations in classical computers could provide faster, more efficient ways to process sensor data.

We assume that the brain is some kind of a computer and look at operations implied by the figurative use of language. Figurative language is pervasive, bypasses the literal meaning of what is said and is interpreted metaphorically or by analogy. Such an interpretation calls for a mapping in concept space, leading us to speculate about the nature of concept space in terms of readily computable mappings. We find that mappings of the appropriate kind are possible in high-dimensional spaces and demonstrate them with the simplest such space, namely, where the dimensions are binary. Two operations on binary vectors, one akin to addition and the other akin to multiplication, allow new representations to be composed from existing ones, and the ``multiplication'' operation is also suited for the mapping. The properties of high-dimensional spaces have been shown elsewhere to correspond to cognitive phenomena such as memory recall. The present ideas further suggest the suitability of high-dimensional representation for cognitive modeling.

Forming ad-hoc coalitions between military forces and humanitarian organizations is crucial in mission-critical scenarios. Very often coalition parties need to operate according to planning constraints and regulations, or policies. Therefore, they find themselves not only in need to consider their own goals, but also to support coalition partners to the extent allowed by such regulations. In time-stressed conditions, this is a challenging and cognition-intensive task. In this paper, we present intelligent agents that support human planners and ease their cognitive burden by detecting and giving advice about the violation of policies and constraints. Through a series of experiments conducted with human subjects, we compare and contrast the agents' performance on a number of metrics in three conditions: agent support, transparent policy enforcement, and neither support nor enforcement.

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.

The analysis of career paths suffers from a lack of exploratory tools and dynamic models, due in part to the inherent high dimensionality of the problem. Paths may be understood as directed traversals through a graph whose nodes consist of "job types," which we define as industry and occupation pairs. We want to develop tools to understand and detect high-level features of  both the labor market and the workers moving through it — career dynamics. To do this, we map the discrete space of jobs into a d-dimensional continuous space; proximity between jobs will mean that they are "close" to each other in a non-negligible subset of career paths. This embedding allows one to visualize the job landscape.  Moreover, we can map individual or groups of career paths to this space, extract features of their collective structure, and construct statistical tests comparing groups by means of this mapping.

This paper addresses the numerical estimation of the principal curvature of pattern transformation manifolds. When a visual pattern undergoes a geometric transformation, it forms a (sub)manifold in the ambient space, which is usually called the transformation manifold. The manifold curvature is an important property characterizing the manifold geometry, with several applications in manifold learning. We propose an efficient numerical algorithm for estimating the principal curvature at a certain point on the transformation manifold.

Data clustering is a common technique for statistical data analysis. It is used in many fields including machine learning, data mining, customer segmentation, trend analysis, pattern recognition and image analysis. The proposed Localized Diffusion Folders methodology performs hierarchical clustering of high-dimensional datasets. The diffusion folders are multi-level data partitioning into local neighborhoods that are generated by several random selections of data points and folders in a diffusion graph and by defining local diffusion distances between them. This multi-level partitioning defines an improved localized geometry of the data and a localized Markov transition matrix that is used for the next time step in the diffusion process. The result of this clustering method is a bottom-up hierarchical clustering of the data while each level in the hierarchy contains localized diffusion folders of folders from the lower levels. This methodology preserves the local neighborhood of each point while eliminating noisy connections between distinct points and areas in the graph. The performance of the algorithms is demonstrated on real data and it is compared to existing methods.

We develop a topological approach to stratification learning. Given point cloud data drawn from a stratified space, our objective is to infer which points belong to the same strata. First we define a multi-scale notion of a stratified space, giving a stratification for each radius level. We then use methods derived from kernel and cokernel persistent homology to cluster the data points into different strata, and we prove a result which guarantees the correctness of our clustering, given certain topological conditions. We later give bounds on the minimum number of sample points required to infer, with probability, which points belong to the same strata. Finally, we give an explicit algorithm for the clustering and apply it to some simulated data.