In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the “fat-factor” which provides a simple way to …
An important problem in accessing and retrieving visual information is to provide efficient similarity matching in large databases. Though much work is being done on the …
Many recent database applications need to deal with similarity queries. For such applications, it is important to measure the similarity between two objects using the distance …
КА Казаков, ВА Семенов - Труды Института системного …, 2016 - cyberleninka.ru
Автоматизация технологически сложных процессов в машиностроении, энергетике, транспорте, медицине, строительстве, а также создание новых продуктов и сервисов …
D Luchi, AL Rodrigues, FM Varejão - Pattern Recognition Letters, 2019 - Elsevier
DBSCAN is a classic clustering method for identifying clusters of different shapes and isolate noisy patterns. Despite these qualities, many articles in the literature address the scalability …
In recent years, the number of sensor and actuator nodes in the Internet of Things (IoT) networks has increased, generating a large amount of data. Most research techniques are …
ML Hetland - Swarm intelligence for multi-objective problems in data …, 2009 - Springer
This chapter describes several methods of similarity search, based on metric indexing, in terms of their common, underlying principles. Several approaches to creating lower bounds …
J Beringer, E Hüllermeier - Intelligent Data Analysis, 2007 - content.iospress.com
The processing of data streams in general and the mining of such streams in particular have recently attracted considerable attention in various research fields. A key problem in stream …
S Mahmoudi, M Daoudi - 2002 International Conference on …, 2002 - ieeexplore.ieee.org
In this work we introduce a new method for indexing 3D models. This method is based on the characterization of 3D objects by a set of 7 characteristic views, including three …