Performance analysis for similarity data fusion model for enabling time series indexing in internet of things applications
Mina Younan, Essam H. Houssein, Mohamed Elhoseny and 1 more
PeerJ Computer Science · 2021
doi:10.7717/peerj-cs.500 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The Internet of Things (IoT) has penetrating all things and objects around us giving them the ability to interact with the Internet, i.e., things become Smart Things (SThs). As a result, SThs produce massive real-time data (i.e., big IoT data). Smartness of IoT applications bases mainly on services such as automatic control, events handling, and decision making. Consumers of the IoT services are not only human users, but also SThs. Consequently, the potential of IoT applications relies on supporting services such as searching, retrieving, mining, analyzing, and sharing real-time data. For enhancing search service in the IoT, our previous work presents a promising solution, called Cluster Representative (ClRe), for indexing similar SThs in IoT applications. ClRe algorithms could reduce similar indexing by O(K − 1), where K is number of Time Series (TS) in a cluster. Multiple extensions for ClRe algorithms were presented in another work for enhancing accuracy of indexed data. In this theme, this paper studies performance analysis of ClRe algorithms, proposes two novel execution methods: (a) Linear execution (LE) and (b) Pair-merge execution (PME), and studies sorting impact on TS execution for enhancing similarity rate for some ClRe extensions. The proposed execution methods are evaluated with real examples and proved using Szeged-weather dataset on ClRe 3.0 and its extensions; where they produce representatives with higher similarities compared to the other extensions. Evaluation results indicate that PME could improve performance of ClRe 3.0 by = 20.5%, ClRe 3.1 by = 17.7%, and ClRe 3.2 by = 6.4% in average.
Abstract licence: CC BY
References45
40 more references, whose wording the paper’s licence keeps private.
All 45 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.