scholarly journals Community-Driven Collaborative Recommendation System

2019 ◽  
Vol 8 (4) ◽  
pp. 3722-3726
Keyword(s):  
Recommendation System ◽  
Singular Value ◽  
Daily Lives ◽  
Filtering Method ◽  
Singular Value Decomposition Method ◽  
Collaborative Recommendation ◽  
Value Decomposition ◽  
Movie Ratings ◽  
The Comparative Study ◽  
The Relationship

Recommendation systems (RSs) are an application of community detection, becoming more significant in our daily lives. They play a significant role in suggesting information to users such as products, services, friends and so on. A novel community driven collaborative recommendation system (CDCRS) has been proposed by the authors, in this particular paper. Furthermore, K means approach has been utilized to detect communities and extract the relationship among the users. The singular value decomposition method (SVD) is also applied. Issues of sparsity and scalability of the collaborative method are considered. Experiments were conducted on MovieLens datasets. Movie ratings were predicted and top-k recommendations for the user produced. The comparative study that was performed between the proposed as well as the collaborative filtering method dependent on SVD (CFSVD) as well as the results of experiments shows that CFSVD is outperformed by the proposed CDCRS method.

scholarly journals SISTEM PEREKOMENDASI DENGAN SINGULAR VALUE DECOMPOSITION DAN TEKNIK SIMILARITAS PEARSON CORRELATION

2021 ◽  
Vol 7 (1) ◽  
pp. 19-24
Author(s):  
Rimbun Siringoringo ◽  
◽  
Jamaluddin Jamaluddin ◽  
Gortab Lumbantoruan
Keyword(s):  
Singular Value Decomposition ◽  
Recommendation System ◽  
Product Information ◽  
Pearson Correlation ◽  
Information Filtering ◽  
Singular Value ◽  
Reference Dataset ◽  
Singular Value Decomposition Method ◽  
Intelligent Information ◽  
Value Decomposition

The growth of e-commerce has resulted in massive product information and huge volumes of data. This results in data overload problems. In the case of e-commerce, consumers or users spend a lot of time choosing the goods they need. The urgent question to be answered at this time is how to provide solutions related to intelligent information restrictions so that the existing information is truly information that is by preferences and needs. This research performs information filtering by applying the singular value decomposition method and the Pearson similarity technique to the book recommendation system. The data used is the Book-Crossing Dataset which is the reference dataset for many research recommendation systems. The resulting recommendations are then compared with e-commerce recommendations such as amazom.com. Based on the results of the study obtained data that the results of the recommendations in this study are very good and accurate.

scholarly journals Recommendation System Using Autoencoders

2020 ◽  
Vol 10 (16) ◽  
pp. 5510 ◽  
Author(s):  
Diana Ferreira ◽  
Sofia Silva ◽  
António Abelha ◽  
José Machado
Keyword(s):  
Collaborative Filtering ◽  
Recommendation System ◽  
Mean Squared Error ◽  
Singular Value ◽  
High Dimensions ◽  
Data Sparsity ◽  
Filtering Method ◽  
Squared Error ◽  
Sparsity Problem ◽  
Value Decomposition

The magnitude of the daily explosion of high volumes of data has led to the emergence of the Big Data paradigm. The ever-increasing amount of information available on the Internet makes it increasingly difficult for individuals to find what they need quickly and easily. Recommendation systems have appeared as a solution to overcome this problem. Collaborative filtering is widely used in this type of systems, but high dimensions and data sparsity are always a main problem. With the idea of deep learning gaining more importance, several works have emerged to improve this type of filtering. In this article, a product recommendation system is proposed where an autoencoder based on a collaborative filtering method is employed. A comparison of this model with the Singular Value Decomposition is made and presented in the results section. Our experiment shows a very low Root Mean Squared Error (RMSE) value, considering that the recommendations presented to the users are in line with their interests and are not affected by the data sparsity problem as the datasets are very sparse, 0.996. The results are quite promising achieving an RMSE value of 0.029 in the first dataset and 0.010 in the second one.

scholarly journals Distributed Singular Value Decomposition Method for Fast Data Processing in Recommendation Systems

Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2284
Author(s):  
Krzysztof Przystupa ◽  
Mykola Beshley ◽  
Olena Hordiichuk-Bublivska ◽  
Marian Kyryk ◽  
Halyna Beshley ◽  
...  
Keyword(s):  
Distributed Systems ◽  
Singular Value Decomposition ◽  
Data Processing ◽  
Message Passing ◽  
Message Passing Interface ◽  
Recommendation Systems ◽  
Singular Value ◽  
Singular Value Decomposition Method ◽  
Value Decomposition ◽  
Svd Method

The problem of analyzing a big amount of user data to determine their preferences and, based on these data, to provide recommendations on new products is important. Depending on the correctness and timeliness of the recommendations, significant profits or losses can be obtained. The task of analyzing data on users of services of companies is carried out in special recommendation systems. However, with a large number of users, the data for processing become very big, which causes complexity in the work of recommendation systems. For efficient data analysis in commercial systems, the Singular Value Decomposition (SVD) method can perform intelligent analysis of information. With a large amount of processed information we proposed to use distributed systems. This approach allows reducing time of data processing and recommendations to users. For the experimental study, we implemented the distributed SVD method using Message Passing Interface, Hadoop and Spark technologies and obtained the results of reducing the time of data processing when using distributed systems compared to non-distributed ones.

Dynamic contraction and fatigue analysis in biceps brachii muscles using synchrosqueezed wavelet transform and singular value features

2021 ◽  
pp. 095441192110480
Author(s):  
Lakshmi M Hari ◽  
Gopinath Venugopal ◽  
Swaminathan Ramakrishnan
Keyword(s):  
Wavelet Transform ◽  
Biceps Brachii ◽  
Singular Value ◽  
Time Frequency ◽  
Singular Value Decomposition Method ◽  
Dynamic Contractions ◽  
Synchrosqueezed Wavelet Transform ◽  
Value Decomposition ◽  
Neuromuscular Conditions ◽  
Semg Signals

In this study, the dynamic contractions and the associated fatigue condition in biceps brachii muscle are analysed using Synchrosqueezed Wavelet Transform (SST) and singular value features of surface Electromyography (sEMG) signals. For this, the recorded signals are decomposed into time-frequency matrix using SST. Two analytic functions namely Morlet and Bump wavelets are utilised for the analysis. Singular Value Decomposition method is applied to this time-frequency matrix to derive the features such as Maximum Singular Value (MSV), Singular Value Entropy (SVEn) and Singular Value Energy (SVEr). The results show that both these wavelets are able to characterise nonstationary variations in sEMG signals during dynamic fatiguing contractions. Increase in values of MSV and SVEr with the progression of fatigue denotes the presence of nonstationarity in the sEMG signals. The lower values of SVEn with the progression of fatigue indicate the randomness in the signal. Thus, it appears that the proposed approach could be used to characterise dynamic muscle contractions under varied neuromuscular conditions.

scholarly journals A modified truncation singular value decomposition method for solving ill-posed problems

2018 ◽  
Vol 13 ◽  
pp. 174830181881360 ◽  
Author(s):  
Zhenyu Zhao ◽  
Riguang Lin ◽  
Zehong Meng ◽  
Guoqiang He ◽  
Lei You ◽  
...  
Keyword(s):  
Singular Value Decomposition ◽  
Decomposition Method ◽  
Singular Value ◽  
Numerical Results ◽  
New Method ◽  
Truncated Singular Value Decomposition ◽  
Singular Value Decomposition Method ◽  
Ill Posed ◽  
Value Decomposition

A modified truncated singular value decomposition method for solving ill-posed problems is presented in this paper, in which the solution has a slightly different form. Both theoretical and numerical results show that the limitations of the classical TSVD method have been overcome by the new method and very few additive computations are needed.

Sign in / Sign up

Export Citation Format

Share Document