Skip to main content

Multithreading Approach to Process Real-Time Updates in KNN Algorithms

  • Conference paper
  • First Online:
Networked Systems (NETYS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 10299))

Included in the following conference series:

Abstract

K-Nearest Neighbors algorithm (KNN) is the core of a considerable amount of online services and applications, like recommendation engines, content-classifiers, information retrieval systems, etc. The users of these services change their preferences over time, aggravating the computational challenges of KNN. In this work, we present UpKNN: an efficient thread-based out-of-core approach to take the updates of users preferences into account while it computes the KNN efficiently.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Boutet, A., Frey, D., Guerraoui, R., Kermarrec, A.M., Patra, R.: Hyrec: leveraging browsers for scalable recommenders. In: Middleware (2014)

    Google Scholar 

  2. Boutet, A., Kermarrec, A.M., Mittal, N., Taïani, F.: Being prepared in a sparse world: the case of knn graph construction. In: ICDE (2016)

    Google Scholar 

  3. Chiluka, N., Kermarrec, A.-M., Olivares, J.: The out-of-core KNN awakens: the light side of computation force on large datasets. In: Abdulla, P.A., Delporte-Gallet, C. (eds.) NETYS 2016. LNCS, vol. 9944, pp. 295–310. Springer, Cham (2016). doi:10.1007/978-3-319-46140-3_24

    Chapter  Google Scholar 

  4. Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: WWW (2011)

    Google Scholar 

  5. Lathia, N., Hailes, S., Capra, L., Amatriain, X.: Temporal diversity in recommender systems. In: SIGIR (2010)

    Google Scholar 

  6. Rana, C., Jain, S.: A study of dynamic features of recommender systems. Artif. Intell. Rev. 43, 141–153 (2012)

    Google Scholar 

  7. Yang, C., Yu, X., Liu, Y.: Continuous knn join processing for real-time recommendation. In: ICDM (2014)

    Google Scholar 

  8. Yu, C., Zhang, R., Huang, Y., Xiong, H.: High-dimensional knn joins with incremental updates. Geoinformatica 14(1), 55–82 (2010)

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially funded by Conicyt/Beca Doctorado en el Extranjero Folio 72140173 and Google Focused Award Web Alter-Ego.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Javier Olivares .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kermarrec, AM., Mittal, N., Olivares, J. (2017). Multithreading Approach to Process Real-Time Updates in KNN Algorithms. In: El Abbadi, A., Garbinato, B. (eds) Networked Systems. NETYS 2017. Lecture Notes in Computer Science(), vol 10299. Springer, Cham. https://doi.org/10.1007/978-3-319-59647-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59647-1_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59646-4

  • Online ISBN: 978-3-319-59647-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics