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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Strategy for Selecting A Widely-Applicable Algorithm for Finding Semantic Relationships Between Products in The Field of E-Commerce

Galya Pavlova, Roumen Trifonov, Venelin Rangelov
2 links
Big Data and Business Intelligence
article

Strategy for Selecting A Widely-Applicable Algorithm for Finding Semantic Relationships Between Products in The Field of E-Commerce

Galya Pavlova, Roumen Trifonov, Venelin Rangelov
article en

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.

Technical University of Sofia (BG)
Technical University of Sofia
Openalex Percentile: Top 65%
Big Data and Business Intelligence
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Strategy for Selecting A Widely-Applicable Algorithm for Finding Semantic Relationships Between Products in The Field of E-Commerce — Galya Pavlova, Roumen Trifonov, et al. · (2024) | TGRS Research Map | TGRS