Neural representations of social and non-social uncertainty in human decision making

The social landscape is filled with an intricate web of species-specific desired objects and course of actions. Humans are highly social animals and, as they navigate this landscape, they need to produce adapted decision-making behaviour. Traditionally social and non-social neural mechanisms affecting choice have been investigated using different approaches. Recently, in an effort to unite these findings, two main theories have been proposed to explain how the brain might encode social and non-social motivational decision-making: the extended common currency and the social valuation specific schema (Ruff & Fehr 2014). One way to test these theories is to directly compare neural activity related to social and non-social decision outcomes within the same experimental setting. Here we address this issue by focusing on the neural substrates of social and non-social forms of uncertainty. Using functional magnetic resonance imaging (fMRI) we directly compared the neural representations of reward and risk prediction and errors (RePE and RiPE) in social and non- social situations using gambling games. We used a trust betting game to vary uncertainty along a social dimension (trustworthiness), and a card game (Preuschoff et al. 2006) to vary uncertainty along a non-social dimension (pure risk). The trust game was designed to maintain the same structure of the card game. In a first study, we exposed a divide between subcortical and cortical regions when comparing the way these regions process social and non-social forms of uncertainty during outcome anticipation. Activity in subcortical regions reflected social and non-social RePE, while activity in cortical regions correlated with social RePE and non-social RiPE. The second study focused on outcome delivery and integrated the concept of RiPE in non-social settings with that of fairness and monetary utility maximisation in social settings. In particular these results corroborate recent models of anterior insula function (Singer et al. 2009; Seth 2013), and expose a possible neural mechanism that weights fairness and uncertainty but not monetary utility. The third study focused on functionally defined regions of the early visual cortex (V1) showing how activity in these areas, traditionally considered only visual, might reflect motivational prediction errors in addition to known perceptual prediction mechanisms (den Ouden et al 2012). On the whole, while our results do not support unilaterally one or the other theory modeling the underlying neural dynamics of social and non-social forms of decision making, they provide a working framework where both general mechanisms might coexist.

Query routing in cooperative semi-structured peer-to-peer information retrieval networks

Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.