Generalized Discovery of Tight Space-Time Sequences
Authors: Antonio Castro, Heraldo Borges, Ricardo Campisano, Fabio Porto, Reza Akbarinia, Florent Masseglia, Esther Pacitti, Rafaelli Coutinho ans Eduardo Ogasawara
Abstract: Finding patterns is an important task for different domains. Spatio-temporal patterns brings knowledge about the time and position where a patter is frequent. But not all patterns are frequent over a entire dataset, some can be constrained in spatial positions and time range. Mining tight space-time sequences has as objective to discover frequent sequences, the time range and the set of positions in which these sequences are frequent.
Based on the Apriori algorithm and using concepts of ranged group, greedy-ranged group and solid-ranged group, this paper proposes STSM-2S1T algorithm as a solution to the discovery of frequent sequences that are constrained in one dimension in time and in two dimensions in space. Using a real-world spatio-temporal seismic dataset, STSM-2S1T was compared with a simple approach and extensively evaluated to analyze its sensitivity. As result, STSM-2S1T presented a better performance and low variation in resources usage as input parameters change.
Acknowledgments: The authors would like to thank CAPES, CNPq, and FAPERJ for partially funding this paper.
T401 dataset: The Netherlands seismic spatial-time series dataset, named F3 Block, was produced by the seismic reflection method in a region located in the Dutch sector of the North Sea. The seismic data is obtained by sending high-energy sound waves into the ground or seabed as the case. The amplitude of the reflected sound waves is registered, the later the reflected sound wave arrives deeper in the soil it was reflected.
The dataset is available in: dataset.RData
As a result, this dataset contains observations that are related to the time the sound wave arrives and attributes that are related to the position of the hydrophone which registered the reflected sound wave, a set of time series.
The results presented in this work were focused on public data of the inline 401.
It is composed by 951 spatial-time series with 462 observations.
Patterns previously set by experts: The location of these patterns is of key importance for oil and gas prospects.
The file that contains the positions of the patterns is available in: patterns.RData
An Analysis of Brazilian Flight Delays Based on Frequent Patterns
Authors: Alice Sternberg, Diego Carvalho, Leonardo Murta, Jorge Soares and Eduardo Ogasawara
Federal Center for Technological Education of Rio de Janeiro (CEFET/RJ)
Abstract: In this paper, we applied data indexing techniques combined with association rules to unveil hidden patterns of flight delays. Considering Brazilian flight data and guided by six research questions related to causes, moments, differences, and relationships between airports and airlines, we evaluated and quantified all attributes that may lead to delays, showing not only the main patterns, but also their chances of occurrence in the entire network, in each airport and airline. We observed that Brazilian flight system has difficulties to recover from previous delays and when operating under adverse meteorological conditions, delays occurrences may increase up to 216%.
Acknowledgments: The authors thank CNPq and FAPERJ for partially sponsoring this research.
Arules Package for R: Functions for mining association rules and frequent itemsets. The Apriori algorithm is intended to be used on the generation of association rules for flight delays. Restricting the right-hand side of the rule to a flight delay may show its reasons on the left-hand side. For this purpose, in order to understand domestic delays in Brazil, a data set containing flight and meteorological data was built and evaluated through the association rules generated by Apriori.
- Available at CRAN: https://cran.r-project.org/web/packages/arules/index.html
- Reference manual: https://cran.r-project.org/web/packages/arules/arules.pdf
#Install Apriori package install.packages("arules") #Load Arules package library("arules") data(flightBR) rules_delay <- apriori(flightBR,parameter=list(supp = 0.00077, conf = 0.2276, minlen=2, maxlen= 4, target = "rules"), appearance=list(rhs = c("delay_dep=1"),default="lhs"), control=NULL) #delay_dep=1 means a departure delay or a cancellation
The Arules R-Package enables the generation of association rules using the Apriori algorithm. Restricting the right-hand side of the rule to delays and setting the thresholds for support, confidence and minimum and maximum lengths, we obtain the conditions that may explain the reasons for flight delays on the left-hand side of the rules. For this purpose, we built the flightBR data set after some preprocessing stages, such as integration of multiple sources, cleaning of discrepancies and outliers, selection of the main airports and airlines and transformation, in which we created 12 derived attributes using concept hierarchies, binning, and temporal aggregation. Thus, the flightBR data set contains Brazilian domestic and commercial flights data between January 2009 and February 2015.
flightBR data set: flightBR.RData
Firstly, the apriori function was applied to this dataset considering a support of 0.00077 (approximately equivalent to once per day), a confidence of 0.2276 (the total percentage of delays of the dataset), a minimum length of 2 and maximum length from 2 to 4, generating the following three sets of rules.
Rules of maximum length = 2: rules2.csv
Rules of maximum length = 3: rules3.csv
Rules of maximum length = 4: rules4.csv
Then, the rules were evaluated based on their lifts. The lift is a correlation measure between the conditions on the left-hand side and the consequent on the right-hand side, which in our case is a flight delay. When greater than 1, the chances of experiencing a delay grow with the increase of the lift.
We also generated some specific sets of rules considering some important attributes verified on the first analysis, such as the year of departure, the time of the day and their relationship with airports and the relationship between airlines and airports. For this purpose, support and confidence were very low in order to consider all the situations experienced by the flightBR flights.
Year of departure: year.csv
Time of departure: time_of_day.csv
Time of departure and airport: time_airport.csv
Airline and airport: airline_airport.csv
Finally, we add arrival attributes to the flightBR dataset, creating the flightBR_arr dataset, in order to compare departure and arrival delays. Using very low support and confidence, we investigated when a late departure can be recovered and transformed into a punctual arrival and when a punctual departure leads to a delayed arrival.
flightBR_arr data set: flightBR_arr.RData
Late departures and punctual arrivals: late_dep_punctual_arr.csv
Punctual departures and late arrivals: punctual_dep_late_arr.csv
Flight delay review
Systematic Review Data
Reproducibility
The possibility for the reader to be able to reproduce all the results presented in papers is significant for the scientific method. Initiatives that publishes methods and experimental evaluation using active documents (such as Jupyter notebook) are relevant for support reproducibility. We have provided an example (analytics-example.ipynb) of a reproducible code that enables the comprehension of some data analytics methods presented in the paper.
Appendix