1 |
Bias correction and change measurement in spatio-temporal dataHodge, Miriam Christine January 2012 (has links)
A simplistic view of a dataset is that it is collection of numbers. In fact data are much more than that and all data are collected at a set place and time. Often either the location, or the time, is fixed within the dataset and one or both are disregarded. When the place and time of the collection are incorporated into the analysis, the result is a spatio-temporal model.
Spatio-temporal data are the focus of this thesis. The majority of the datasets used are radio tracking studies of animals where the objective is to measure the habitat use. Observations are made over a long period of time and a large area. The largest dataset analysed tracks over a hundred animals, in an area larger than 40 square miles, for multiple years. In this context understanding the spatio-temporal relationships between observations is essential. Even data that do not have an obvious spatial component can benefit from spatio-temporal analysis. For example, the data presented on volatility in the stock market do not have an obvious spatial component. The spatial component is the location in the market, not a physical location.
Two different methods for measuring and correcting bias are presented. One method relies on direct modelling of the underlying process being observed. The underlying process is animal movement. A model for animal movement is constructed and used to estimate the missing observations that are thought to be the cause of the bias. The second method does not model the animal movement, but instead relies on a Bayesian Hierarchical Model with some simple assumptions. A long running estimation is used to calculate the most likely result without ever directly estimating the underlying equations.
In the second section of the thesis two methods for measuring change from shifts in both spatial and temporal location are presented. The methods, Large Diffeomorphic Deformation Metric Mapping (LDDMM) and Diffeomorphic Demons (DD), were originally developed for anatomical data and are adapted here for nonparametric regression surfaces. These are the first applications of LDDMM and DD outside of computational anatomy.
|
2 |
Survey Designs and Spatio-Temporal Methods for Disease SurveillanceHund, Lauren Brooke 18 September 2012 (has links)
By improving the precision and accuracy of public health surveillance tools, we can improve cost-efficacy and obtain meaningful information to act upon. In this dissertation, we propose statistical methods for improving public health surveillance research. In Chapter 1, we introduce a pooled testing option for HIV prevalence estimation surveys to increase testing consent rates and subsequently decrease non-response bias. Pooled testing is less certain than individual testing, but, if more people to submit to testing, then it should reduce the potential for non-response bias. In Chapter 2, we illustrate technical issues in the design of neonatal tetanus elimination surveys. We address identifying the target population; using binary classification via lot quality assurance sampling (LQAS); and adjusting the design for the sensitivity of the survey instrument. In Chapter 3, we extend LQAS survey designs for monitoring malnutrition for longitudinal surveillance programs. By combining historical information with data from previous surveys, we detect spikes in malnutrition rates. Using this framework, we detect rises in malnutrition prevalence in longitudinal programs in Kenya and the Sudan. In Chapter 4, we develop a computationally efficient geostatistical disease mapping model that naturally handles model fitting issues due to temporal boundary misalignment by assuming that an underlying continuous risk surface induces spatial correlation between areas. We apply our method to assess socioeconomic trends in breast cancer incidence in Los Angeles between 1990 and 2000. In Chapter 5, we develop a statistical framework for addressing statistical uncertainty associated with denominator interpolation and with temporal misalignment in disease mapping studies. We propose methods for assessing the impact of the uncertainty in these predictions on health effects analyses. Then, we construct a general framework for spatial misalignment in regression.
|
3 |
Pattern Extraction By Using Both Spatial And Temporal Features On Turkish Meteorological DataGoler, Isil 01 January 2011 (has links) (PDF)
With the growth in the size of datasets, data mining has been an important research topic and is receiving substantial interest from both academia and industry for many years. Especially, spatio-temporal data mining, mining knowledge from large amounts of spatio-temporal data, is a highly demanding field because huge amounts of spatio-temporal data are collected in various applications. Therefore, spatio-temporal data mining requires the development of novel data mining algorithms and computational techniques for a successful analysis of large spatio-temporal databases. In this thesis, a spatio-temporal mining technique is proposed and applied on Turkish meteorological data which has been collected from various weather stations in Turkey. This study also includes an analysis and interpretation of spatio-temporal rules generated for Turkish Meteorological data set. We introduce a second level mining technique which is used to define general trends of the patterns according to the spatial changes. Genarated patterns are investigated under different temporal sets in order to monitor the changes of the events with respect to temporal changes.
|
4 |
Mining Spatio-Temporal Reachable Regions over Massive Trajectory DataDing, Yichen 15 April 2017 (has links)
Mining spatio-temporal reachable regions aims to find a set of road segments from massive trajectory data, that are reachable from a user-specified location and within a given temporal period. Accurately extracting such spatio-temporal reachable area is vital in many urban applications, e.g., (i) location-based recommendation, (ii) location-based advertising, and (iii) business coverage analysis. The traditional approach of answering such queries essentially performs a distance-based range query over the given road network, which have two main drawbacks: (i) it only works with the physical travel distances, where the users usually care more about dynamic traveling time, and (ii) it gives the same result regardless of the querying time, where the reachable area could vary significantly with different traffic conditions. Motivated by these observations, in this thesis, we propose a data- driven approach to formulate the problem as mining actual reachable region based on real historical trajectory dataset. The main challenge in our approach is the system efficiency, as verifying the reachability over the massive trajectories involves huge amount of disk I/Os. In this thesis, we develop two indexing structures: 1) spatio-temporal index (ST-Index) and 2) connection index (Con-Index) to reduce redundant trajectory data access operations. We also propose a novel query processing algorithm with: 1) maximum bounding region search, which directly extracts a small searching region from the index structure and 2) trace back search, which refines the search results from the previous step to find the final query result. Moreover, our system can also efficiently answer the spatio-temporal reachability query with multiple query locations by skipping the overlapped area search. We evaluate our system extensively using a large-scale real taxi trajectory data in Shenzhen, China, where results demonstrate that the proposed algorithms can reduce 50%-90% running time over baseline algorithms.
|
5 |
Spatio-Temporal Data Mining for Location-Based ServicesGidofalvi, Gyözö January 2008 (has links)
Largely driven by advances in communication and information technology, such as the increasing availability and accuracy of GPS technology and the miniaturization of wireless communication devices, Location–Based Services (LBS) are continuously gaining popularity. Innovative LBSes integrate knowledge about the users into the service. Such knowledge can be derived by analyzing the location data of users. Such data contain two unique dimensions, space and time, which need to be analyzed. The objectives of this thesis are three–fold. First, to extend popular data mining methods to the spatio–temporal domain. Second, to demonstrate the usefulness of the extended methods and the derived knowledge in two promising LBS examples. Finally, to eliminate privacy concerns in connection with spatio–temporal data mining by devising systems for privacy–preserving location data collection and mining. To this extent, Chapter 2 presents a general methodology, pivoting, to extend a popular data mining method, namely rule mining, to the spatio–temporal domain. By considering the characteristics of a number of real–world data sources, Chapter 2 also derives a taxonomy of spatio–temporal data, and demonstrates the usefulness of the rules that the extended spatio–temporal rule mining method can discover. In Chapter 4 the proposed spatio–temporal extension is applied to find long, sharable patterns in trajectories of moving objects. Empirical evaluations show that the extended method and its variants, using high–level SQL implementations, are effective tools for analyzing trajectories of moving objects. Real–world trajectory data about a large population of objects moving over extended periods within a limited geographical space is difficult to obtain. To aid the development in spatio–temporal data management and data mining, Chapter 3 develops a Spatio–Temporal ACTivity Simulator (ST–ACTS). ST–ACTS uses a number of real–world geo–statistical data sources and intuitive principles to effectively generate realistic spatio–temporal activities of mobile users. Chapter 5 proposes an LBS in the transportation domain, namely cab–sharing. To deliver an effective service, a unique spatio–temporal grouping algorithm is presented and implemented as a sequence of SQL statements. Chapter 6 identifies ascalability bottleneck in the grouping algorithm. To eliminate the bottleneck, the chapter expresses the grouping algorithm as a continuous stream query in a data stream management system, and then devises simple but effective spatio–temporal partitioning methods for streams to parallelize the computation. Experimental results show that parallelization through adaptive partitioning methods leads to speed–ups of orders of magnitude without significantly effecting the quality of the grouping. Spatio–temporal stream partitioning is expected to be an effective method to scale computation–intensive spatial queries and spatial analysis methods for streams. Location–Based Advertising (LBA), the delivery of relevant commercial information to mobile consumers, is considered to be one of the most promising business opportunities amongst LBSes. To this extent, Chapter 7 describes an LBA framework and an LBA database that can be used for the management of mobile ads. Using a simulated but realistic mobile consumer population and a set of mobile ads, the LBA database is used to estimate the capacity of the mobile advertising channel. The estimates show that the channel capacity is extremely large, which is evidence for a strong business case, but it also necessitates adequate user controls. When data about users is collected and analyzed, privacy naturally becomes a concern. To eliminate the concerns, Chapter 8 first presents a grid–based framework in which location data is anonymized through spatio–temporal generalization, and then proposes a system for collecting and mining anonymous location data. Experimental results show that the privacy–preserving data mining component discovers patterns that, while probabilistic, are accurate enough to be useful for many LBSes. To eliminate any uncertainty in the mining results, Chapter 9 proposes a system for collecting exact trajectories of moving objects in a privacy–preserving manner. In the proposed system there are no trusted components and anonymization is performed by the clients in a P2P network via data cloaking and data swapping. Realistic simulations show that under reasonable conditions and privacy/anonymity settings the proposed system is effective. / QC 20120215
|
6 |
Pattern-Aware Prediction for Moving ObjectsHoyoung Jeung Unknown Date (has links)
This dissertation challenges an unstudied area in moving objects database domains; predicting (long-term) future locations of moving objects. Moving object prediction enables us to provide a wide range of applications, such as traffic prediction, pre-detection of an aircraft collision, and reporting attractive gas prices for drivers along their routes ahead. Nevertheless, existing location prediction techniques are limited to support such applications since they are generally capable only of short-term predictions. In the real world, many objects exhibit typical movement patterns. This pattern information is able to serve as an important background to tackle the limitations of the existing prediction methods. We aims at offering foundations of pattern-aware prediction for moving objects, rendering more precise prediction results. Specifically, this thesis focuses on three parts. The first part of the thesis studies the problem of predicting future locations of moving objects in Euclidean space. We introduce a novel prediction approach, termed the hybrid prediction model, which utilizes not only the current motion of an object, but also the object's trajectory patterns for prediction. We define, mine, and index the trajectory patterns with a novel access method for efficient query processing. We then propose two different query processing techniques along given query time, i.e., for near future and for distant future. The second part covers the prediction problem for moving objects in network space. We formulate a network mobility model that offers a concise representation of mobility statistics extracted from massive collections of historical objects trajectories. This model captures turning patterns of the objects at junctions, at the granularity of individual objects as well as globally. Based on the model, we develop three different algorithms for predicting the future path of a mobile user moving in a road network, named the PathPredictors. The third part of the thesis extends the prediction problem for a single object to that for multiple objects. We introduce a convoy query that retrieves all groups of objects, i.e., convoys, from the objects' historical trajectories, each convoy consists of objects that have traveled together for some time; thus they may also move together in the future. We then propose three efficient algorithms for the convoy discovery, called the CuTS family, that adopt line simplification methods for reducing the size of the trajectories, permitting efficient query processing. For each part, we demonstrate comprehensive experimental results of our proposals, which show significantly improved accuracies for moving object prediction compared with state-of-the-art methods, while also facilitating efficient query processing.
|
7 |
Pattern-Aware Prediction for Moving ObjectsHoyoung Jeung Unknown Date (has links)
This dissertation challenges an unstudied area in moving objects database domains; predicting (long-term) future locations of moving objects. Moving object prediction enables us to provide a wide range of applications, such as traffic prediction, pre-detection of an aircraft collision, and reporting attractive gas prices for drivers along their routes ahead. Nevertheless, existing location prediction techniques are limited to support such applications since they are generally capable only of short-term predictions. In the real world, many objects exhibit typical movement patterns. This pattern information is able to serve as an important background to tackle the limitations of the existing prediction methods. We aims at offering foundations of pattern-aware prediction for moving objects, rendering more precise prediction results. Specifically, this thesis focuses on three parts. The first part of the thesis studies the problem of predicting future locations of moving objects in Euclidean space. We introduce a novel prediction approach, termed the hybrid prediction model, which utilizes not only the current motion of an object, but also the object's trajectory patterns for prediction. We define, mine, and index the trajectory patterns with a novel access method for efficient query processing. We then propose two different query processing techniques along given query time, i.e., for near future and for distant future. The second part covers the prediction problem for moving objects in network space. We formulate a network mobility model that offers a concise representation of mobility statistics extracted from massive collections of historical objects trajectories. This model captures turning patterns of the objects at junctions, at the granularity of individual objects as well as globally. Based on the model, we develop three different algorithms for predicting the future path of a mobile user moving in a road network, named the PathPredictors. The third part of the thesis extends the prediction problem for a single object to that for multiple objects. We introduce a convoy query that retrieves all groups of objects, i.e., convoys, from the objects' historical trajectories, each convoy consists of objects that have traveled together for some time; thus they may also move together in the future. We then propose three efficient algorithms for the convoy discovery, called the CuTS family, that adopt line simplification methods for reducing the size of the trajectories, permitting efficient query processing. For each part, we demonstrate comprehensive experimental results of our proposals, which show significantly improved accuracies for moving object prediction compared with state-of-the-art methods, while also facilitating efficient query processing.
|
8 |
Visualization of spatio-temporal data in two dimensional spaceBaskaran, Savitha 15 November 2016 (has links)
Indiana University-Purdue University Indianapolis (IUPUI) / Spatio-temporal data is becoming very popular in the recent times, as there are
large number of datasets that collect both location and temporal information in the
real time. The main challenge is that extracting useful insights from such large data
set is extremely complex and laborious. In this thesis, we have proposed a novel 2D
technique to visualize the spatio-temporal big data. The visualization of the combined
interaction between the spatial and temporal data is of high importance to uncover
the insights and identify the trends within the data.
Maps have been a successful way to represent the spatial information. Addition-
ally, in this work, colors are used to represent the temporal data. Every data point
has the time information which is converted into relevant color, based on the HSV
color model. The variation in the time is represented by transition from one color to
another and hence provide smooth interpolation. The proposed solution will help the
user to quickly understand the data and gain insights.
|
9 |
Statistical Regular Pavings and their ApplicationsTeng, Gloria Ai Hui January 2013 (has links)
We propose using statistical regular pavings (SRPs) as an efficient and adaptive statistical data structure for processing massive, multi-dimensional data. A regular paving (RP) is an ordered binary tree that recursively bisects a box in $\Rz^{d}$ along the first widest side. An SRP is extended from an RP by allowing mutable caches of recursively computable statistics of the data. In this study we use SRPs for two major applications: estimating histogram densities and summarising large spatio-temporal datasets.
The SRP histograms produced are $L_1$-consistent density estimators driven by a randomised priority queue that adaptively grows the SRP tree, and formalised as a Markov chain over the space of SRPs. A way to select an estimate is to run a Markov chain over the space of SRP trees, also initialised by the randomised priority queue, but here the SRP tree either shrinks or grows adaptively through pruning or splitting operations. The stationary distribution of the Markov chain is then the posterior distribution over the space of all possible histograms. We then take advantage of the recursive nature of SRPs to make computationally efficient arithmetic averages, and take the average of the states sampled from the stationary distribution to obtain the posterior mean histogram estimate.
We also show that SRPs are capable of summarizing large datasets by working with a dataset containing high frequency aircraft position information. Recursively computable statistics can be stored for variable-sized regions of airspace. The regions themselves can be created automatically to reflect the varying density of aircraft observations, dedicating more computational resources and providing more detailed information in areas with more air traffic. In particular, SRPs are able to very quickly aggregate or separate data with different characteristics so that data describing individual aircraft or collected using different technologies (reflecting different levels of precision) can be stored separately and yet also very quickly combined using standard arithmetic operations.
|
10 |
Design of platforms for computing context with spatio-temporal localityZiotopoulos, Agisilaos Georgios 02 June 2011 (has links)
This dissertation is in the area of pervasive computing.
It focuses on designing platforms for storing, querying, and computing contextual information.
More specifically, we are interested in platforms for storing and querying spatio-temporal events where queries exhibit locality.
Recent advances in sensor technologies have made possible gathering a variety of information on the status of users, the environment machines, etc.
Combining this information with computation we are able to extract context, i.e., a filtered high-level description of the situation.
In many cases, the information gathered exhibits locality both in space and time, i.e., an event is likely to be consumed in a location close to the location where the event was produced, at a time whic
h is close to the time the event was produced.
This dissertation builds on this observation to create better platforms for computing context.
We claim three key contributions.
We have studied the problem of designing and optimizing spatial organizations for exchanging context.
Our thesis has original theoretical work on how to create a platform based on cells of a Voronoi diagram for optimizing the energy and bandwidth required for mobiles to exchange contextual information t
hat is tied to specific locations in the platform.
Additionally, we applied our results to the problem of optimizing a system for surveilling the locations of entities within a given region.
We have designed a platform for storing and querying spatio-temporal events exhibiting locality.
Our platform is based on a P2P infrastructure of peers organized based on the Voronoi diagram associated with their locations to store events based on their own associated locations.
We have developed theoretical results based on spatial point processes for the delay experienced by a typical query in this system.
Additionally, we used simulations to study heuristics to improve the performance of our platform.
Finally, we came up with protocols for the replicated storage of events in order to increase the fault-tolerance of our platform.
Finally, in this thesis we propose a design for a platform, based on RFID tags, to support context-aware computing for indoor spaces.
Our platform exploits the structure found in most indoor spaces to encode contextual information in suitably designed RFID tags.
The elements of our platform collaborate based on a set of messages we developed to offer context-aware services to the users of the platform.
We validated our research with an example hardware design of the RFID tag and a software emulation of the tag's functionality. / text
|
Page generated in 0.0247 seconds