2,658 research outputs found
Recommended from our members
Breaking Computational Barriers to Perform Time Series Pattern Mining at Scale and at the Edge
Uncovering repeated behavior in time series is an important problem in many domains such as medicine, geophysics, meteorology, and many more. With the continuing surge of smart/embedded devices generating time series data, there is an ever growing need to perform analysis on datasets of increasing size. Additionally, there is an increasing need for analysis at low power edge devices due to latency problems inherent to the speed of light and the sheer amount of data being recorded. The matrix profile has proven to be a tool highly suitable for pattern mining in time series; however, a naive approach to computing the matrix profile makes it impossible to use effectively in both the cloud and at the edge. This dissertation shows how, through the use of GPUs and machine learning, the matrix profile is computed more feasibly, both at cloud-scale and at sensor-scale. In addition, it illustrates why both of these types of computation are important and what new insights they can provide to practitioners working with time series data
Securitization and lending standards: evidence from the wholesale loan market
We investigate the effect of securitization activity on banks’ lending standards using evidence from pricing behavior on the syndicated loan market. We find that banks more active at originating asset-backed securities are also more aggressive on their loan pricing practices. This suggests that securitization activity lead to laxer credit standards. Macroeconomic factors also play a large role explaining the impact of securitization activity on bank lending standards: banks more active in the securitization markets loosened more aggressively their lending standards in the run up to the recent financial crisis but also tightened more strongly during the crisis period. As a continuum of this paper we are examining whether individual loans that are eventually securitized are priced more aggressively by using unique European data on individual loans from all major trustees. JEL Classification: G21, G28bank risk taking, financial crisis, securitization, syndicated loans
Digitalization of Interior Material Library to Enhance Teaching-Learning Process
The concept of the library is evolving from the conventional storage for books into a digital information centre, a place to dive deep into sources of knowledge. The urgency of digitization has led by the requirement of distance learning, the flexibility of accessing resources and building a preserved collection in digital form. Interior Design Department BINUS University realizes the need for digitization could help students and lecturers to cope with the situation. In this research, a study case in the interior material library of BINUS University is conducted to show step by step process of digitizing the material library collection. The approach holds three significant steps; the nomenclature study by making categories and coding the samples, transferring material samples into digital formation, and preparing the digital platform to broaden the users’ access. The result of this research is elaborated, and lessons learned from the process. The review can develop further research in the digitization of the interior material library in the future
TraTSA: A Transprecision Framework for Efficient Time Series Analysis
Time series analysis (TSA) comprises methods for extracting information in domains as diverse as medicine, seismology, speech recognition and economics. Matrix Profile (MP) is the state-of-the-art TSA technique, which provides the most similar neighbor to each subsequence of the time series. However, this computation requires a huge amount of floating-point (FP) operations, which are a major contributor ( 50%) to the energy consumption in modern computing platforms. In this sense, Transprecision Computing has recently emerged as a promising approach to improve energy efficiency and performance by using fewer bits in FP operations while providing accurate results.
In this work, we present TraTSA, the first transprecision framework for efficient time series analysis based on MP. TraTSA allows the user to deploy a high-performance and energy-efficient computing solution with the exact precision required by the TSA application. To this end, we first propose implementations of TraTSA for both commodity CPU and FPGA platforms. Second, we propose an accuracy metric to compare the results with the double-precision MP. Third, we study MP’s accuracy when using a transprecision approach. Finally, our evaluation shows that, while obtaining results accurate enough, the FPGA transprecision MP (i) is 22.75 faster than a 72-core server, and (ii) the energy consumption is up to 3.3 lower than the double-precision executions.This work has been supported by the Government of Spain under project PID2019-105396RB-I00, and Junta de Andalucia under projects P18-FR-3433 and UMA18-FEDERJA-197. Funding for open access charge: Universidad de Málaga / CBUA
Projective Ranking-based GNN Evasion Attacks
Graph neural networks (GNNs) offer promising learning methods for
graph-related tasks. However, GNNs are at risk of adversarial attacks. Two
primary limitations of the current evasion attack methods are highlighted: (1)
The current GradArgmax ignores the "long-term" benefit of the perturbation. It
is faced with zero-gradient and invalid benefit estimates in certain
situations. (2) In the reinforcement learning-based attack methods, the learned
attack strategies might not be transferable when the attack budget changes. To
this end, we first formulate the perturbation space and propose an evaluation
framework and the projective ranking method. We aim to learn a powerful attack
strategy then adapt it as little as possible to generate adversarial samples
under dynamic budget settings. In our method, based on mutual information, we
rank and assess the attack benefits of each perturbation for an effective
attack strategy. By projecting the strategy, our method dramatically minimizes
the cost of learning a new attack strategy when the attack budget changes. In
the comparative assessment with GradArgmax and RL-S2V, the results show our
method owns high attack performance and effective transferability. The
visualization of our method also reveals various attack patterns in the
generation of adversarial samples.Comment: Accepted by IEEE Transactions on Knowledge and Data Engineerin
Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation
The computation of the distance of two time series is time-consuming for any
elastic distance function that accounts for misalignments. Among those
functions, DTW is the most prominent. However, a recent extensive evaluation
has shown that the move-split merge (MSM) metric is superior to DTW regarding
the analytical accuracy of the 1-NN classifier. Unfortunately, the running time
of the standard dynamic programming algorithm for MSM distance computation is
, where is the length of the longest time series. In this
paper, we provide approaches to reducing the cost of MSM distance computations
by using lower and upper bounds for early pruning paths in the underlying
dynamic programming table. For the case of one time series being a constant, we
present a linear-time algorithm. In addition, we propose new linear-time
heuristics and adapt heuristics known from DTW to computing the MSM distance.
One heuristic employs the metric property of MSM and the previously introduced
linear-time algorithm. Our experimental studies demonstrate substantial
speed-ups in our approaches compared to previous MSM algorithms. In particular,
the running time for MSM is faster than a state-of-the-art DTW distance
computation for a majority of the popular UCR data sets
- …