<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Recommendation System Based on a Compact Hybrid User Model Using Fuzzy Logic Algorithms</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Nina</forename><surname>Khairova</surname></persName>
							<email>khairova.nina@gmail.com</email>
							<affiliation key="aff0">
								<orgName type="institution">National Technical University &quot;Kharkiv Polytechnic Institute&quot;</orgName>
								<address>
									<addrLine>Kyrpychova str. 2</addrLine>
									<postCode>61002</postCode>
									<settlement>Kharkiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Nataliia</forename><surname>Sharonova</surname></persName>
							<email>nvsharonova@ukr.net</email>
							<affiliation key="aff0">
								<orgName type="institution">National Technical University &quot;Kharkiv Polytechnic Institute&quot;</orgName>
								<address>
									<addrLine>Kyrpychova str. 2</addrLine>
									<postCode>61002</postCode>
									<settlement>Kharkiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Dmytro</forename><surname>Sytnikov</surname></persName>
							<email>dmytro.sytnikov@nure.ua</email>
							<affiliation key="aff1">
								<orgName type="institution">Kharkiv National University of Radio Electronics</orgName>
								<address>
									<addrLine>Nauky Ave. 14</addrLine>
									<postCode>61166</postCode>
									<settlement>Kharkiv, City</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Mykyta</forename><surname>Hrebeniuk</surname></persName>
							<email>mykyta.hrebeniuk@nure.ua</email>
							<affiliation key="aff1">
								<orgName type="institution">Kharkiv National University of Radio Electronics</orgName>
								<address>
									<addrLine>Nauky Ave. 14</addrLine>
									<postCode>61166</postCode>
									<settlement>Kharkiv, City</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Polina</forename><surname>Sytnikova</surname></persName>
							<email>polina.sytnikova@nure.ua</email>
							<affiliation key="aff1">
								<orgName type="institution">Kharkiv National University of Radio Electronics</orgName>
								<address>
									<addrLine>Nauky Ave. 14</addrLine>
									<postCode>61166</postCode>
									<settlement>Kharkiv, City</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff2">
								<address>
									<settlement>Lviv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Recommendation System Based on a Compact Hybrid User Model Using Fuzzy Logic Algorithms</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">D41BAF999BB7D0A4510B478F5C9DA2E5</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T19:59+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Recommendation system, fuzzy logic, hybrid feature, compact hybrid user model, fuzzy user model, similarity, fuzzy distance 0000-0002-9826-0286 (N. Khairova)</term>
					<term>0000-0002-8161-552X (N. Sharonova)</term>
					<term>0000-0003-1240-7900 (D. Sytikov)</term>
					<term>0009-0008-0989-7957 (M. Hrebeniuk)</term>
					<term>0000-0002-6688-4641 (P. Sytnikova)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The paper presents algorithm designed to address the challenges of traditional collaborative filtering methods by integrating a compact hybrid user model. This model incorporates hybrid features, demographic information, and fuzzy logic principles to improve recommendation accuracy. A key contribution of this work is the development of an innovative approach for calculating user similarity using fuzzy logic algorithms. By considering fuzzy concepts, the proposed approach effectively captures the inherent uncertainty and imprecision in user preferences, leading to more nuanced and accurate recommendations. Experimental evaluations conducted on the widely used MovieLens dataset provide insights into the performance of the proposed algorithm compared to traditional collaborative filtering techniques such as Pearson correlation and cosine similarity. The dataset, which contains both user ratings and demographic details, serves as a comprehensive testbed for assessing recommendation systems. The results of the experiments demonstrate the superiority of the proposed approach in capturing user similarities and enhancing recommendation accuracy. This paper contributes to the ongoing progress in recommendation systems by proposing a solution that addresses the challenges associated with traditional collaborative filtering methods. Through the integration of hybrid user models, demographic data, and fuzzy logic principles, the proposed algorithm offers a promising approach for enhancing recommendation accuracy across diverse application domains.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>With the proliferation of data-driven technologies and the increasing volume of information across various domains, the demand for efficient recommendation systems has grown substantially. These systems play a vital role in assisting users in discovering relevant items or content based on their preferences and behavior. Collaborative filtering, a widely used approach in recommendation systems, leverages user interactions and similarities to generate personalized recommendations. However, traditional collaborative filtering methods often face challenges related to scalability and accuracy, particularly when dealing with sparse or incomplete data.</p><p>To address these challenges, hybrid recommendation systems have emerged as a promising solution by integrating multiple recommendation techniques, such as collaborative filtering and demographic filtering. By combining collaborative data with demographic information, hybrid systems aim to enhance recommendation accuracy and mitigate sensitivity to data sparsity. Additionally, the incorporation of fuzzy logic allows for a more nuanced representation of user preferences, accommodating the inherently fuzzy nature of human decision-making. This paper explores the development and evaluation of a hybrid recommendation system that integrates collaborative filtering with demographic information and fuzzy logic. The system utilizes a compact user model, incorporating genre interest indicators (GII) derived from user ratings and demographic attributes such as age, gender, and profession. By hybridizing at both the feature and model levels, the system aims to improve recommendation accuracy while maintaining scalability.</p><p>Experimental evaluations are conducted using the MovieLens dataset, comprising user ratings for movies along with demographic information. The performance of the proposed hybrid recommendation system is compared against traditional collaborative filtering methods, including Pearson correlation and cosine similarity. The experiments aim to assess the effectiveness of the fuzzy distance function in capturing user similarities and improving recommendation accuracy.</p><p>Through this research, insights into the efficacy of hybrid recommendation systems and the impact of incorporating fuzzy logic are gained. The findings contribute to advancing the understanding of recommendation system design and optimization, with implications for enhancing user experiences across various applications and domains.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related works</head><p>The landscape of recommender systems has been shaped by extensive research efforts over the past decade, with a focus on improving recommendation accuracy and addressing various challenges <ref type="bibr" target="#b0">[1]</ref>. Collaborative filtering (CF) has remained a cornerstone in recommendation system research, owing to its ability to provide personalized recommendations based on useritem interactions <ref type="bibr" target="#b1">[2]</ref>.</p><p>Hybrid recommendation systems, which integrate multiple recommendation techniques, have emerged as a promising approach to overcome the limitations of individual methods. <ref type="bibr" target="#b2">[3,</ref><ref type="bibr" target="#b3">4]</ref> explores the landscape of hybrid recommender systems, offering insights into different hybridization techniques and identifying trends in hybrid recommender system research. Paper <ref type="bibr" target="#b4">[5]</ref> describes a hybrid music recommendation system that combine collaborative filtering with content-based filtering techniques. By integrating user preferences with item features such as genre and artist, these systems aim to provide more diverse and personalized music recommendations for automated playlist continuation. Another area of exploration involves weighting strategies <ref type="bibr" target="#b5">[6]</ref> for recommender systems that cluster items based on genres. By assigning weights to items within each cluster, these systems aim to enhance recommendation accuracy by giving more importance to relevant genres in the user's preferences. <ref type="bibr" target="#b6">[7]</ref> introduces the concept of genre interest measure (GII), which is a hybrid feature that combines user ratings and movie genres and represents user preferences at the model level.</p><p>Also, an important part of the recommendation system is the calculation of similarity. <ref type="bibr" target="#b7">[8]</ref> has delved into evaluating different similarity measures used in collaborative filtering-based recommender systems. Traditional measures such as Pearson correlation and cosine similarity, as well as more advanced techniques like adjusted cosine similarity and Jaccard coefficient, are reviewed and compared to evaluate their performance in recommendation tasks through experimental comparisons.</p><p>Additionally, the integration of demographic information into recommendation systems has shown promise. Addressing the cold-start problem in recommender systems, another study leverages user demographic attributes to provide personalized recommendations to new users with limited interaction history. By incorporating demographic information such as age, gender, and location into recommendation algorithms, the system aims to mitigate the cold-start problem and offer relevant recommendations <ref type="bibr" target="#b8">[9,</ref><ref type="bibr" target="#b9">10]</ref>. Specifically tailored for movie recommendations, a demographic collaborative recommender system leverages demographic information such as age and gender to enhance collaborative filtering algorithms, offering accurate and personalized movie recommendations to users <ref type="bibr" target="#b9">[10]</ref>.</p><p>The incorporation of fuzzy logic principles into recommendation algorithms has garnered attention for its capacity to model the inherent uncertainty in user preferences. A paper <ref type="bibr" target="#b10">[11]</ref> provides an overview of fuzzy logic techniques applied in recommender systems, discussing how fuzzy logic can address uncertainty and imprecision in user preferences and item attributes. Various fuzzy logic-based recommendation approaches are reviewed, along with their effectiveness in improving recommendation accuracy. By integrating fuzzy logic with CF techniques, as demonstrated in <ref type="bibr" target="#b11">[12,</ref><ref type="bibr" target="#b12">13]</ref>, recommendation accuracy can be improved, highlighting the importance of incorporating fuzzy concepts in user modeling. <ref type="bibr" target="#b13">[14]</ref> addresses this problem by using fuzzy C-means method and comparing its performance against other clustering techniques used in user-based Collaborative filtering recommendation systems. By incorporating fuzzy logic principles, the system offers a more nuanced understanding of user preferences, leading to more accurate recommendations.</p><p>In summary, the integration of collaborative filtering, hybrid recommendation techniques, and fuzzy logic principles has led to significant advancements in recommendation system effectiveness.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Methods and materials</head><p>Formally, we have 𝑀 users, 𝑈 = {𝑢 1 . . . , 𝑢 𝑀 }, explicit or implicit ratings of 𝐾 items, 𝑆 = {𝑠 1 . . . , 𝑠 𝐾 }, such as news, web pages, books, games, or movies. The spaces 𝑆 and 𝑈 are large and can be very large in some cases. Each user 𝑢 𝑖 , where 𝑖 = 1, . . . , 𝑀 rated a subset of items 𝑆 𝑖 . The rating of user 𝑢 𝑐 for item 𝑠 𝑘 , where 𝑘 = 1, . . . , 𝐾 is denoted as 𝑟 𝑐,𝑘 . All available ratings are collected in an 𝑀 × 𝐾 user-item matrix denoted as 𝑅. The architecture of different recommendation systems can be centralized or distributed. In this work, we assume a centralized architecture where the recommendation system is in one specific place.</p><p>During the development of a recommendation system, the following five phases can be identified:</p><p>1. Data collection 2. User model formation 3. Similarity computation 4. Neighbor selection 5. Predictions and recommendations</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">Data collection</head><p>The recommendation system should have as much information as possible about users to provide them with satisfactory results from the very beginning. This information includes user interests, origin, habits, personal data, and other details. Typically, three types of data can be collected from users in addition to product descriptions, namely demographic information during registration, explicit ratings (expressing users' opinions on items) for a subset of available items, and implicit data from user behavior on the service. Implicit ratings relate to the interpretation of user behavior or choice for assigning a rating or preference based on viewing data, purchase history, or other types of information access models. Additionally, the recommendation system should have access to a database of items being evaluated (in our case, movies).</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">User model formation</head><p>Memory-based collaborative filtering is more accurate, but its scalability compared to modelbased recommendation systems is poor. In addition, actual user preferences may not always be captured solely through ratings, and therefore, some item content descriptions are needed. This can be achieved if we build a hybrid user model <ref type="bibr" target="#b2">[3]</ref> that integrates user ratings with some item content descriptions.</p><p>The user-based memory-based collaborative filtering model consists of a vector of elements whose ratings increase as the user interacts with the system over time. This huge amount of data requires a very large space and extremely long processing time. During a query search across the entire database to find the best set of neighbors is computationally expensive. On the other hand, model-based collaborative filtering receives a model from a group of users that may be far from the actual preferences of the users. While memory-based collaborative filtering is simple, it provides recommendations with high accuracy and allows for easy addition of new data, but it is expensive in terms of computation as the size of the input data set increases. Ultimately, the user may leave the website until processing is complete. On the other hand, applying only model-based collaborative filtering to such sparse data, although reducing the cost of online processing, often comes at the price of recommendation accuracy. However, one of the common threats in current recommendation system research is the need to combine recommendation methods to mitigate sparsity and scalability problems. But most common hybridization methods create two separate models and implement an online process for each filtering technique separately. Finally, some merging is used to obtain the result. What if we build a user model according to a certain filtering technique, and then apply another filtering method to the created model? Thus, only one online filtering process (Collaborative filtering) should be used, while another filtering method (Content-based filtering) is used to densify the data. To achieve this, the utilization of hybrid features is proposed.</p><p>In our methodology, we incorporate the concept of Genre Interest Indicator (GII) <ref type="bibr" target="#b5">[6]</ref> to enhance the user model formation process. The GII is a measure of a user's interest in specific genres of items, such as movies. It is calculated based on explicit ratings provided by users for items belonging to different genres. This approach allows us to capture nuanced user preferences beyond simple ratings, enabling the recommendation system to better understand user tastes.</p><p>To implement the GII, we utilize a hybrid approach that combines collaborative filtering with demographic data. Specifically, we leverage explicit user ratings to link users to genres, while also incorporating demographic information such as age, gender, and profession. This hybrid user model provides a more accurate representation of user preferences by considering both explicit ratings and demographic factors.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.1">Combining collaborative and demographic data</head><p>The compact user model described above uses genre interest indicator (GII) to build a model by linking explicit ratings to genres. However, the assertion that two people are similar is based not only on whether they have similar thoughts on a particular topic but also on other factors, such as their background and personal data. In many cases, the ratings claimed by some users are not sufficient to describe them adequately. Therefore, a hybrid user model with age, gender, and professions as demographic information, in addition to GII, may be a good choice for creating more accurate and individual recommendations.</p><p>Combining features of collaborative and demographic filtering allows for considering explicit ratings without relying solely on them, thus reducing the sensitivity of collaborative filtering to the number of ratings <ref type="bibr" target="#b7">[8]</ref>. Conversely, it enables having demographic information about users that would otherwise be unavailable. Moreover, most current hybrid recommendation systems are weighted systems, where the online process is realized for each filter separately and then some merging is used to obtain the final result. In this work, we will attempt to introduce hybridization at two different levels, namely at the model level and at the approach level. Figure <ref type="figure" target="#fig_0">1</ref> illustrates the hybrid user model that we introduce to obtain hybrid collaborative/demographic filtering.   </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.2">Fuzzy user model</head><p>Fuzzy sets were introduced as a generalization of classical crisp sets in order to deal with fuzzy concepts such as "young," "rich," "tall," etc. Instead of the rigid membership of elements in a crisp set (1 if an element belongs to the set and 0 otherwise), a fuzzy set allows elements to have a partial degree of membership, i.e., any value in the interval [0,1]. In the theory of fuzzy sets, a fuzzy subset A of the universe of discourse U is described by a membership function 𝜇 𝐴 (𝑥): 𝑥 ∈ 𝑈 → [0,1], which represents the degree of membership of x in the set A. Fuzzy logic refers to all theories and technologies that use fuzzy sets. For recommendation systems, most user preferences are fuzzy, so fuzzy logic is an appropriate tool for representing these preferences. In these methods, each object is represented by a set of primitive propositions, whose truth is determined in the object space by a value in the interval [0,1]. For example, a proposition could be "This movie is a comedy." The associated value with this proposition indicates the degree to which this movie is a comedy. The crisp description of age and GII in the hybrid user model (Table <ref type="table" target="#tab_1">1</ref>) does not reflect the real case of human decisions. For example, the distance between two users aged 15 and 19 is 4, while both users belong to the same age group, namely teenagers. These fuzzy characteristics need to be taken into account when comparing users. Below we will discuss how to implement the hybrid user model and introduce a fuzzy distance function for finding the nearest neighbors.</p><p>The fuzzy user model will help create a set of neighbors as close as possible to the active user. However, to build a fuzzy model, it is first necessary to label the features of the user model. First of all, age is divided into three fuzzy sets: young, adult, and old (Figure <ref type="figure" target="#fig_1">2</ref>), with the following membership functions: The values of gender and profession are considered as fuzzy points with a membership value of one. Finally, GII is divided into six fuzzy sets, very bad (VB), bad (B), average (AV), good (G), very good (VG), and excellent (E) with the following membership functions (Figure <ref type="figure" target="#fig_2">3</ref>):</p><formula xml:id="formula_0">𝐵 𝑉𝐵 (𝑎) = { 1 − 𝑎 𝑎 ≤ 1 0 𝑎 &gt; 1 (4) 𝐵 𝐴(𝑖) (𝑎) = { 0 𝑎 ≤ 𝑖 − 2, 𝑎 &gt; 𝑖 𝑎 − 𝑖 + 2 𝑖 − 2 &lt; 𝑎 ≤ 𝑖 − 1 𝑖 − 𝑎 𝑖 − 1 &lt; 𝑎 ≤ 𝑖 𝑖 = 2,3,4,5<label>(5)</label></formula><p>Here, 𝐴(𝑖) = 𝐵, 𝐴𝑉, 𝐺, 𝑉𝐺 for 𝑖 = 2,3,4,5 respectively. </p><formula xml:id="formula_1">𝐵 𝐸 (𝑎) = { 0 𝑎 ≤ 4 𝑎 − 4 4 &lt; 𝑎 ≤ 5<label>(6)</label></formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3">Similarity computation</head><p>After building a user model, a recommendation system compares the active user to the available database according to the corresponding similarity function. Based on the calculated similarity values, a connection is established between the active user and other users, allowing the recommendation system to form a set of neighbors for the active user. The choice of similarity function depends on the program and is based on the nature of the user model's features. Some similarity function modifiers have been introduced to refine or enhance the recommendation system's ability to find close neighbors. It should be noted that similarity calculations for collaborative filtering can be performed between items instead of users. This work only discusses user-based methods of similarity (user-to-user similarity), as it is the most popular.</p><p>The similarity between two users is a measure of how similar they are to each other. Formally, the similarity function 𝑠𝑖𝑚(𝒖 𝒙 , 𝒖 𝒚 ) for a set of users 𝑈 is a function with a non-negative value: 𝑠𝑖𝑚: 𝑈 × 𝑈 → 𝑅 + + {0} . Here, we distinguish between 𝑢 𝑥 and 𝒖 𝒙 based on their context. When we use 𝑢 𝑥 , we refer to user-x, while 𝒖 𝒙 represents the feature vector for the user-x model. The similarity function may have some of the following properties:</p><p>(P1) Identity: ∀𝑢 𝑥 ∈ 𝑈, 𝑠𝑖𝑚(𝒖 𝒙 , 𝒖 𝒙 ) &gt; 0 (P2) Positivity: ∀𝑢 𝑥 (≠ 𝑢 𝑦 ) ∈ 𝑈, 𝑠𝑖𝑚(𝒖 𝒙 , 𝒖 𝒚 ) ≥ 0 (P3) Symmetry: ∀𝑢 𝑥 , 𝑢 𝑦 ∈ 𝑈, 𝑠𝑖𝑚(𝒖 𝒙 , 𝒖 𝒚 ) = 𝑠𝑖𝑚(𝒖 𝒚 , 𝒖 𝒙 ) Any function that satisfies (P1) is a similarity function. Although symmetry is a convenient property, it is not satisfied in all programs. Non-negativity is not satisfied for two standard examples: correlation coefficients and scalar products. Different similarity functions 𝑠𝑖𝑚(𝒖 𝒙 , 𝒖 𝒚 ) were used in the study of collaborative filtering between users 𝑢 𝑥 and 𝑢 𝑦 . The most popular similarity function for memory-based collaborative filtering is the Pearson correlation coefficient <ref type="bibr" target="#b6">[7]</ref>, where the similarity between two users is based only on their common ratings 𝑆 𝑥𝑦 . The Pearson correlation coefficient: 𝑠 𝑘 ∈𝑆 𝑥𝑦 𝑠 𝑘 ∈𝑆 𝑥𝑦 <ref type="bibr" target="#b6">(7)</ref> Another similarity function is the cosine similarity function <ref type="bibr" target="#b6">[7]</ref>, which considers two users as two vectors in an |𝑆 𝑥𝑦 | dimensional space.  <ref type="bibr" target="#b7">(8)</ref> On the other hand, dissimilarity is the opposite of similarity and is related to the concept of distance, where two terms are used interchangeably: small distances mean small differences, and large distances mean large differences. Formally, the distance function 𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒚 ) for a set of users 𝑈 is a function 𝑑𝑖𝑠: 𝑈 × 𝑈 → 𝑅 + + {0}. The 𝑑𝑖𝑠 function may have some of the following properties:</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>𝑐𝑜𝑠𝑖𝑛𝑒(𝒖</head><p>(P1) Identity or reflexivity: ∀𝑢 𝑥 ∈ 𝑈, 𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒙 ) = 0 (P2) Positivity: ∀𝑢 𝑥 (≠ 𝑢 𝑦 ) ∈ 𝑈, 𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒚 ) &gt; 0 (P3) Symmetry: ∀𝑢 𝑥 , 𝑢 𝑦 ∈ 𝑈, 𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒚 ) = 𝑑𝑖𝑠(𝒖 𝒚 , 𝒖 𝒙 ) (P4) Uniqueness or definiteness: 𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒚 ) = 0 ⇒ 𝑢 𝑥 = 𝑢 𝑦 (P5) Triangle inequality: ∀𝑢 𝑥 , 𝑢 𝑦, 𝑢 𝑧 ∈ 𝑈, 𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒛 ) ≤ 𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒚 ) + 𝑑𝑖𝑠(𝒖 𝒚 , 𝒖 𝒛 ) Generally, identity and positivity are crucial for determining the correct distance function.</p><p>Obviously, formulas (1) and ( <ref type="formula">2</ref>) are not suitable if the model includes diverse features because these formulas consider only the elements of the joint assessment of both users. The Euclidean distance function provides another way of computing differences for recommendation systems, which considers numerical peculiarities.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>𝑑𝑖𝑠(𝒖 𝒙 , 𝒖</head><formula xml:id="formula_2">𝒚 ) = √ ∑ (𝑥 𝑗 − 𝑦 𝑗 ) 2 𝑛 𝑗=1 (9)</formula><p>, where 𝑥 𝑗 -is the j-th feature of 𝒖 𝒙 , and 𝑛 -is the number of features.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.1">Fuzzy distance function</head><p>Using a fuzzy user model has many advantages, but how can we compare two user models that have many fuzzy features? In general, each function has many fuzzy sets. Actually, the choice of distance function is an important issue for the system and depends largely on the problem itself.</p><p>For the hybrid user model in Figure <ref type="figure" target="#fig_0">1</ref>, a vector with N features represents the user, and therefore, for each function, a local fuzzy distance should be found. Therefore, for each pair of users, we have N local fuzzy distances. The global fuzzy distance could be obtained by two methods. The first method uses the fuzzy IF-THEN rule: IF(𝑥 1 is close to 𝑦 1 ) and (𝑥 2 is close to 𝑦 2 ) ... and (𝑥 𝑁 is close to 𝑦 𝑁 ) THEN (𝒖 𝒙 is similar to 𝒖 𝒚 ). In this case, the global fuzzy distance is defined as:</p><formula xml:id="formula_3">𝑓𝑑𝑖𝑠(𝒖 𝒙 , 𝒖 𝒚 ) = 𝑚𝑖𝑛{𝑓𝑑𝑖𝑠(𝑥 1 , 𝑦 2 ), 𝑓𝑑𝑖𝑠(𝑥 1 , 𝑦 2 ), … , 𝑓𝑑𝑖𝑠(𝑥 𝑁 , 𝑦 𝑁 )} (<label>10</label></formula><formula xml:id="formula_4">)</formula><p>The second method considers each local fuzzy distance as an opinion. The global fuzzy distance is the global opinion of all. An aggregation operator is needed for this in fuzzy logic. The aggregation operator can be the average of N local fuzzy distances.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>𝑓𝑑𝑖𝑠(𝒖 𝒙 , 𝒖</head><formula xml:id="formula_5">𝒚 ) = ∑ 𝑓𝑑𝑖𝑠(𝑥 𝑖 ,𝑦 𝑖 ) 𝑁 𝑖=1 𝑁<label>(11)</label></formula><p>Formula ( <ref type="formula" target="#formula_3">10</ref>) works poorly for the hybrid user model because it considers only the feature with the minimum distance and ignores other features. According to fuzzy set and concept distances, we need a local fuzzy distance metric, 𝑓𝑑𝑖𝑠(𝑥 𝑖 , 𝑦 𝑖 ), which satisfies the following conditions:</p><p>A. Zero value for the same feature values. B. Zero value for different feature values in the same fuzzy set with the same membership values. C. Minimized distance between any two feature values that belong to the same fuzzy set and have close membership values. D. Maximized distance between any two feature values that belong to two different fuzzy sets. Condition (A) is a fundamental requirement for any distance function. To clarify condition (B), let's assume that we have two users who are 40 and 35 years old, respectively. Both users have a membership value of 1 for the "adult" category (Figure <ref type="figure" target="#fig_1">2</ref>). The distance between them is 5, but they are similar users in terms of fuzzy sets. To make the distance between two users zero, we need another term that gives zero value for this and similar cases. What really makes these two users similar is their equal membership values in one fuzzy set. We then define a corresponding fuzzy distance function that satisfies all four above-mentioned conditions.</p><p>Let a and b be the membership vectors corresponding to two crisp values a and b for a given feature with 𝑙 fuzzy sets. The fuzzy distance between a and b is defined as</p><formula xml:id="formula_6">𝑓𝑑𝑖𝑠(𝑎, 𝑏) = 𝑑𝑖𝑠(𝒂, 𝒃) × 𝑑𝑖𝑓(𝑎, 𝑏)<label>(12)</label></formula><p>where 𝑑𝑖𝑓(𝑎, 𝑏) is simply the difference operator, and a and b are vectors of size l, and 𝑑𝑖𝑠(𝒂, 𝒃) is any vector metric distance.</p><p>In this work, the Euclidean distance is used to calculate 𝑑𝑖𝑠(𝒂, 𝒃):</p><formula xml:id="formula_7">𝑑𝑖𝑠(𝒂, 𝒃) = √∑ (𝑎 𝑗 − 𝑏 𝑗 ) 2 𝑙 𝑗=1<label>(13)</label></formula><p>where 𝑎 𝑗 is the membership value of feature a for its fuzzy set j. Example Let's assume we need to calculate the fuzzy distance between two users who have ages: The example results show that formula ( <ref type="formula" target="#formula_6">12</ref>) satisfies all four features for a necessary local function of fuzzy distance. Therefore, for the fuzzy approach, the fuzzy distance function between two users can be aggregated using formula <ref type="bibr" target="#b10">(11)</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4">Neighbor selection</head><p>After calculating similarity values, the system ranks users according to their similarity to the active user to obtain a set of neighbors for them. The size of the neighbor set can be fixed by choosing the first N users or variable by selecting users whose similarity exceeds a certain threshold. This work distinguishes between the set of neighbors and the set of actual recommendations. The output of the neighbor set is the same as mentioned earlier (distance function), and a priority set is used to refine it.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5">Predictions and recommendations</head><p>At this stage, the recommendation system assigns a predicted rating to all items that the set of neighbors sees, rather than the active user. The predicted rating 𝑝𝑟 𝑥,𝑘 indicates the expected interest of item 𝑆 𝑘 to user 𝑢 𝑥 and is usually computed as the sum of the ratings of 𝑢 𝑥 environment for the same item 𝑆 𝑘 :</p><formula xml:id="formula_8">𝑝𝑟 𝑥,𝑘 = ∑ 𝑟 𝑦,𝑘 𝑢 𝑦 ∈𝑁 𝑥 𝑁 𝑥<label>(14)</label></formula><p>where 𝑁 𝑥 denotes the set of neighbors for 𝑢 𝑥 , who rated item 𝑆 𝑘 </p><p>The weighted sum <ref type="bibr" target="#b5">(6)</ref> is the most commonly used aggregation function for predicting ratings. Since users typically use rating scales differently, this prediction formula compensates for variations in the rating scale. This allows maintaining predicted ratings for a given user to be close to the average rating of this active user.</p><p>Based on the predicted ratings of items that have not yet been rated, seen by the neighbors of the active user, the recommendation system sorts them in descending order according to their predicted ratings to form a prediction list for the active user 𝑢 𝑎 .</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>𝑃𝑟𝑒𝑑𝑆𝑒𝑡(𝑢</head><formula xml:id="formula_10">𝑎 ) = {𝑠 𝑘 |𝑠 𝑘 ∈ 𝑆 𝑖 ⊂ 𝑁 𝑎 , 𝑠 𝑘 ∉ 𝑆 𝑎 }<label>(18)</label></formula><p>The rank of item 𝑠 𝑘 in the prediction list 𝑢 𝑎 , 𝑅𝑎𝑛𝑘 𝑢 𝑎 (𝑠 𝑗 ) is the position of item 𝑠 𝑘 in the prediction list for active user 𝑢 𝑎 . Accordingly, we can define the recommendation list 𝑅𝑒𝑐𝑚𝑆𝑒𝑡(𝑢 𝑎 ) for the active user 𝑢 𝑎 as the set of items with the highest rating 𝑁 𝑟 in 𝑃𝑟𝑒𝑑𝑆𝑒𝑡(𝑢 𝑎 ), which is given by:</p><formula xml:id="formula_11">𝑅𝑒𝑐𝑚𝑆𝑒𝑡(𝑢 𝑎 ) = {𝑠 𝑘 |𝑠 𝑘 ∈ 𝑃𝑟𝑒𝑑𝑆𝑒𝑡(𝑢 𝑎 ), 𝑅𝑎𝑛𝑘 𝑢 𝑎 (𝑠 𝑗 ) ≤ 𝑁 𝑟 }<label>(19)</label></formula><p>It is expected that objects with the highest rating will be the most predominant, so the user is likely to explore objects in an ordered list, starting from the top, hoping to find interesting objects.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Experiments</head><p>The experiments were conducted using the Python programming language in the Jupyter Notebook environment as a standalone interface for the analyst. The software product is primarily intended for determining the best locations based on machine learning models. Computation hardware:</p><p>• OS Microsoft Windows 10 </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Results</head><p>In this experiment, we are running a recommendation system using fuzzy distance and comparing its results with classical systems (Pearson correlation and cosine similarity). The size of the neighbor set is kept at 30 for all experiments. In this experiment, we are running the system over the entire database of training users, even if it takes a long time. The difference between gender (profession) values is either 0 if both users have the same gender (profession), or 1 otherwise. This is consistent with our reasoning for establishing opposing values, as far as possible. In addition, a certain normalization is used for age values to ensure that they fall within the same GII range, i.e., <ref type="bibr">[0,</ref><ref type="bibr" target="#b4">5]</ref>. Each age value is multiplied by (5/MAX), where MAX is the oldest user in the system and no younger than 60 years old. The system selects movies from the set of test ratings of the active user one by one. After that, it predicts ratings for them based on the set of all neighbors who rated the same movie. Once the predicted ratings are obtained, the system compares them with the actual ratings provided by the active user. Figures <ref type="figure" target="#fig_9">4-8</ref> show the percentage of correct predictions obtained for fifty active users. Each graph shows the percentage of the number of ratings that the system correctly predicted, out of the total number of available test ratings for the active user.               </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Discussions</head><p>The results of the experiment conducted for each random split of 50 active users and 447 training instances are shown in figures 4-8 and tables 2-11, which depict:</p><p>• a table with the results of calculating the Mean Absolute Error (MAE), which is a measure of the accuracy of the recommendation system, and Coverage <ref type="bibr" target="#b13">[14]</ref>, which is a measure of the percentage of items for which the recommendation system can provide predictions; • a table comparing the developed algorithm with classical algorithms (Pearson correlation and cosine similarity), where the comparison measure is the percentage of correctly predicted ratings for movies from the test dataset for each of the 50 active users. The table shows the number of users belonging to a certain group, where Greater group has a higher percentage of correctly predicted ratings compared to classical methods, Same group has the same percentage, and smaller group has a lower percentage;</p><p>• a graph showing the percentage of correctly predicted ratings using the implemented algorithms for each user. Based on the obtained data, the following conclusions can be drawn:</p><p>• the Mean Absolute Error (MAE) of the developed algorithm is better (smaller) compared to classical approaches, indicating that the deviation of predictions generated by the recommendation system from the true ratings specified by the active user of the recommendation system has decreased; • the percentage of items for which the recommendation system can provide predictions (Coverage) <ref type="bibr" target="#b14">[15]</ref> remained at the same level, and in some cases even increased; • in all 5 runs, the percentage of correctly predicted ratings was higher for most users. Higher prediction values obviously illustrate that a better set of corresponding neighboring users has been found, thus increasing the accuracy of the recommendation system.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Hybrid user model structureAccordingly, the hybrid user model consists of age, gender, and profession as demographic information, and GII for genres, as shown in Table1.</figDesc><graphic coords="5,80.15,72.00,434.91,232.25" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Membership function for the age feature</figDesc><graphic coords="6,72.00,274.50,493.26,119.90" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Membership function for the GII feature</figDesc><graphic coords="6,72.00,616.40,486.75,125.65" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head></head><label></label><figDesc>𝑐𝑜𝑟𝑟(𝒖 𝒙 , 𝒖 𝒚 ) = ∑ (𝑟 𝑥,𝑘 −𝑚 𝑥 )(𝑟 𝑦,𝑘 −𝑚 𝑦 ) 𝑠 𝑘 ∈𝑆 𝑥𝑦 √ ∑ (𝑟 𝑥,𝑘 −𝑚 𝑥 ) 2 ∑ (𝑟 𝑦,𝑘 −𝑚 𝑦 ) 2</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head></head><label></label><figDesc>𝐚 = 〈0,1,0〉, 𝒃 = 〈0,1,0〉. Then 𝑑𝑖𝑠(𝒂, 𝒃) = √(0 − 0) 2 + (1 − 1) 2 + (0 − 0) 2 = 0 𝑑𝑖𝑓(35,40) = 40 − 35 = 5 𝑓𝑑𝑖𝑠(35,40) = 0 × 5 = 0 (similar users) Case b: 𝐚 = 〈0,1,0〉, 𝒃 = 〈0,0,1〉. Then 𝑑𝑖𝑠(𝒂, 𝒃) = √(0 − 0) 2 + (1 − 0) 2 + (0 − 1) 2 = √2 𝑑𝑖𝑓(60,45) = 60 − 45 = 15 𝑓𝑑𝑖𝑠(60,45) = √2 × 15 (opposite users) Case c: 𝐚 = 〈1,0,0〉, 𝒃 = 〈0.8,0.2,0〉. Then 𝑑𝑖𝑠(𝒂, 𝒃) = √(0.8 − 1) 2 + (0.2 − 0) 2 + (0 − 0) 2 = 0.283 𝑑𝑖𝑓(23,18) = 23 − 18 = 5 𝑓𝑑𝑖𝑠(23,18) = 0.283 × 5 (close users)</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Split 1</figDesc><graphic coords="12,72.00,72.00,460.48,150.40" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Split 2</figDesc><graphic coords="12,72.00,329.50,460.48,150.40" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Figure 6 :</head><label>6</label><figDesc>Figure 6: Split 3</figDesc><graphic coords="12,72.00,587.00,463.70,151.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: Split 4</figDesc><graphic coords="13,72.00,153.31,463.70,151.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>Figure 8 :</head><label>8</label><figDesc>Figure 8: Split 5</figDesc><graphic coords="13,72.00,411.91,463.70,151.45" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table</head><label></label><figDesc></figDesc><table /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 1 An example of a hybrid user model</head><label>1</label><figDesc></figDesc><table><row><cell cols="3">№ Gender Age</cell><cell>Profession</cell><cell>Degree</cell><cell>Drama</cell><cell>…</cell><cell>Triller</cell></row><row><cell>1</cell><cell>Male</cell><cell>24</cell><cell cols="2">Programmer Master's</cell><cell>𝐺𝐼𝐼 𝑢 𝑖 (𝐺 1 )</cell><cell>…</cell><cell>𝐺𝐼𝐼 𝑢 𝑖 (𝐺 𝑁 )</cell></row><row><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell><cell>…</cell></row></table><note>1.    </note></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_2"><head></head><label></label><figDesc>𝒙 , 𝒖 𝒚 ) =</figDesc><table><row><cell></cell><cell>∑</cell><cell cols="2">𝑠 𝑘 ∈𝑆 𝑥𝑦</cell><cell cols="2">𝑟 𝑥,𝑘 ×𝑟 𝑦,𝑘</cell></row><row><cell>√ ∑</cell><cell cols="2">𝑠 𝑘 ∈𝑆 𝑥𝑦</cell><cell cols="2">(𝑟 𝑥,𝑘 ) 2 ∑</cell><cell>𝑠 𝑘 ∈𝑆 𝑥𝑦</cell><cell>(𝑟 𝑦,𝑘 ) 2</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_3"><head></head><label></label><figDesc>The multiplier 𝑘 serves as a normalizing coefficient and is typically chosen as 𝑘 = 𝑚 𝑦 -is the average rating of user 𝑢 𝑦 .</figDesc><table><row><cell></cell><cell></cell><cell cols="3">𝑝𝑟 𝑥,𝑘 = 𝑚 𝑥 + 𝑘 ∑ 𝑢 𝑦 ∈𝑁 𝑥</cell><cell>𝑠𝑖𝑚(𝒖 𝒙 , 𝒖 𝒚 ) × (𝑟 𝑦,𝑘 − 𝑚 𝑦 )</cell><cell>(16)</cell></row><row><cell></cell><cell></cell><cell>1</cell><cell></cell></row><row><cell>∑</cell><cell>𝑢 𝑦 ∈𝑁 𝑥</cell><cell>|𝑠𝑖𝑚(𝒖 𝒙 ,𝒖 𝒚 )|</cell><cell></cell></row><row><cell></cell><cell></cell><cell cols="2">𝑚 𝑦 =</cell><cell>1 |𝑆 𝑦 |</cell><cell>∑ 𝑠 𝑘 ∈𝑁𝑆 𝑦</cell><cell>𝑟 𝑦,𝑘</cell></row><row><cell></cell><cell></cell><cell></cell><cell></cell><cell>.</cell></row><row><cell></cell><cell cols="3">Some examples of aggregation functions:</cell></row><row><cell></cell><cell></cell><cell>𝑝𝑟 𝑥,𝑘 = 𝑘 ∑ 𝑢 𝑦 ∈𝑁 𝑥</cell><cell cols="2">𝑠𝑖𝑚(𝒖 𝒙 , 𝒖 𝒚 ) × 𝑟 𝑦,𝑘</cell><cell>(15)</cell></row></table><note>and</note></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_5"><head>Table 2 MAE and Coverage -Split 1</head><label>2</label><figDesc></figDesc><table><row><cell></cell><cell>FD</cell><cell>Cosine</cell><cell>Pearson</cell></row><row><cell>MAE</cell><cell cols="2">0.737490 0.762880</cell><cell>0.763961</cell></row><row><cell cols="3">Coverage 0.989313 0.982093</cell><cell>0.974973</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_6"><head>Table 3 Сomparison of prediction results -Split 1</head><label>3</label><figDesc></figDesc><table><row><cell></cell><cell cols="3">Greater Same Smaller</cell></row><row><cell>FD with Cosine</cell><cell>22</cell><cell>6</cell><cell>22</cell></row><row><cell>FD with Pearson</cell><cell>29</cell><cell>5</cell><cell>16</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_7"><head>Table 4 MAE and Coverage -Split 2</head><label>4</label><figDesc></figDesc><table><row><cell></cell><cell>FD</cell><cell>Cosine</cell><cell>Pearson</cell></row><row><cell>MAE</cell><cell cols="2">0.760839 0.789274</cell><cell>0.787979</cell></row><row><cell cols="3">Coverage 0.984859 0.982352</cell><cell>0.976602</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_8"><head>Table 5 Сomparison of prediction results -Split 2</head><label>5</label><figDesc></figDesc><table><row><cell></cell><cell cols="3">Greater Same Smaller</cell></row><row><cell>FD with Cosine</cell><cell>26</cell><cell>1</cell><cell>23</cell></row><row><cell>FD with Pearson</cell><cell>25</cell><cell>5</cell><cell>20</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_9"><head>Table 6 MAE and Coverage -Split 3</head><label>6</label><figDesc></figDesc><table><row><cell></cell><cell>FD</cell><cell>Cosine</cell><cell>Pearson</cell></row><row><cell>MAE</cell><cell cols="2">0.743868 0.785782</cell><cell>0.788918</cell></row><row><cell cols="3">Coverage 0.980292 0.978136</cell><cell>0.971512</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_10"><head>Table 7 Сomparison of prediction results -Split 3</head><label>7</label><figDesc></figDesc><table><row><cell></cell><cell cols="3">Greater Same Smaller</cell></row><row><cell>FD with Cosine</cell><cell>26</cell><cell>4</cell><cell>20</cell></row><row><cell>FD with Pearson</cell><cell>28</cell><cell>2</cell><cell>20</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_11"><head>Table 8 MAE and Coverage -Split 4</head><label>8</label><figDesc></figDesc><table><row><cell></cell><cell>FD</cell><cell>Cosine</cell><cell>Pearson</cell></row><row><cell>MAE</cell><cell cols="2">0.787537 0.837564</cell><cell>0.832438</cell></row><row><cell cols="3">Coverage 0.987336 0.976205</cell><cell>0.970355</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_12"><head>Table 9 Сomparison of prediction results -Split 4</head><label>9</label><figDesc></figDesc><table><row><cell></cell><cell cols="3">Greater Same Smaller</cell></row><row><cell>FD with Cosine</cell><cell>29</cell><cell>5</cell><cell>16</cell></row><row><cell>FD with Pearson</cell><cell>25</cell><cell>10</cell><cell>15</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_13"><head>Table 10 MAE and Coverage -Split 5</head><label>10</label><figDesc></figDesc><table><row><cell></cell><cell>FD</cell><cell>Cosine</cell><cell>Pearson</cell></row><row><cell>MAE</cell><cell cols="2">0.751824 0.765969</cell><cell>0.768245</cell></row><row><cell cols="3">Coverage 0.975372 0.976775</cell><cell>0.968327</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_14"><head>Table 11 Сomparison of prediction results -Split 5</head><label>11</label><figDesc></figDesc><table><row><cell></cell><cell cols="3">Greater Same Smaller</cell></row><row><cell>FD with Cosine</cell><cell>24</cell><cell>3</cell><cell>23</cell></row><row><cell>FD with Pearson</cell><cell>25</cell><cell>5</cell><cell>20</cell></row></table></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Conclusions</head><p>In this study, we proposed and evaluated a recommendation system that leverages fuzzy logic for both user model formation and similarity computation. The research outcomes indicate several key findings:</p><p>Enhanced user modeling: By incorporating fuzzy logic into the user modeling process, we were able to capture nuanced user preferences beyond simple ratings. The integration of fuzzy sets for demographic attributes and genre interest indicator resulted in a more accurate representation of user tastes.</p><p>Improved similarity computation: The introduction of fuzzy distance metrics facilitated a more robust comparison between user models, considering the partial degree of membership in fuzzy sets. This approach addressed the limitations of traditional distance functions, particularly in handling diverse and imprecise user features.</p><p>Superior recommendation accuracy: Experimental results demonstrated that the recommendation system utilizing fuzzy logic outperformed classical approaches, such as Pearson correlation and cosine similarity. The system achieved lower Mean Absolute Error (MAE) and higher prediction accuracy, indicating its effectiveness in providing personalized recommendations.</p><p>Stable coverage: Despite the introduction of fuzzy logic, the recommendation system maintained stable coverage, ensuring that a wide range of items could be recommended to users. This suggests that the proposed approach strikes a balance between accuracy and coverage, essential for practical recommendation systems.</p><p>In summary, the integration of fuzzy logic in user modeling and distance computation proved to be a promising approach for enhancing recommendation systems' performance.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">A systematic review and research perspective on recommender systems</title>
		<author>
			<persName><forename type="first">D</forename><surname>Roy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dutta</surname></persName>
		</author>
		<idno type="DOI">10.1186/s40537-022-00592-5</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Big Data</title>
		<imprint>
			<biblScope unit="volume">9</biblScope>
			<biblScope unit="issue">59</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Comparative Analysis of Various Collaborative Filtering Algorithms</title>
		<author>
			<persName><forename type="first">P</forename><surname>Dahiya</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Duhan</surname></persName>
		</author>
		<idno type="DOI">10.26438/ijcse/v7i8.347351</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Computer Sciences and Engineering</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="issue">8</biblScope>
			<biblScope unit="page" from="347" to="351" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Hybrid Recommender Systems: A Systematic Literature Review</title>
		<author>
			<persName><forename type="first">E</forename><surname>Çano</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Morisio</surname></persName>
		</author>
		<idno type="DOI">10.3233/IDA-163209</idno>
	</analytic>
	<monogr>
		<title level="j">Intelligent Data Analysis</title>
		<imprint>
			<biblScope unit="volume">21</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page" from="1487" to="1524" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Hybrid Approaches for Customer Segmentation and Product Recommendation</title>
		<author>
			<persName><forename type="first">M</forename><surname>Fauzi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Putra</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">A</forename><surname>Stephanie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><forename type="middle">S</forename><surname>Edbert</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Suhartono</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICIMCIS60089.2023.10348619</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS)</title>
				<meeting>the International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS)</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="324" to="329" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Feature-combination hybrid recommender systems for automated music playlist continuation</title>
		<author>
			<persName><forename type="first">A</forename><surname>Vall</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Dorfer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Eghbal-Zadeh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Schedl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Burjorjee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Widmer</surname></persName>
		</author>
		<idno type="DOI">10.1007/s11257-018-9215-8</idno>
	</analytic>
	<monogr>
		<title level="j">User Modeling and User-Adapted Interaction</title>
		<imprint>
			<biblScope unit="volume">29</biblScope>
			<biblScope unit="page" from="527" to="572" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Weighting Strategies for a Recommender System Using Item Clustering Based on Genres</title>
		<author>
			<persName><forename type="first">S</forename><surname>Fremal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Lecron</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2017.01.031</idno>
	</analytic>
	<monogr>
		<title level="j">Expert Systems with Applications</title>
		<imprint>
			<biblScope unit="volume">77</biblScope>
			<biblScope unit="page" from="105" to="113" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<title level="m" type="main">Recommendation system based on a compact hybrid user model, Automated control systems and automation devices</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">E</forename><surname>Sytnikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">O</forename><surname>Hrebeniuk</surname></persName>
		</author>
		<idno type="DOI">10.20837/0135-1710.2023.179.032</idno>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="volume">179</biblScope>
			<biblScope unit="page" from="32" to="42" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Similarity measures for Collaborative Filtering-based Recommender Systems: Review and experimental comparison</title>
		<author>
			<persName><forename type="first">F</forename><surname>Fkih</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jksuci.2021.09.014</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of King Saud University -Computer and Information Sciences</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="issue">9</biblScope>
			<biblScope unit="page" from="7646" to="7669" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">On Solving Cold Start Problem in Recommender Systems Using Web of Data</title>
		<author>
			<persName><forename type="first">H</forename><surname>Zitouni</surname></persName>
		</author>
		<idno type="DOI">10.1109/PAIS56586.2022.9946899</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Pattern Analysis and Intelligent Systems (PAIS)</title>
				<meeting>the International Conference on Pattern Analysis and Intelligent Systems (PAIS)</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="volume">4</biblScope>
			<biblScope unit="page" from="1" to="8" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Movie Recommendation System for Cold-Start Problem Using User&apos;s Demographic Data</title>
		<author>
			<persName><forename type="first">P</forename><surname>Kumari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Kaur</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Singh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kumar</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICECET58911.2023.10389506</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Electrical, Computer and Energy Technologies (ICECET)</title>
				<meeting>the International Conference on Electrical, Computer and Energy Technologies (ICECET)</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Fuzzy Tools in Recommender Systems: A Survey</title>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">Y</forename><surname>Toledo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Martinez</surname></persName>
		</author>
		<idno type="DOI">10.2991/ijcis.2017.10.1.52</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Computational Intelligence Systems</title>
		<imprint>
			<biblScope unit="volume">10</biblScope>
			<biblScope unit="page" from="776" to="803" />
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Fuzzy Inference System Based Intelligent Food Recommender System</title>
		<author>
			<persName><forename type="first">M</forename><surname>Panwar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sharma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><forename type="middle">P</forename><surname>Mahela</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Khan</surname></persName>
		</author>
		<idno type="DOI">10.1109/ASIANCON58793.2023.10270048</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the Asian Conference on Innovation in Technology (ASIANCON)</title>
				<meeting>the Asian Conference on Innovation in Technology (ASIANCON)</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="1" to="6" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Recommender System in Social Networks using Fuzzy Logic</title>
		<author>
			<persName><forename type="first">F</forename><surname>Kaviani</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICECCME57830.2023.10253120</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Electrical</title>
				<meeting>the International Conference on Electrical</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="1" to="7" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">User based Collaborative Filtering using fuzzy C-means</title>
		<author>
			<persName><forename type="first">H</forename><surname>Koohi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Kiani</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.measurement.2016.05.058</idno>
	</analytic>
	<monogr>
		<title level="j">Measurement</title>
		<imprint>
			<biblScope unit="volume">91</biblScope>
			<biblScope unit="page" from="134" to="139" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Offline and Online Evaluation for Recommender Systems</title>
		<author>
			<persName><forename type="first">K</forename><surname>Najmani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Ajallouda</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>El</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Benlahmar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Sael</surname></persName>
		</author>
		<author>
			<persName><surname>Zellou</surname></persName>
		</author>
		<idno type="DOI">10.1109/ISCV54655.2022.9806059</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the International Conference on Intelligent Systems and Computer Vision (ISCV)</title>
				<meeting>the International Conference on Intelligent Systems and Computer Vision (ISCV)</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
