Turkish Journal of Electrical Engineering and Computer Sciences, ( ISI ), Volume (28), No (1), Year (2020-9) , Pages (2657-2669)

Title : ( An efficient storage-optimizing tick data clustering model )

Authors: Haleh Amintoosi , Masood Niazi Torshiz , Yahya Forghani , Sara Alinejad ,

Access to full-text not allowed by authors

Citation: BibTeX | EndNote

Abstract

Tick data is a large volume of data, related to a phenomenon such as stock market or weather change, with data values changing rapidly over time. An important issue is to store tick data table in a way that it occupies minimum storage space while at the same time it can provide fast execution of queries. In this paper, a mathematical model is proposed to partition tick data tables into clusters with the aim of minimizing the required storage space. The genetic algorithm is then used to solve the mathematical model which is indeed a clustering model. The proposed method has been evaluated on a real-world weather tick dataset and compared to the storage-optimizing hierarchical agglomerative clustering (SOHAC) algorithm. The experiments show that our proposed method substantially outperforms SOHAC in achieving smaller values for compression ratio while reducing the execution time for small number of clusters.

Keywords

, Tick data, compression, clustering
برای دانلود از شناسه و رمز عبور پرتال پویا استفاده کنید.

@article{paperid:1081395,
author = {Amintoosi, Haleh and Masood Niazi Torshiz and Yahya Forghani and Sara Alinejad},
title = {An efficient storage-optimizing tick data clustering model},
journal = {Turkish Journal of Electrical Engineering and Computer Sciences},
year = {2020},
volume = {28},
number = {1},
month = {September},
issn = {1300-0632},
pages = {2657--2669},
numpages = {12},
keywords = {Tick data; compression; clustering},
}

[Download]

%0 Journal Article
%T An efficient storage-optimizing tick data clustering model
%A Amintoosi, Haleh
%A Masood Niazi Torshiz
%A Yahya Forghani
%A Sara Alinejad
%J Turkish Journal of Electrical Engineering and Computer Sciences
%@ 1300-0632
%D 2020

[Download]