| Title | Recommendation System using optimized Matrix Multiplication Algorithm |
| Publication Type | Conference Paper |
| Year of Publication | 2020 |
| Authors | Rathod, Pawan Manoj, Shende, RajKumar K. |
| Conference Name | 2020 IEEE International Symposium on Sustainable Energy, Signal Processing and Cyber Security (iSSSC) |
| Date Published | dec |
| Keywords | Complexity theory, Coppersmith-Winograd (CW) Algorithm, human factors, matrix factorization, Naïve Algorithm, Optimization, parallel processing, pubcrawl, recommender systems, Resiliency, Scalability, Signal processing, Signal processing algorithms, Strassen Algorithm, Task Analysis, Tools |
| Abstract | Volume, Variety, Velocity, Veracity & Value of data has drawn the attention of many analysts in the last few years. Performance optimization and comparison are the main challenges we face when we talk about the humongous volume of data. Data Analysts use data for activities like forecasting or deep learning and to process these data various tools are available which helps to achieve this task with minimum efforts. Recommendation System plays a crucial role while running any business such as a shopping website or travel agency where the system recommends the user according to their search history, likes, comments, or their past order/booking details. Recommendation System works on various strategies such as Content Filtering, Collaborative Filtering, Neighborhood Methods, or Matrix Factorization methods. For achieving maximum efficiency and accuracy based on the data a specific strategy can be the best case or the worst case for that scenario. Matrix Factorization is the key point of interest in this work. Matrix Factorization strategy includes multiplication of user matrix and item matrix in-order to get a rating matrix that can be recommended to the users. Matrix Multiplication can be achieved by using various algorithms such as Naive Algorithm, Strassen Algorithm, Coppersmith - Winograd (CW) Algorithm. In this work, a new algorithm is proposed to achieve less amount of time and space complexity used in-order for performing matrix multiplication which helps to get the results much faster. By using the Matrix Factorization strategy with various Matrix Multiplication Algorithm we are going to perform a comparative analysis of the same to conclude the proposed algorithm is more efficient. |
| DOI | 10.1109/iSSSC50941.2020.9358891 |
| Citation Key | rathod_recommendation_2020 |
Recommendation System using optimized Matrix Multiplication Algorithm