The goal of this NCGIA-Varenius workshop and research initiative was to find new automated methods for filtering large amounts of raw geographic data into more user-consumable forms of knowledge. This includes: i) spatial data mining; ii) content-based and knowledge-based retrieval; iii) development of multi-media spatial data types; iv) on-line analytic processing; v) refinement of non-parametric statistics; vi) incorporation of computational intelligence techniques (such as neural networks and AI expert systems) into spatial data analysis. A key objective of the "geographic knowledge discovery" (GKD) workshop was to bring together the diverse stakeholders in GKD and spatial data mining. This report provides an overview of the workshop, lists the workshop participants, and provides the position papers submitted in response to the open Call for Participation. The final section summarizes workshop presentations and discussion.

We present here a vision of individualized Knowledge Graphs (iKGs) in cardiovascular medicine: a modern informatics platform of exchange and inquiry that comprehensively integrates biological knowledge with medical histories and health outcomes of individual patients. We envision that this could transform how clinicians and scientists together discover, communicate, and apply new knowledge.

Crowdsourcing is the de-facto standard for gathering annotated data. While, in theory, data annotation tasks are assumed to be attempted by workers independently, in practice, data annotation tasks are often grouped into batches to be presented and annotated by workers together, in order to save on the time or cost overhead of providing instructions or necessary background. Thus, even though independence is usually assumed between annotations on data items within the same batch, in most cases, a worker's judgment on a data item can still be affected by other data items within the batch, leading to additional errors in collected labels. In this paper, we study the data annotation bias when data items are presented as batches to be judged by workers simultaneously. We propose a novel worker model to characterize the annotating behavior on data batches, and present how to train the worker model on annotation data sets. We also present a debiasing technique to remove the effect of such annotation bias from adversely affecting the accuracy of labels obtained. Our experimental results on both synthetic data and real-world data demonstrate the effectiveness of our proposed method.

Given the large volume of technical documents available, it is crucial to automatically organize and categorize these documents to be able to understand and extract value from them. Towards this end, we introduce a new research problem called Facet Extraction. Given a collection of technical documents, the goal of Facet Extraction is to automatically label each document with a set of concepts for the key facets (e.g., application, technique, evaluation metrics, and dataset) that people may be interested in. Facet Extraction has numerous applications, including document summarization, literature search, patent search and business intelligence. The major challenge in performing Facet Extraction arises from multiple sources: concept extraction, concept to facet matching, and facet disambiguation. To tackle these challenges, we develop FacetGist, a framework for facet extraction. Facet Extraction involves constructing a graph-based heterogeneous network to capture information available across multiple local sentence-level features, as well as global context features. We then formulate a joint optimization problem, and propose an efficient algorithm for graph-based label propagation to estimate the facet of each concept mention. Experimental results on technical corpora from two domains demonstrate that Facet Extraction can lead to an improvement of over 25% in both precision and recall over competing schemes.

Databases and data warehouse systems have been evolving from handling normalized spreadsheets stored in relational databases, to managing and analyzing diverse application-oriented data with complex interconnecting structures. Responding to this emerging trend, graphs have been growing rapidly and showing their critical importance in many applications, such as the analysis of XML, social networks, Web, biological data, multimedia data and spatiotemporal data. Can we extend useful functions of databases and data warehouse systems to handle graph structured data? In particular, OLAP (On-Line Analytical Processing) has been a popular tool for fast and user-friendly multi-dimensional analysis of data warehouses. Can we OLAP graphs? Unfortunately, to our best knowledge, there are no OLAP tools available that can interactively view and analyze graph data from different perspectives and with multiple granularities. In this paper, we argue that it is critically important to OLAP graph structured data and propose a novel Graph OLAP framework. According to this framework, given a graph dataset with its nodes and edges associated with respective attributes, a multi-dimensional model can be built to enable efficient on-line analytical processing so that any portions of the graphs can be generalized/specialized dynamically, offering multiple, versatile views of the data. The contributions of this work are three-fold. First, starting from basic definitions, i.e., what are dimensions and measures in the Graph OLAP scenario, we develop a conceptual framework for data cubes on graphs. We also look into different semantics of OLAP operations, and classify the framework into two major subcases: informational OLAP and topological OLAP. Second, we show how a graph cube can be materialized by calculating a special kind of measure called aggregated graph and how to implement it efficiently. This includes both full materialization and partial materialization where constraints are enforced to obtain an iceberg cube. As we can see, due to the increased structural complexity of data, aggregated graphs that depend on the underlying “network” properties of the graph dataset are much harder to compute than their traditional OLAP counterparts. Third, to provide more flexible, interesting and informative OLAP of graphs, we further propose a discovery-driven multi-dimensional analysis model to ensure that OLAP is performed in an intelligent manner, guided by expert rules and knowledge discovery processes. We outline such a framework and discuss some challenging research issues for discovery-driven Graph OLAP.

Variation is key to the adaptability of species and their ability to survive changes to the Earth's climate and habitats. Plasticity in movement strategies allows a species to better track spatial dynamics of habitat quality. We describe the mechanisms that shape the movement of a long-distance migrant bird (turkey vulture, Cathartes aura) across two continents using satellite tracking coupled with remote-sensing science. Using nearly 10 years of data from 24 satellite-tracked vultures in four distinct populations, we describe an enormous amount of variation in their movement patterns. We related vulture movement to environmental conditions and found important correlations explaining how far they need to move to find food (indexed by the Normalized Difference Vegetation Index) and how fast they can move based on the prevalence of thermals and temperature. We conclude that the extensive variability in the movement ecology of turkey vultures, facilitated by their energetically efficient thermal soaring, suggests that this species is likely to do well across periods of modest climate change. The large scale and sample sizes needed for such analysis in a widespread migrant emphasizes the need for integrated and collaborative efforts to obtain tracking data and for policies, tools and open datasets to encourage such collaborations and data sharing.