A Combinative Similarity Computing Measure for Collaborative Filtering

2013 ◽  
Vol 347-350 ◽  
pp. 2919-2925 ◽  
Author(s):  
Lin Guo ◽  
Qin Ke Peng
Keyword(s):  
Collaborative Filtering ◽  
Similarity Measure ◽  
Pearson Correlation ◽  
Similarity Measures ◽  
Cosine Similarity ◽  
Computation Complexity ◽  
Satisfactory Performance ◽  
Similarity Method

Similarity method is the key of the user-based collaborative filtering recommend algorithm. The traditional similarity measures, which cosine similarity, adjusted cosine similarity and Pearson correlation similarity are included, have some advantages such as simple, easy and fast, but with the sparse dataset they may lead to bad recommendation quality. In this article, we first research how the recommendation qualities using the three similarity methods respectively change with the different sparse datasets, and then propose a combinative similarity measure considering the account of items users co-rated. Compared with the three algorithms, our method shows its satisfactory performance with the same computation complexity.

scholarly journals A New Semantic Similarity Measure Based On Ontology for Movie Rate Prediction

2019 ◽  
Vol 8 (3) ◽  
pp. 6756-6762
Keyword(s):  
Semantic Similarity ◽  
Similarity Measure ◽  
Experimental Evaluation ◽  
Pearson Correlation ◽  
Similarity Measures ◽  
Similarity Score ◽  
Cosine Similarity ◽  
Semantic Similarity Measure ◽  
Rate Prediction ◽  
Target User

A recommendation algorithm comprises of two important steps: 1) Predicting rates, and 2) Recommendation. Rate prediction is a cumulative function of the similarity score between two movies and rate history of those movies by other users. There are various methods for rate prediction such as weighted sum method, regression, deviation based etc. All these methods rely on finding similar items to the items previously viewed/rated by target user, with assumption that user tends to have similar rating for similar items. Computing the similarities can be done using various similarity measures such as Euclidian Distance, Cosine Similarity, Adjusted Cosine Similarity, Pearson Correlation, Jaccard Similarity etc. All of these well-known approaches calculate similarity score between two movies using simple rating based data. Hence, such similarity measures could not accurately model rating behavior of user. In this paper, we will show that the accuracy in rate prediction can be enhanced by incorporating ontological domain knowledge in similarity computation. This paper introduces a new ontological semantic similarity measure between two movies. For experimental evaluation, the performance of proposed approach is compared with two existing approaches: 1) Adjusted Cosine Similarity (ACS), and 2) Weighted Slope One (WSO) algorithm, in terms of two performance measures: 1) Execution time and 2) Mean Absolute Error (MAE). The open-source Movielens (ml-1m) dataset is used for experimental evaluation. As our results show, the ontological semantic similarity measure enhances the performance of rate prediction as compared to the existing-well known approaches.

scholarly journals Research on the Application of User Recommendation Based on the Fusion Method of Spatially Complex Location Similarity

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Lili Wang ◽  
Ting Shi ◽  
Shijin Li
Keyword(s):  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recall Rate ◽  
Cosine Similarity ◽  
Fusion Method ◽  
Complex Matrix ◽  
Recommendation Algorithm ◽  
Kl Divergence ◽  
Experimental Effect ◽  
User Recommendation

Since the user recommendation complex matrix is characterized by strong sparsity, it is difficult to correctly recommend relevant services for users by using the recommendation method based on location and collaborative filtering. The similarity measure between users is low. This paper proposes a fusion method based on KL divergence and cosine similarity. KL divergence and cosine similarity have advantages by comparing three similar metrics at different K values. Using the fusion method of the two, the user’s similarity with the preference is reused. By comparing the location-based collaborative filtering (LCF) algorithm, user-based collaborative filtering (UCF) algorithm, and user recommendation algorithm (F2F), the proposed method has the preparation rate, recall rate, and experimental effect advantage. In different median values, the proposed method also has an advantage in experimental results.

scholarly journals Cognitive Similarity-Based Collaborative Filtering Recommendation System

2020 ◽  
Vol 10 (12) ◽  
pp. 4183 ◽  
Author(s):  
Luong Vuong Nguyen ◽  
Min-Sung Hong ◽  
Jason J. Jung ◽  
Bong-Soo Sohn
Keyword(s):  
Performance Evaluation ◽  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommendation System ◽  
Pearson Correlation ◽  
Cognitive Network ◽  
Data Set ◽  
New Approach ◽  
Layered Architecture ◽  
F Measure

This paper provides a new approach that improves collaborative filtering results in recommendation systems. In particular, we aim to ensure the reliability of the data set collected which is to collect the cognition about the item similarity from the users. Hence, in this work, we collect the cognitive similarity of the user about similar movies. Besides, we introduce a three-layered architecture that consists of the network between the items (item layer), the network between the cognitive similarity of users (cognition layer) and the network between users occurring in their cognitive similarity (user layer). For instance, the similarity in the cognitive network can be extracted from a similarity measure on the item network. In order to evaluate our method, we conducted experiments in the movie domain. In addition, for better performance evaluation, we use the F-measure that is a combination of two criteria P r e c i s i o n and R e c a l l . Compared with the Pearson Correlation, our method more accurate and achieves improvement over the baseline 11.1% in the best case. The result shows that our method achieved consistent improvement of 1.8% to 3.2% for various neighborhood sizes in MAE calculation, and from 2.0% to 4.1% in RMSE calculation. This indicates that our method improves recommendation performance.

scholarly journals Implementasi Algoritma TF-IDF Pada Pengukuran Kesamaan Dokumen

2017 ◽  
Vol 1 (1) ◽  
pp. 53 ◽  
Author(s):  
Sri Andayani ◽  
Ady Ryansyah
Keyword(s):  
Similarity Measure ◽  
Processing Time ◽  
Similarity Measures ◽  
Cosine Similarity ◽  
Vector Representation ◽  
Document Collection ◽  
Pdf Format ◽  
Word Format

Documents similarity measure is a time consuming problem. The large amount of documents and the large number of pages per document are causing the similarity measures to becomes a complicated and hard job to do manually. In this research, a system that can automatically measuring similarity between documents is built by implementing TF-IDF. Measurements are carried by first creating a vector representation of documents being compared. This vector representation containing the weight of each term in the documents. After that, the similarity value are calculated using cosine similarity. The finished system can carry out comparison of documents in pdf or word format. Document comparison can be done using all the chapters in the report, or just a few selected chapters that are considered significant. Based on experiment, it can be concluded that TF-IDF needs at least three documents to be available in the document collection being processes. The test of correlation shows that for document in pdf format, there is a significant correlation between the amount of characters in the document with the processing time.

scholarly journals Similarity measures for Fermatean fuzzy sets and its applications in group decision-making

2022 ◽  
Vol 11 (2) ◽  
pp. 167-180
Author(s):  
Laxminarayan Sahoo
Keyword(s):  
Decision Making ◽  
Pattern Recognition ◽  
Fuzzy Sets ◽  
Similarity Measure ◽  
Group Decision Making ◽  
Group Decision ◽  
Similarity Measures ◽  
Cosine Similarity ◽  
Future Research ◽  
Uncertain Information

The intention of this paper is to propose some similarity measures between Fermatean fuzzy sets (FFSs). Firstly, we propose some score based similarity measures for finding similarity measures of FFSs and also propose score based cosine similarity measures between FFSs. Furthermore, we introduce three newly scored functions for effective uses of Fermatean fuzzy sets and discuss some relevant properties of cosine similarity measure. Fermatean fuzzy sets introduced by Senapati and Yager can manipulate uncertain information more easily in the process of multi-criteria decision making (MCDM) and group decision making. Here, we investigate score based similarity measures of Fermatean fuzzy sets and scout the uses of FFSs in pattern recognition. Based on different types of similarity measures a pattern recognition problem viz. personnel appointment is presented to describe the use of FFSs and its similarity measure as well as scores. The counterfeit results show that the proposed method is more malleable than the existing method(s). Finally, concluding remarks and the scope of future research of the proposed approach are given.

A new similarity measure for vector space models in text classification and information retrieval

2020 ◽  
pp. 016555152096805
Author(s):  
Mete Eminagaoglu
Keyword(s):  
Information Retrieval ◽  
Vector Space ◽  
Similarity Measure ◽  
Text Classification ◽  
Pearson Correlation ◽  
Clustering Algorithms ◽  
Similarity Measures ◽  
Manhattan Distance ◽  
Vector Space Models ◽  
Classification Information

There are various models, methodologies and algorithms that can be used today for document classification, information retrieval and other text mining applications and systems. One of them is the vector space–based models, where distance metrics or similarity measures lie at the core of such models. Vector space–based model is one of the fast and simple alternatives for the processing of textual data; however, its accuracy, precision and reliability still need significant improvements. In this study, a new similarity measure is proposed, which can be effectively used for vector space models and related algorithms such as k-nearest neighbours ( k-NN) and Rocchio as well as some clustering algorithms such as K-means. The proposed similarity measure is tested with some universal benchmark data sets in Turkish and English, and the results are compared with some other standard metrics such as Euclidean distance, Manhattan distance, Chebyshev distance, Canberra distance, Bray–Curtis dissimilarity, Pearson correlation coefficient and Cosine similarity. Some successful and promising results have been obtained, which show that this proposed similarity measure could be alternatively used within all suitable algorithms and models for information retrieval, document clustering and text classification.

scholarly journals The Intuitionistic Fuzzy Linguistic Cosine Similarity Measure and Its Application in Pattern Recognition

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Donghai Liu ◽  
Xiaohong Chen ◽  
Dan Peng
Keyword(s):  
Similarity Measure ◽  
Similarity Measures ◽  
Cosine Similarity ◽  
Intuitionistic Fuzzy ◽  
Linguistic Term ◽  
Cosine Similarity Measure ◽  
Linguistic Scale Function ◽  
Cosine Similarity Measures ◽  
Fuzzy Linguistic ◽  
Interval Valued

We propose the cosine similarity measures for intuitionistic fuzzy linguistic sets (IFLSs) and interval-valued intuitionistic fuzzy linguistic sets (IVIFLSs), which are expressed by the linguistic scale function based on the cosine function. Then, the weighted cosine similarity measure and the ordered weighted cosine similarity measure for IFLSs and IVIFLSs are introduced by taking into account the importance of each element, and the properties of the cosine similarity measures are also given. The main advantage of the proposed cosine similarity measures is that the decision-makers can flexibly select the linguistic scale function depending on the actual semantic situation. Finally, we present the application of the cosine similarity measures for intuitionistic fuzzy linguistic term sets and interval-valued intuitionistic fuzzy linguistic term sets to pattern recognition and medical diagnosis, and the existing cosine similarity measures are compared with the proposed cosine similarity measures by the illustrative example.

An Enhanced Similarity Measure Used in Personalized Recommendation Algorithms

2010 ◽  
Vol 159 ◽  
pp. 671-675 ◽  
Author(s):  
Song Jie Gong
Keyword(s):  
Collaborative Filtering ◽  
Similarity Measure ◽  
Recommendation System ◽  
Pearson Correlation ◽  
Recommendation Systems ◽  
Personalized Recommendation ◽  
Rating Data ◽  
Measure Methods ◽  
Collaborative Filtering Algorithm

Personalized recommendation systems combine the data mining technology with users browse profile and provide recommendation set to user forecasted by their interests. Collaborative filtering algorithm is one of the most successful methods for building personalized recommendation system, and is extensively used in many fields to date. With the development of E-commerce, the magnitudes of users and items grow rapidly, resulting in the extreme sparsity of user rating data. Traditional similarity measure methods work poor in this situation, make the quality of recommendation system decreased dramatically. To alleviate the problem, an enhanced Pearson correlation similarity measure method is introduced in the personalized collaborative filtering recommendation algorithm. The approach considers the common correlation rating of users. The recommendation using the enhanced similarity measure can improve the neighbors influence in the course of recommendation and enhance the accuracy and the quality of recommendation systems effectively.

scholarly journals Cosine Similarity Measure of Complex Fuzzy Sets and Robustness of Complex Fuzzy Connectives

2020 ◽  
Vol 2020 ◽  
pp. 1-9
Author(s):  
Wenping Guo ◽  
Lvqing Bi ◽  
Bo Hu ◽  
Songsong Dai
Keyword(s):  
Similarity Measure ◽  
Fuzzy Set ◽  
Fuzzy Inference ◽  
Similarity Measures ◽  
Cosine Similarity ◽  
Invariance Properties ◽  
Cosine Similarity Measure ◽  
Cosine Similarity Measures ◽  
Complex Valued ◽  
Fuzzy Connectives

Complex fuzzy set (CFS), as a generalization of fuzzy set (FS), is characterized by complex-valued membership degrees. By considering the complex-valued membership degree as a vector in the complex unit disk, we introduce the cosine similarity measures between CFSs. Then, we investigate some invariance properties of the cosine similarity measure. Finally, the cosine similarity measure is applied to measure the robustness of complex fuzzy connectives and complex fuzzy inference.

Sign in / Sign up

Export Citation Format

Share Document