國立高雄大學圖資館 |

Language: English

Back

Machine Learning Methods for Recomme...

Kabbur, Santosh.

Machine Learning Methods for Recommender Systems.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Machine Learning Methods for Recommender Systems.
Author:	Kabbur, Santosh.
Description:	100 p.
Notes:	Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
Notes:	Adviser: George Karypis.
Contained By:	Dissertation Abstracts International76-08B(E).
Subject:	Computer science.
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3687065
ISBN:	9781321643268

Machine Learning Methods for Recommender Systems.
Kabbur, Santosh.

Machine Learning Methods for Recommender Systems. - 100 p.

Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.

Thesis (Ph.D.)--University of Minnesota, 2015.

This thesis focuses on machine learning and data mining methods for problems in the area of recommender systems. The presented methods represent a set of computational techniques that produce recommendation of items which are interesting to the target users. These recommendations are made from a large collection of such items by learning preferences from their interactions with the users. This thesis addresses the two primary tasks in recommender systems, namely top-N recommendation and rating prediction. Following methods are developed, (i) an item-based method (FISM) for generating top-N recommendations that learn the item-item similarity matrix as the product of two low dimensional latent factor matrices. These matrices are learned using a structural equation modeling approach, wherein the value being estimated is not used for its own estimation. Since, the effectiveness of existing top-N recommendation methods decreases as the sparsity of the datasets increases, FISM is developed to alleviate the problem of data sparsity, (ii) a new user modeling approach (MPCF), that models the users preference as a combination of global preference and local preference components. Using this user modeling approach, two different methods are proposed based on the manner in which the global preference and local preferences components interact. In the first approach, the global component models the user's common strong preferences on a subset of item features, while the local preferences component models the tradeoffs the users are willing to take on the rest of the item features. In the second approach, the global preference component models the user's common overall preferences on all the item features and the local preferences component models the different tradeoffs the users have on all the item features, thereby helping to fine tune the global preferences. An additional advantage of MPCF is that, the user's global preferences are estimated by taking into account all the observations, thus it can handle sparse data effectively, (iii) a new method called ClustMF which is designed to combine the benefits of the neighborhood models and the latent factor models in a computationally efficient manner. The benefits of latent factor models are utilized by modeling the users and items similar to the standard MF based methods and the benefit of neighborhood models are brought into the model, by introducing biases at the cluster level. That is, the biases for users are modeled at the item cluster level and the biases for items are modeled at the user cluster level. The item-cluster user biases model the baseline score of the user for the items similar to the active item and similarly, the user-cluster item biases model the baseline score of the item from the users similar to the active user.

ISBN: 9781321643268Subjects--Topical Terms:

199325
Computer science.

Machine Learning Methods for Recommender Systems.
LDR:03669nmm a2200277 4500 001 476055
005 20160418090146.5
008 160517s2015 ||||||||||||||||| ||eng d
020 $a 9781321643268
035 $a (MiAaPQ)AAI3687065
035 $a AAI3687065
040 $a MiAaPQ $c MiAaPQ
100 1 $a Kabbur, Santosh. $3 730306
245 1 0 $a Machine Learning Methods for Recommender Systems.
300 $a 100 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
500 $a Adviser: George Karypis.
502 $a Thesis (Ph.D.)--University of Minnesota, 2015.
520 $a This thesis focuses on machine learning and data mining methods for problems in the area of recommender systems. The presented methods represent a set of computational techniques that produce recommendation of items which are interesting to the target users. These recommendations are made from a large collection of such items by learning preferences from their interactions with the users. This thesis addresses the two primary tasks in recommender systems, namely top-N recommendation and rating prediction. Following methods are developed, (i) an item-based method (FISM) for generating top-N recommendations that learn the item-item similarity matrix as the product of two low dimensional latent factor matrices. These matrices are learned using a structural equation modeling approach, wherein the value being estimated is not used for its own estimation. Since, the effectiveness of existing top-N recommendation methods decreases as the sparsity of the datasets increases, FISM is developed to alleviate the problem of data sparsity, (ii) a new user modeling approach (MPCF), that models the users preference as a combination of global preference and local preference components. Using this user modeling approach, two different methods are proposed based on the manner in which the global preference and local preferences components interact. In the first approach, the global component models the user's common strong preferences on a subset of item features, while the local preferences component models the tradeoffs the users are willing to take on the rest of the item features. In the second approach, the global preference component models the user's common overall preferences on all the item features and the local preferences component models the different tradeoffs the users have on all the item features, thereby helping to fine tune the global preferences. An additional advantage of MPCF is that, the user's global preferences are estimated by taking into account all the observations, thus it can handle sparse data effectively, (iii) a new method called ClustMF which is designed to combine the benefits of the neighborhood models and the latent factor models in a computationally efficient manner. The benefits of latent factor models are utilized by modeling the users and items similar to the standard MF based methods and the benefit of neighborhood models are brought into the model, by introducing biases at the cluster level. That is, the biases for users are modeled at the item cluster level and the biases for items are modeled at the user cluster level. The item-cluster user biases model the baseline score of the user for the items similar to the active item and similarly, the user-cluster item biases model the baseline score of the item from the users similar to the active user.
590 $a School code: 0130.
650 4 $a Computer science. $3 199325
650 4 $a Information science. $3 190425
690 $a 0984
690 $a 0723
710 2 $a University of Minnesota. $b Computer Science. $3 730307
773 0 $t Dissertation Abstracts International $g 76-08B(E).
790 $a 0130
791 $a Ph.D.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3687065