17 research outputs found
Spaceprint: a Mobility-based Fingerprinting Scheme for Public Spaces
In this paper, we address the problem of how automated situation-awareness
can be achieved by learning real-world situations from ubiquitously generated
mobility data. Without semantic input about the time and space where situations
take place, this turns out to be a fundamental challenging problem.
Uncertainties also introduce technical challenges when data is generated in
irregular time intervals, being mixed with noise, and errors. Purely relying on
temporal patterns observable in mobility data, in this paper, we propose
Spaceprint, a fully automated algorithm for finding the repetitive pattern of
similar situations in spaces. We evaluate this technique by showing how the
latent variables describing the category, and the actual identity of a space
can be discovered from the extracted situation patterns. Doing so, we use
different real-world mobility datasets with data about the presence of mobile
entities in a variety of spaces. We also evaluate the performance of this
technique by showing its robustness against uncertainties
Multi-layered Cepstrum for Instantaneous Frequency Estimation
We propose the multi-layered cepstrum (MLC) method to estimate multiple
fundamental frequencies (MF0) of a signal under challenging contamination such
as high-pass filter noise. Taking the operation of cepstrum (i.e., Fourier
transform, filtering, and nonlinear activation) recursively, MLC is shown as an
efficient method to enhance MF0 saliency in a step-by-step manner. Evaluation
on a real-world polyphonic music dataset under both normal and low-fidelity
conditions demonstrates the potential of MLC.Comment: In 2018 6th IEEE Global Conference on Signal and Information
Processin
Measuring Regularity of Individual Travel Patterns
Regularity is an important property of individual travel behavior, and the ability to measure it enables advances in behavior modeling, mobility prediction, and customer analytics. In this paper, we propose a methodology to measure travel behavior regularity based on the order in which trips or activities are organized. We represent individuals' travel over multiple days as sequences of 'travel events' - discrete and repeatable behavior units explicitly defined based on the research question and the available data. We then present a metric of regularity based on entropy rate, which is sensitive to both the frequency of travel events and the order in which they occur. The methodology is demonstrated using a large sample of pseudonymised transit smart card transaction records from London, U.K. The entropy rate is estimated with a procedure based on the Burrows-Wheeler transform. The results confirm that the order of travel events is an essential component of regularity in travel behavior. They also demonstrate that the proposed measure of regularity captures both conventional patterns and atypical routine patterns that are regular but not matched to the 9-to-5 working day or working week. Unlike existing measures of regularity, our approach is agnostic to calendar definitions and makes no assumptions regarding periodicity of travel behavior. The proposed methodology is flexible and can be adapted to study other aspects of individual mobility using different data sources.Transport for London (Organization
Periodic Pattern Mining a Algorithms and Applications
Owing to a large number of applications periodic pattern mining has been extensively studied for over a decade Periodic pattern is a pattern that repeats itself with a specific period in a give sequence Periodic patterns can be mined from datasets like biological sequences continuous and discrete time series data spatiotemporal data and social networks Periodic patterns are classified based on different criteria Periodic patterns are categorized as frequent periodic patterns and statistically significant patterns based on the frequency of occurrence Frequent periodic patterns are in turn classified as perfect and imperfect periodic patterns full and partial periodic patterns synchronous and asynchronous periodic patterns dense periodic patterns approximate periodic patterns This paper presents a survey of the state of art research on periodic pattern mining algorithms and their application areas A discussion of merits and demerits of these algorithms was given The paper also presents a brief overview of algorithms that can be applied for specific types of datasets like spatiotemporal data and social network
Spatiotemporal Tensor Completion for Improved Urban Traffic Imputation
Effective management of urban traffic is important for any smart city
initiative. Therefore, the quality of the sensory traffic data is of paramount
importance. However, like any sensory data, urban traffic data are prone to
imperfections leading to missing measurements. In this paper, we focus on
inter-region traffic data completion. We model the inter-region traffic as a
spatiotemporal tensor that suffers from missing measurements. To recover the
missing data, we propose an enhanced CANDECOMP/PARAFAC (CP) completion approach
that considers the urban and temporal aspects of the traffic. To derive the
urban characteristics, we divide the area of study into regions. Then, for each
region, we compute urban feature vectors inspired from biodiversity which are
used to compute the urban similarity matrix. To mine the temporal aspect, we
first conduct an entropy analysis to determine the most regular time-series.
Then, we conduct a joint Fourier and correlation analysis to compute its
periodicity and construct the temporal matrix. Both urban and temporal matrices
are fed into a modified CP-completion objective function. To solve this
objective, we propose an alternating least square approach that operates on the
vectorized version of the inputs. We conduct comprehensive comparative study
with two evaluation scenarios. In the first one, we simulate random missing
values. In the second scenario, we simulate missing values at a given area and
time duration. Our results demonstrate that our approach provides effective
recovering performance reaching 26% improvement compared to state-of-art CP
approaches and 35% compared to state-of-art generative model-based approaches