Knowledge Cartography for Controversies: The Iraq Debate

In analysing controversies and debates—which would include reviewing a literature in order to plan research, or assessing intelligence to formulate policy—there is no one worldview which can be mapped, for instance as a single, coherent concept map. The cartographic challenge is to show which facts are agreed and contested, and the different kinds of narrative links that use facts as evidence to define the nature of the problem, what to do about it, and why. We will use the debate around the invasion of Iraq to demonstrate the methodology of using a knowledge mapping tool to extract key ideas from source materials, in order to classify and connect them within and across a set of perspectives of interest to the analyst. We reflect on the value that this approach adds, and how it relates to other argument mapping approaches

Avoiding the Global Sort: A Faster Contour Tree Algorithm

We revisit the classical problem of computing the \emph{contour tree} of a scalar field $f:\mathbb{M} \to \mathbb{R}$, where $\mathbb{M}$ is a triangulated simplicial mesh in $\mathbb{R}^d$. The contour tree is a fundamental topological structure that tracks the evolution of level sets of $f$ and has numerous applications in data analysis and visualization. All existing algorithms begin with a global sort of at least all critical values of $f$, which can require (roughly) $\Omega(n\log n)$ time. Existing lower bounds show that there are pathological instances where this sort is required. We present the first algorithm whose time complexity depends on the contour tree structure, and avoids the global sort for non-pathological inputs. If $C$ denotes the set of critical points in $\mathbb{M}$, the running time is roughly $O(\sum_{v \in C} \log \ell_v)$, where $\ell_v$ is the depth of $v$ in the contour tree. This matches all existing upper bounds, but is a significant improvement when the contour tree is short and fat. Specifically, our approach ensures that any comparison made is between nodes in the same descending path in the contour tree, allowing us to argue strong optimality properties of our algorithm. Our algorithm requires several novel ideas: partitioning $\mathbb{M}$ in well-behaved portions, a local growing procedure to iteratively build contour trees, and the use of heavy path decompositions for the time complexity analysis

Knowledge Cartography for Open Sensemaking Communities

Knowledge Cartography is the discipline of visually mapping the conceptual structure of ideas, such as the connections between issues, concepts, answers, arguments and evidence. The cognitive process of externalising one's understanding clarifies one's own grasp of the situation, as well as communicating it to others as a network that invites their contributions. This sensemaking activity lies at the heart of the Open Educational Resources movement's objectives. The aim of this paper is to describe the usage patterns of Compendium, a knowledge mapping tool from the OpenLearn OER project, using quantitative data from interaction logs and qualitative data from knowledge maps, forums and blog postings. This work explains nine roles played by maps in OpenLearn, and discusses some of the benefits and adoption obstacles, which motivate our ongoing work

Democratic Replay: Enhancing TV Election Debates with Interactive Visualisations

This paper presents an online platform for enhancing televised election debates with interactive visualisations. Election debates are one of the highlights of election campaigns worldwide. They are also often criticised as appearing scripted, rehearsed, detached from much of the electorate, and at times too complex. Democratic Replay enhances videos of election debates with a collection of interactive tools aimed at providing a replay experience centred around citizens' needs. We present the system requirements, design and implementation, and report on an evaluation based on the ITV Leaders' Debate from the 2015 UK General Election campaign