Autors: Rangelov, V. N., Trifonov, R. I., Pavlova, G. V.
Title: Overview of Existing Algorithms for Determining Semantic Correlation Between Products
Keywords: Algorithms for semantic relationship, associative matching, contextual matching

Abstract: Semantic relationships refer to the logical connections between the attributes, applications, and significance of two or more objects. This study focuses on products offered for online sale, exploring the algorithms used to determine these relationships. The primary objective is to identify effective methods for tasks such as suggesting related items, categorizing products, and identifying substitutes and accessories. This paper reviews key algorithms and their practical applications across different scenarios. The study concludes that while associative and contextual matching algorithms each have their strengths, graph matching provides unique advantages in specific contexts. These findings are crucial for enhancing product recommendations and improving the user experience in e-commerce platforms.

References

  1. Precedence research, Canada, August 2023, code 3221, https://www.precedenceresearch.com/e-commerce-market
  2. R. Agrawal and R. Srikant. „Fast algorithms for mining association rules“, VLDB, p. 487-499, Santiago, Chile, September 1994
  3. Bayardo Jr, Roberto J. (1998). "Efficiently mining long patterns from databases", ACM SIGMOD Record. 27
  4. J. Han, J. Pei, and Y Yin, “Mining Frequent Patterns without Candidate Generation”, Simon Fraser University
  5. M.S. Mythili, “International Journal of Computer Applications (0975 – 8887) Volume 79 – No10, October 2013 34 Performance Evaluation of Apriori and FP-Growth Algorithms”, Volume 79 – No 10, October 2013
  6. Moshe Ben-Bassat, Lev Zaidenberg, “Contextual Template Matching: A Distance Measure for Patterns with Hierarchically Dependent Features”, IEEE, March 1984, ISSN 0162-8828
  7. Antaris Stefanos, Demirtsoglou Georgios, Zisopoulos Xarilaos, Karagiannidis Savvas, “Content-Based Recommendation Systems”, University of Thessaloniki, 2008
  8. Bo Song, “Research on Collaborative Filtering”, Journal of Physics, 2020, ser 012095
  9. Yang Chen, Dan Li, Zhongguo Zhao, “Research on Product Recommendation and Consumer”, ICSSED 2020, volume 427
  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
  13. Vincenzo Carletti, “Comparing performance of graph matching algorithms on huge graphs”, 2017, University of Salerno, Italy

Issue

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

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