Skip to main content
Top

2020 | OriginalPaper | Chapter

Proximate Objects Probabilistic Searching Method

Authors : Andrey Chukhray, Olena Havrylenko

Published in: Integrated Computer Technologies in Mechanical Engineering

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The method of objects probabilistic search is developed based on the necessary proximity conditions in a Euclidean space, which were previously proved for the Levenshtein’s metric. The method is based on a random selection of k pivots in Euclidean space among the original objects, projecting all source objects in a k-dimensional Euclidean space, filling special hash data structures, and fast search facilities, similar to the desired, based on proven necessary conditions for the objects proximity in Euclidean space. Experimental studies of the proposed method show the higher speed in comparison with the known method.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Bustos, B., Navarro, G., Chavez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn. Lett. 24(14), 2357–2366 (2003)CrossRef Bustos, B., Navarro, G., Chavez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn. Lett. 24(14), 2357–2366 (2003)CrossRef
2.
go back to reference Batko, M., Falchi, F., Lucchese, C., et al.: Building a web-scale image similarity search system. Multimed. Tools Appl. 3(47), 599–629 (2010)CrossRef Batko, M., Falchi, F., Lucchese, C., et al.: Building a web-scale image similarity search system. Multimed. Tools Appl. 3(47), 599–629 (2010)CrossRef
3.
go back to reference Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Springer, New York (2006)CrossRef Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Springer, New York (2006)CrossRef
4.
go back to reference Chukhray, A.G.: Quick search method “similar” relational tuples relations. Radioelectron. Comput. Syst. 2(2), 64–69 (2003) Chukhray, A.G.: Quick search method “similar” relational tuples relations. Radioelectron. Comput. Syst. 2(2), 64–69 (2003)
5.
go back to reference Kulik, A., Chukhray, A., Zavgorodniy, A.: Similar strings detecting methods. In: Proceedings of the East-West Fuzzy Colloquium, pp. 38–47. IPM, Zittau (2005) Kulik, A., Chukhray, A., Zavgorodniy, A.: Similar strings detecting methods. In: Proceedings of the East-West Fuzzy Colloquium, pp. 38–47. IPM, Zittau (2005)
8.
go back to reference Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. Soc. Ind. Appl. Math. J. Comput. 18(6), 1245–1262 (1989)MathSciNetMATH Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. Soc. Ind. Appl. Math. J. Comput. 18(6), 1245–1262 (1989)MathSciNetMATH
Metadata
Title
Proximate Objects Probabilistic Searching Method
Authors
Andrey Chukhray
Olena Havrylenko
Copyright Year
2020
DOI
https://doi.org/10.1007/978-3-030-37618-5_20

Premium Partners