Research Article

COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA

Volume: 7 Number: 3 September 15, 2019
EN TR

COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA

Abstract

The great mobility in the world tourism in recent years has also enabled this sector to be included among the study areas of big data. In this study, a solution proposal was put forward by using the big data and string similarity algorithms (SSA) for the problems arising from the entry of the hotel data coming from different providers into databases with different names and addresses. Therefore, 2599 hotels of a tourism agency with a wide hotel network located in London were selected as the sample, and the Map-Reduce process was performed by using the Soundex algorithm to match these hotels with approximately three million hotel data coming from seventy different providers. Matching with Map-Reduce ensured a significant reduction in process count and process time. Furthermore, the Dice coefficient, Levenshtein and Longest common subsequence (LCS) algorithms were compared in terms of the data that they correctly matched, and process time. In this stage, the words decreasing the score of the algorithms in the database were detected and removed before the algorithms were implemented. The Dice coefficient algorithm yielded better results in terms of correct matching, and the Levenshtein algorithm yielded better results in terms of process time.

Keywords

References

  1. Bakar, Z. A., Sembok, T. M. T., and Yusoff, M., 2000. An evaluation of retrieval effectiveness using spelling-correction and string-similarity matching methods on Malay texts, Journal of the Association for Information Science and Technology, vol. 51, no. 8, pp. 691-706, doi: 10.1002/(SICI)1097-4571(2000)51:8<691: :AID-ASI20>3.0.CO;2-U
  2. Baruah, D., and Mahanta, A. K., 2013. A new similarity measure with length factor for plagiarism detection, International Journal of Computer Applications, vol. 72, no. 14, pp. 14-17.
  3. Baruah, D., and Mahanta, A. K., 2015. Design and development of soundex for assamese language, International Journal of Computer Applications, vol. 117, no. 9, pp. 9-12, doi: 10.5120/20581-3000
  4. Bhatti, Z., Waqas, A., Ismaili, I. A., Hakro, D. N., and Soomro, W. J., 2014. Phonetic based soundex and shapeex algorithm for Sindhi spell checker system, Advances in Environmental Biology, vol. 8, no. 4, pp. 1147-1155.
  5. Bird, S., Klein, E., and Loper, E., 2009. Natural Language Processing with Python. O’Reilly Press, pp. 463.
  6. Cavoukian, A., and Jonas, J., 2012. Privacy by design in the age of big data. Information and Privacy Commissioner of Ontario, Canada, pp. 3.
  7. Chaudhary, A., Wakchoure, N., Gotarne, N., Nath, P., and B., Dhakulkar, 2016. A comparative study on name matching algorithms, International Journal of Research in Advent Technology, vol. 4, no. 5, pp. 127-129.
  8. Chen, X., and Zhou, L., 2015. Design and implementation of an intelligent system for tourist routes recommendation based on Hadoop, 6th IEEE International Conference on Software Engineering and Service Science (ICSESS), Beijing, pp. 774–778. doi: 10.1109/ICSESS.2015.7339171

Details

Primary Language

English

Subjects

Computer Software

Journal Section

Research Article

Publication Date

September 15, 2019

Submission Date

October 3, 2018

Acceptance Date

April 4, 2019

Published in Issue

Year 2019 Volume: 7 Number: 3

APA
Aksoy, B., Uğuz, S., & Oral, O. (2019). COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA. Mühendislik Bilimleri Ve Tasarım Dergisi, 7(3), 608-618. https://doi.org/10.21923/jesd.467036
AMA
1.Aksoy B, Uğuz S, Oral O. COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA. JESD. 2019;7(3):608-618. doi:10.21923/jesd.467036
Chicago
Aksoy, Bekir, Sinan Uğuz, and Okan Oral. 2019. “COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA”. Mühendislik Bilimleri Ve Tasarım Dergisi 7 (3): 608-18. https://doi.org/10.21923/jesd.467036.
EndNote
Aksoy B, Uğuz S, Oral O (September 1, 2019) COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA. Mühendislik Bilimleri ve Tasarım Dergisi 7 3 608–618.
IEEE
[1]B. Aksoy, S. Uğuz, and O. Oral, “COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA”, JESD, vol. 7, no. 3, pp. 608–618, Sept. 2019, doi: 10.21923/jesd.467036.
ISNAD
Aksoy, Bekir - Uğuz, Sinan - Oral, Okan. “COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA”. Mühendislik Bilimleri ve Tasarım Dergisi 7/3 (September 1, 2019): 608-618. https://doi.org/10.21923/jesd.467036.
JAMA
1.Aksoy B, Uğuz S, Oral O. COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA. JESD. 2019;7:608–618.
MLA
Aksoy, Bekir, et al. “COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA”. Mühendislik Bilimleri Ve Tasarım Dergisi, vol. 7, no. 3, Sept. 2019, pp. 608-1, doi:10.21923/jesd.467036.
Vancouver
1.Bekir Aksoy, Sinan Uğuz, Okan Oral. COMPARISON OF THE DATA MATCHING PERFORMANCES OF STRING SIMILARITY ALGORITHMS IN BIG DATA. JESD. 2019 Sep. 1;7(3):608-1. doi:10.21923/jesd.467036

Cited By