IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v10y2019i4p1-16.html
   My bibliography  Save this article

Improving the Performance of kNN in the MapReduce Framework Using Locality Sensitive Hashing

Author

Listed:
  • Sikha Bagui

    (University of West Florida, Pensacola, USA)

  • Arup Kumar Mondal

    (University of West Florida, Pensacola, USA)

  • Subhash Bagui

    (University of West Florida, Pensacola, USA)

Abstract

In this work the authors present a parallel k nearest neighbor (kNN) algorithm using locality sensitive hashing to preprocess the data before it is classified using kNN in Hadoop's MapReduce framework. This is compared with the sequential (conventional) implementation. Using locality sensitive hashing's similarity measure with kNN, the iterative procedure to classify a data object is performed within a hash bucket rather than the whole data set, greatly reducing the computation time needed for classification. Several experiments were run that showed that the parallel implementation performed better than the sequential implementation on very large datasets. The study also experimented with a few map and reduce side optimization features for the parallel implementation and presented some optimum map and reduce side parameters. Among the map side parameters, the block size and input split size were varied, and among the reduce side parameters, the number of planes were varied, and their effects were studied.

Suggested Citation

  • Sikha Bagui & Arup Kumar Mondal & Subhash Bagui, 2019. "Improving the Performance of kNN in the MapReduce Framework Using Locality Sensitive Hashing," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 10(4), pages 1-16, October.
  • Handle: RePEc:igg:jdst00:v:10:y:2019:i:4:p:1-16
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJDST.2019100101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdst00:v:10:y:2019:i:4:p:1-16. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.