Modified Indexing Algorithm based on Priority Queue in Metric Space for MVP Tree

Vladimir Fomin, I. Aleksandrov, D. Gallyamov, R. Kirichek
{"title":"Modified Indexing Algorithm based on Priority Queue in Metric Space for MVP Tree","authors":"Vladimir Fomin, I. Aleksandrov, D. Gallyamov, R. Kirichek","doi":"10.1145/3440749.3442617","DOIUrl":null,"url":null,"abstract":"The Internet of Things (IoT) algorithms process huge amounts of heterogeneous data in real-time. One of the most computationally intensive tasks using cloud technologies is the task of clustering and classifying data. The authors propose to develop an approach to data classification within the “Query by Similarity” paradigm, which uses the technology of data indexing based on Metric Access Methods (MAM). To improve the performance of data indexing, this paper proposes a similar nearest neighbor search method combining a multiple vantage point tree (MVP) and improved algorithms for processing the priority queue of nodes. The following two algorithms for processing the priority queue of nodes were developed: 1) algorithm for all kinds of points-queries, which makes it possible to take into account parent nodes of all higher levels; 2) algorithm for grouped based on clustering of points-queries by reusing previously obtained search results. Experimental results confirm the effectiveness of the proposed approaches and algorithms.","PeriodicalId":344578,"journal":{"name":"Proceedings of the 4th International Conference on Future Networks and Distributed Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 4th International Conference on Future Networks and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3440749.3442617","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The Internet of Things (IoT) algorithms process huge amounts of heterogeneous data in real-time. One of the most computationally intensive tasks using cloud technologies is the task of clustering and classifying data. The authors propose to develop an approach to data classification within the “Query by Similarity” paradigm, which uses the technology of data indexing based on Metric Access Methods (MAM). To improve the performance of data indexing, this paper proposes a similar nearest neighbor search method combining a multiple vantage point tree (MVP) and improved algorithms for processing the priority queue of nodes. The following two algorithms for processing the priority queue of nodes were developed: 1) algorithm for all kinds of points-queries, which makes it possible to take into account parent nodes of all higher levels; 2) algorithm for grouped based on clustering of points-queries by reusing previously obtained search results. Experimental results confirm the effectiveness of the proposed approaches and algorithms.
基于度量空间优先队列的MVP树改进索引算法
物联网(IoT)算法实时处理大量异构数据。使用云技术计算最密集的任务之一是数据聚类和分类任务。作者提出了一种基于度量访问方法(Metric Access Methods, MAM)的数据索引技术在“相似性查询”范式下进行数据分类的方法。为了提高数据索引的性能,本文提出了一种结合多有利点树(MVP)和改进算法的类似最近邻搜索方法来处理节点的优先级队列。开发了以下两种处理节点优先级队列的算法:1)各种点查询的算法,可以兼顾所有更高层次的父节点;2)基于点查询聚类的分组算法,通过重用先前获得的搜索结果。实验结果验证了所提方法和算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信