Strategy for Selecting A Widely-Applicable Algorithm for Finding Semantic Relationships Between Products in The Field of E-Commerce
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.
Authors
- Galya Pavlova (ORCID: https://orcid.org/0009-0006-1114-0246)
- Roumen Trifonov (ORCID: https://orcid.org/0000-0001-6959-3367)
- Venelin Rangelov
Institutions
- Technical University of Sofia (BG)
Publication Details
- Published
- 2024-09-13
- DOI
- https://doi.org/10.1109/comsci63166.2024.10778512
- Primary Topic
- Big Data and Business Intelligence
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Technical University of Sofia