Skip to main content

Proximate Objects Probabilistic Searching Method

  • Conference paper
  • First Online:
Integrated Computer Technologies in Mechanical Engineering

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bustos, B., Navarro, G., Chavez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn. Lett. 24(14), 2357–2366 (2003)

    Article  Google Scholar 

  2. Batko, M., Falchi, F., Lucchese, C., et al.: Building a web-scale image similarity search system. Multimed. Tools Appl. 3(47), 599–629 (2010)

    Article  Google Scholar 

  3. Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Springer, New York (2006)

    Book  Google Scholar 

  4. Chukhray, A.G.: Quick search method “similar” relational tuples relations. Radioelectron. Comput. Syst. 2(2), 64–69 (2003)

    Google Scholar 

  5. Kulik, A., Chukhray, A., Zavgorodniy, A.: Similar strings detecting methods. In: Proceedings of the East-West Fuzzy Colloquium, pp. 38–47. IPM, Zittau (2005)

    Google Scholar 

  6. Selkow, S.M.: The tree-to-tree editing problem. Inf. Process. Lett. 6(6), 184–186 (1977)

    Article  MathSciNet  Google Scholar 

  7. Tai, K.C.: The tree-to-tree correction problem. J. ACM 26(3), 422–433 (1979)

    Article  MathSciNet  Google Scholar 

  8. 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)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olena Havrylenko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chukhray, A., Havrylenko, O. (2020). Proximate Objects Probabilistic Searching Method. In: Nechyporuk, M., Pavlikov, V., Kritskiy, D. (eds) Integrated Computer Technologies in Mechanical Engineering. Advances in Intelligent Systems and Computing, vol 1113. Springer, Cham. https://doi.org/10.1007/978-3-030-37618-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37618-5_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37617-8

  • Online ISBN: 978-3-030-37618-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics