A study on matrix factorization and its applications
Matrix factorizations are methods used to factorise a matrix into a product of two or more matrices. Each matrix factorizations have their own properties respectively. Matrix factorization is mostly used in image processing and recommendation systems. Both applications use high dimension matrices to...
| Main Author: | |
|---|---|
| Format: | Final Year Project / Dissertation / Thesis |
| Published: |
2021
|
| Subjects: | |
| Online Access: | http://eprints.utar.edu.my/5079/ http://eprints.utar.edu.my/5079/1/1705957_FYP.pdf |
| _version_ | 1848886322826051584 |
|---|---|
| author | Tang, Adrian Wen Kai |
| author_facet | Tang, Adrian Wen Kai |
| author_sort | Tang, Adrian Wen Kai |
| building | UTAR Institutional Repository |
| collection | Online Access |
| description | Matrix factorizations are methods used to factorise a matrix into a product of two or more matrices. Each matrix factorizations have their own properties respectively. Matrix factorization is mostly used in image processing and recommendation systems. Both applications use high dimension matrices to calculate the result. This is where matrix factorizations are used to reduce dimension of the data set that help in reducing the computational power. In this project, we focus on Singular Value Decomposition (SVD) and Non-Negative Matrix Factorization (NMF) applied in Latent Semantic Indexing (LSI). In order to carry out the project, we first read intensively on other research papers to increase the knowledge related to SVD and NMF. We study the computational steps, properties and application in the real-world problems. Computational steps are important as it serves the basic knowledge to code it in Python. Python also consists of libraries that can be used to calculate the approximated matrix with some parameter tuning. In this project, the application that we focus on is LSI algorithm. LSI is a search algorithm where it returns a set of documents that is related to the keywords that the user searches. It required high computational power to do matrix multiplication. To solve this, we used SVD and NMF methods to reduce the matrix dimension and thus reduce the computational power. SVD performed better than NMF because SVD has the appropriate method to find the dimension to reduce whereas NMF does not have that kind of method. In the future, we can find methods that can improve the current results. |
| first_indexed | 2025-11-15T19:36:39Z |
| format | Final Year Project / Dissertation / Thesis |
| id | utar-5079 |
| institution | Universiti Tunku Abdul Rahman |
| institution_category | Local University |
| last_indexed | 2025-11-15T19:36:39Z |
| publishDate | 2021 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | utar-50792023-01-17T17:51:58Z A study on matrix factorization and its applications Tang, Adrian Wen Kai QA Mathematics Matrix factorizations are methods used to factorise a matrix into a product of two or more matrices. Each matrix factorizations have their own properties respectively. Matrix factorization is mostly used in image processing and recommendation systems. Both applications use high dimension matrices to calculate the result. This is where matrix factorizations are used to reduce dimension of the data set that help in reducing the computational power. In this project, we focus on Singular Value Decomposition (SVD) and Non-Negative Matrix Factorization (NMF) applied in Latent Semantic Indexing (LSI). In order to carry out the project, we first read intensively on other research papers to increase the knowledge related to SVD and NMF. We study the computational steps, properties and application in the real-world problems. Computational steps are important as it serves the basic knowledge to code it in Python. Python also consists of libraries that can be used to calculate the approximated matrix with some parameter tuning. In this project, the application that we focus on is LSI algorithm. LSI is a search algorithm where it returns a set of documents that is related to the keywords that the user searches. It required high computational power to do matrix multiplication. To solve this, we used SVD and NMF methods to reduce the matrix dimension and thus reduce the computational power. SVD performed better than NMF because SVD has the appropriate method to find the dimension to reduce whereas NMF does not have that kind of method. In the future, we can find methods that can improve the current results. 2021 Final Year Project / Dissertation / Thesis NonPeerReviewed application/pdf http://eprints.utar.edu.my/5079/1/1705957_FYP.pdf Tang, Adrian Wen Kai (2021) A study on matrix factorization and its applications. Final Year Project, UTAR. http://eprints.utar.edu.my/5079/ |
| spellingShingle | QA Mathematics Tang, Adrian Wen Kai A study on matrix factorization and its applications |
| title | A study on matrix factorization and its applications |
| title_full | A study on matrix factorization and its applications |
| title_fullStr | A study on matrix factorization and its applications |
| title_full_unstemmed | A study on matrix factorization and its applications |
| title_short | A study on matrix factorization and its applications |
| title_sort | study on matrix factorization and its applications |
| topic | QA Mathematics |
| url | http://eprints.utar.edu.my/5079/ http://eprints.utar.edu.my/5079/1/1705957_FYP.pdf |