Searcharxiv⌕ Search

arXiv subjects

Chris North

Publications and source records attributed to Chris North.

45 records · Page 3Linked to original sources

Evaluating Semantic Interaction on Word Embeddings via Simulation

Semantic interaction (SI) attempts to learn the user's cognitive intents as they directly manipulate data projections during sensemaking activity. For text analysis, prior implementations of SI have used common data features, such as bag-of-words representations, for machine learning from user interactions. Instead, we hypothesize that features derived from deep learning word embeddings will enable SI to better capture the user's subtle intents. However, evaluating these effects is difficult. SI systems are usually evaluated by a human-centred qualitative approach, by observing the utility and effectiveness of the application for end-users. This approach has drawbacks in terms of replicability, scalability, and objectiveness, which makes it hard to perform convincing contrast experiments between different SI models. To tackle this problem, we explore a quantitative algorithm-centered analysis as a complementary evaluation approach, by simulating users' interactions and calculating the accuracy of the learned model. We use these methods to compare word-embeddings to bag-of-words features for SI.

cs.HC↗

Smooth, Efficient, and Interruptible Zooming and Panning

This paper introduces a novel technique for smooth and efficient zooming and panning based on dynamical systems in hyperbolic space. Unlike the technique of van Wijk and Nuij, the animations produced by our technique are smooth at the endpoints and when interrupted by a change of target. To analyze the results of our technique, we introduce world/screen diagrams, a novel technique for visualizing zooming and panning animations.

cs.GR↗

The Signals and Systems Approach to Animation

Animation is ubiquitous in visualization systems, and a common technique for creating these animations is the transition. In the transition approach, animations are created by smoothly interpolating a visual attribute between a start and end value, reaching the end value after a specified duration. This approach works well when each transition for an attribute is allowed to finish before the next is triggered, but performs poorly when a new transition is triggered before the current transition has finished. In particular, interruptions introduce velocity discontinuities, and frequent interruptions can slow down the resulting animation. To solve these problems, we model the problem of animation as a signal processing problem. In our technique, animations are produced by transformations of signals, or functions over time. In particular, an animation is produced by transforming an input signal, a function from time to target attribute value, into an output signal, a function from time to displayed attribute value. We show that well-known signal-processing techniques can be applied to produce animations that are free from velocity discontinuities even when interrupted.

cs.GR↗

The Astropy Problem

The Astropy Project (http://astropy.org) is, in its own words, "a community effort to develop a single core package for Astronomy in Python and foster interoperability between Python astronomy packages." For five years this project has been managed, written, and operated as a grassroots, self-organized, almost entirely volunteer effort while the software is used by the majority of the astronomical community. Despite this, the project has always been and remains to this day effectively unfunded. Further, contributors receive little or no formal recognition for creating and supporting what is now critical software. This paper explores the problem in detail, outlines possible solutions to correct this, and presents a few suggestions on how to address the sustainability of general purpose astronomical software.

astro-ph.IM↗

A note on Beckett-Gray codes and the relationship of Gray codes to data structures

In this paper we introduce a natural mathematical structure derived from Samuel Beckett's play "Quad". We call this structure a binary Beckett-Gray code. We enumerate all codes for $n \leq 6$ and give examples for $n=7,8$. Beckett-Gray codes can be realized as successive states of a queue data structure. We show that the binary reflected Gray code can be realized as successive states of two stack data structures.

math.CO↗

Interactive and Iterative Discovery of Entity Network Subgraphs

Graph mining to extract interesting components has been studied in various guises, e.g., communities, dense subgraphs, cliques. However, most existing works are based on notions of frequency and connectivity and do not capture subjective interestingness from a user's viewpoint. Furthermore, existing approaches to mine graphs are not interactive and cannot incorporate user feedbacks in any natural manner. In this paper, we address these gaps by proposing a graph maximum entropy model to discover surprising connected subgraph patterns from entity graphs. This model is embedded in an interactive visualization framework to enable human-in-the-loop, model-guided data exploration. Using case studies on real datasets, we demonstrate how interactions between users and the maximum entropy model lead to faster and explainable conclusions.

cs.SI↗

Interactive Discovery of Coordinated Relationship Chains with Maximum Entropy Models

Modern visual analytic tools promote human-in-the-loop analysis but are limited in their ability to direct the user toward interesting and promising directions of study. This problem is especially acute when the analysis task is exploratory in nature, e.g., the discovery of potentially coordinated relationships in massive text datasets. Such tasks are very common in domains like intelligence analysis and security forensics where the goal is to uncover surprising coalitions bridging multiple types of relations. We introduce new maximum entropy models to discover surprising chains of relationships leveraging count data about entity occurrences in documents. These models are embedded in a visual analytic system called MERCER that treats relationship bundles as first class objects and directs the user toward promising lines of inquiry. We demonstrate how user input can judiciously direct analysis toward valid conclusions whereas a purely algorithmic approach could be led astray. Experimental results on both synthetic and real datasets from the intelligence community are presented.

cs.DB↗

The EChO science case

The discovery of almost 2000 exoplanets has revealed an unexpectedly diverse planet population. Observations to date have shown that our Solar System is certainly not representative of the general population of planets in our Milky Way. The key science questions that urgently need addressing are therefore: What are exoplanets made of? Why are planets as they are? What causes the exceptional diversity observed as compared to the Solar System? EChO (Exoplanet Characterisation Observatory) has been designed as a dedicated survey mission for transit and eclipse spectroscopy capable of observing a large and diverse planet sample within its four-year mission lifetime. EChO can target the atmospheres of super-Earths, Neptune-like, and Jupiter-like planets, in the very hot to temperate zones (planet temperatures of 300K-3000K) of F to M-type host stars. Over the next ten years, several new ground- and space-based transit surveys will come on-line (e.g. NGTS, CHEOPS, TESS, PLATO), which will specifically focus on finding bright, nearby systems. The current rapid rate of discovery would allow the target list to be further optimised in the years prior to EChO's launch and enable the atmospheric characterisation of hundreds of planets. Placing the satellite at L2 provides a cold and stable thermal environment, as well as a large field of regard to allow efficient time-critical observation of targets randomly distributed over the sky. A 1m class telescope is sufficiently large to achieve the necessary spectro-photometric precision. The spectral coverage (0.5-11 micron, goal 16 micron) and SNR to be achieved by EChO, thanks to its high stability and dedicated design, would enable a very accurate measurement of the atmospheric composition and structure of hundreds of exoplanets.

astro-ph.EP↗

SPIRE Point Source Photometry

The different algorithms appropriate for point source photometry on data from the SPIRE instrument on-board the Herschel Space Observatory, within the Herschel Interactive Processing Environment (HIPE) are compared. Point source photometry of a large ensemble of standard calibration stars and dark sky observations is carried out using the 4 major methods within HIPE: SUSSEXtractor, DAOphot, the SPIRE Timeline Fitter and simple Aperture Photometry. Colour corrections and effective beam areas as a function of the assumed source spectral index are also included to produce a large number of photometric measurements per individual target, in each of the 3 SPIRE bands (250, 350, 500um), to examine both the accuracy and repeatability of each of the 4 algorithms. It is concluded that for flux densities down to the level of 30mJy that the SPIRE Timeline Fitter is the method of choice. However, at least in the 250 and 350um bands, all 4 methods provide photometric repeatability better than a few percent down to at approximately 100mJy. The DAOphot method appears in many cases to have a systematic offset of ~8% in all SPIRE bands which may be indicative of a sub-optimal aperture correction. In general, aperture photometry is the least reliable method, i.e. largest scatter between observations, especially in the longest wavelength band. At the faintest fluxes, <30mJy, SUSSEXtractor or DAOphot provide a better alternative to the Timeline Fitter.

astro-ph.IM↗