Autors: Rangelov, V. N., Trifonov, R. I., Pavlova, G. V.
Title: Strategy for Selecting A Widely-Applicable Algorithm for Finding Semantic Relationships Between Products in The Field of E-Commerce
Keywords: Algorithms for semantic relationship, e-commerce, recommendation algorithms

Abstract: Semantic relationship is the logical connection between the parameters, application, and significance of two or more objects. In this paper, we analyze and select appropriate algorithms for determining semantic relationships in e-commerce, where effective product recommendations are critical for boosting customer trust and increasing sales. The study evaluates several key algorithms, including associative matching, contextual matching, and graph-based methods, in terms of scalability, suitability for dynamic data, resource consumption, and other relevant characteristics. The findings suggest that content-based filtering, the Hungarian algorithm, and the Simplex method are the most promising candidates. Also included are potential improvements through hybrid approaches and iterative refinement. The results provide a structured methodology for selecting optimal algorithms in varying scenarios.

References

  1. Precedence research, Canada, August 2023, code 3221, https://www.precedenceresearch.com/e-commerce-market
  2. Tanmayee Salunke and Unnati Nichite. „Recommender
  3. Maciej Niemirl, Beata Mrugalska,”Basic Product Data in E-Commerce: Specifications and Problems of Data Exchang”, European Research Studies Journal, Special Issue 5, 2021
  4. Emelie Engström, . Per Runeson " Software Product Line Testing - A Systematic Mapping Study", Lund University, Record. 27
  5. Veda C. Storey, “Understanding Semantic Relationships”, VLDB Journal,2, 455-488 (1993)
  6. Muhammad Rizwan, Enoch Jung, “Optimization of Matrix–Matrix Multiplication Algorithm”, 2022 IEEE/ACS 19th, 2022
  7. Moshe Ben-Bassat, Lev Zaidenberg, “Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features”, IEEE, March 1984, ISSN 0162-8828
  8. Antaris Stefanos, Demirtsoglou Georgios, Zisopoulos Xarilaos, Karagiannidis Savvas, “Content-Based Recommendation Systems”, University of Thessaloniki, 2008
  9. Bo Song, “Research on Collaborative Filtering”, Journal of Physics, 2020, ser 012095
  10. H. Bunke, “Recent developments in graph matching”, IEEE Xplore, August 2002, ISBN:0-7695-0750-6
  11. Wang Jianguo, He Peikun, Cao Wei, “Study on the Hungarian algorithm for the maximum likelihood data association problem”, IEEE, 2005, Vol. 18, No. 1
  12. Hédi Nabli, “An overview on the simplex algorithm”, Applied Mathematics and Computation, Volume 210, Issue 2, 15 April 2009

Issue

2024 12th International Scientific Conference on Computer Science, COMSCI 2024 - Proceedings, 2024, , https://doi.org/10.1109/COMSCI63166.2024.10778512

Вид: публикация в международен форум, публикация в реферирано издание, индексирана в Scopus