Mining topological relations from the web

Topological relations between geographic regions are of interest in many applications. When the exact boundaries of regions are not available, such relations can be established by analysing natural language information from web documents. In particular we demonstrate how redundancy-based techniques can be used to acquire containment and adjacency relations, and how fuzzy spatial reasoning can be employed to maintain the consistency of the resulting knowledge base

Pointwise adaptive estimation for robust and quantile regression

A nonparametric procedure for robust regression estimation and for quantile regression is proposed which is completely data-driven and adapts locally to the regularity of the regression function. This is achieved by considering in each point M-estimators over different local neighbourhoods and by a local model selection procedure based on sequential testing. Non-asymptotic risk bounds are obtained, which yield rate-optimality for large sample asymptotics under weak conditions. Simulations for different univariate median regression models show good finite sample properties, also in comparison to traditional methods. The approach is extended to image denoising and applied to CT scans in cancer research

A tabu search procedure for developing robust predicitive project schedules.

Proactive scheduling aims at the generation of robust baseline schedules that are as much as possible protected against disruptions that may occur during project execution. In this paper, we focus on disruptions caused by stochastic resource availabilities and aim at generating stable baseline schedules. A schedule’s robustness (stability) is measured by the weighted deviation between the planned and the actually realized activity starting times during project execution. We present a tabu search procedure that operates on a surrogate, free slack based objective function. Its effectiveness is demonstrated by extensive computational results obtained on a set of randomly generated test instances.Project scheduling; Robustness; Proactive; Stability;

Decomposition, Reformulation, and Diving in University Course Timetabling

In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of resource. Often, each component is associated with different sets of soft constraints, and so with different measures of soft constraint violation. The goal is then to minimise a linear combination of such measures. This paper studies an approach to such problems, which can be thought of as multiphase exploitation of multiple objective-/value-restricted submodels. In this approach, only one computationally difficult component of a problem and the associated subset of objectives is considered at first. This produces partial solutions, which define interesting neighbourhoods in the search space of the complete problem. Often, it is possible to pick the initial component so that variable aggregation can be performed at the first stage, and the neighbourhoods to be explored next are guaranteed to contain feasible solutions. Using integer programming, it is then easy to implement heuristics producing solutions with bounds on their quality. Our study is performed on a university course timetabling problem used in the 2007 International Timetabling Competition, also known as the Udine Course Timetabling Problem. In the proposed heuristic, an objective-restricted neighbourhood generator produces assignments of periods to events, with decreasing numbers of violations of two period-related soft constraints. Those are relaxed into assignments of events to days, which define neighbourhoods that are easier to search with respect to all four soft constraints. Integer programming formulations for all subproblems are given and evaluated using ILOG CPLEX 11. The wider applicability of this approach is analysed and discussed.Comment: 45 pages, 7 figures. Improved typesetting of figures and table

The identification of cellular automata

Although cellular automata have been widely studied as a class of the spatio temporal systems, very few investigators have studied how to identify the CA rules given observations of the patterns. A solution using a polynomial realization to describe the CA rule is reviewed in the present study based on the application of an orthogonal least squares algorithm. Three new neighbourhood detection methods are then reviewed as important preliminary analysis procedures to reduce the complexity of the estimation. The identification of excitable media is discussed using simulation examples and real data sets and a new method for the identification of hybrid CA is introduced

The suburbanisation of poverty in British cities, 2004-16: extent, processes and nature

This paper tracks changes in relative centralisation and relative concentration of poverty for the 25 largest British cities, analysing change for poor and non-poor groups separately, and examining parallel changes in spatial segregation. The paper confirms that poverty is suburbanising, at least in the larger cities, although poverty remains over-represented in inner locations. Suburbanisation is occurring through both the reduction in low income populations in inner locations and the growth non-poor groups in these places, consistent with a process of displacement. Relative centralisation of poverty has fallen more stronglythan relative concentration of poverty, as the outward shift of poorer groups leaves them still living in denser neighbourhoods on average. The paper also shows that spatial segregation (unevenness) declined at the same time although it remains to be seen whether this indicates a long-term shift to less segregated urban forms or a transitional outcome before new forms of segregation emerge around suburban poverty concentrations

Pointwise adaptive estimation for quantile regression

A nonparametric procedure for quantile regression, or more generally nonparametric M-estimation, is proposed which is completely data-driven and adapts locally to the regularity of the regression function. This is achieved by considering in each point M-estimators over different local neighbourhoods and by a local model selection procedure based on sequential testing. Non-asymptotic risk bounds are obtained, which yield rate-optimality for large sample asymptotics under weak conditions. Simulations for different univariate median regression models show good finite sample properties, also in comparison to traditional methods. The approach is the basis for denoising CT scans in cancer research.M-estimation, median regression, robust estimation, local model selection, unsupervised learning, local bandwidth selection, median filter, Lepski procedure, minimax rate, image denoising

Approximate Models and Robust Decisions

Decisions based partly or solely on predictions from probabilistic models may be sensitive to model misspecification. Statisticians are taught from an early stage that "all models are wrong", but little formal guidance exists on how to assess the impact of model approximation on decision making, or how to proceed when optimal actions appear sensitive to model fidelity. This article presents an overview of recent developments across different disciplines to address this. We review diagnostic techniques, including graphical approaches and summary statistics, to help highlight decisions made through minimised expected loss that are sensitive to model misspecification. We then consider formal methods for decision making under model misspecification by quantifying stability of optimal actions to perturbations to the model within a neighbourhood of model space. This neighbourhood is defined in either one of two ways. Firstly, in a strong sense via an information (Kullback-Leibler) divergence around the approximating model. Or using a nonparametric model extension, again centred at the approximating model, in order to `average out' over possible misspecifications. This is presented in the context of recent work in the robust control, macroeconomics and financial mathematics literature. We adopt a Bayesian approach throughout although the methods are agnostic to this position

A Sparse Multi-Scale Algorithm for Dense Optimal Transport

Discrete optimal transport solvers do not scale well on dense large problems since they do not explicitly exploit the geometric structure of the cost function. In analogy to continuous optimal transport we provide a framework to verify global optimality of a discrete transport plan locally. This allows construction of an algorithm to solve large dense problems by considering a sequence of sparse problems instead. The algorithm lends itself to being combined with a hierarchical multi-scale scheme. Any existing discrete solver can be used as internal black-box.Several cost functions, including the noisy squared Euclidean distance, are explicitly detailed. We observe a significant reduction of run-time and memory requirements.Comment: Published "online first" in Journal of Mathematical Imaging and Vision, see DO

Short trips and central places: the home-school distances in the Flemish primary education system (Belgium)

This paper was published in the journal Applied Geography and the definitive published version is available at https://doi.org/10.1016/j.apgeog.2014.06.025.This paper examines the extent to which home-school trip length in northern Belgium is influenced by the spatial distribution of the school sites, and to what extent this distribution contemporarily functions according to propositions of central place theory. Furthermore, from a sustainable mobility perspective, it is evaluated if the primary school network's density supports a daily urban system based on short distances. The results indicate that the overall system's density meets the requirements of a non-motorized system, while the distribution confirms central place mechanisms. The majority of the pupils live within walking or cycling distance from their school, while opportunities exist to further reduce this distance by choosing an alternative school. However, depending on the structure of the concerned settlement, school accessibility varies considerably. Finally, the results suggest that recent increases in school trip length and motorization are mainly caused by non-spatial factors