Using social graphs in one-class collaborative filtering problem

Download

index.pdf

Date

2009

Author

Kaya, Hamza

Metadata

Show full item record

Item Usage Stats

26
views

18
downloads

One-class collaborative filtering is a special type of collaborative filtering methods that aims to deal with datasets that lack counter-examples. In this work, we introduced social networks as a new data source to the one-class collaborative filtering (OCCF) methods and sought ways to benefit from them when dealing with OCCF problems. We divided our research into two parts. In the first part, we proposed different weighting schemes based on social graphs for some well known OCCF algorithms. One of the weighting schemes we proposed outperformed our baselines for some of the datasets we used. In the second part, we focused on the dataset differences in order to find out why our algorithm performed better on some of the datasets. We compared social graphs with the graphs of users and their neighbors generated by the k-NN algorithm. Our research showed that social graphs generated from a specialized domain better improves the recommendation performance than the social graphs generated from a more generic domain.

Subject Keywords

Computer enginnering., Computer software.

URI

http://etd.lib.metu.edu.tr/upload/12611131/index.pdf
https://hdl.handle.net/11511/18945

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Improving search result clustering by integrating semantic information from Wikipedia Çallı, Çağatay; Üçoluk, Göktürk; Şehitoğlu, Onur Tolga; Department of Computer Engineering (2010) Suffix Tree Clustering (STC) is a search result clustering (SRC) algorithm focused on generating overlapping clusters with meaningful labels in linear time. It showed the feasibility of SRC but in time, subsequent studies introduced description-first algorithms that generate better labels and achieve higher precision. Still, STC remained as the fastest SRC algorithm and there appeared studies concerned with different problems of STC. In this thesis, semantic relations between cluster labels and documents ar...
Learning cooperation in hunter-prey problem via state abstraction İşçen, Atıl; Polat, Faruk; Department of Computer Engineering (2009) Hunter-Prey or Prey-Pursuit problem is a common toy domain for Reinforcement Learning, but the size of the state space is exponential in the parameters such as size of the grid or number of agents. As the size of the state space makes the flat Q-learning impossible to use for different scenarios, this thesis presents an approach to make the size of the state space constant by producing agents that use previously learned knowledge to perform on bigger scenarios containing more agents. Inspired from HRL metho...
Data integration over horizontally partitioned databases in service-oriented data grids Sunercan, Hatice Kevser Sönmez; Çiçekli, Fehime Nihan; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2010) Information integration over distributed and heterogeneous resources has been challenging in many terms: coping with various kinds of heterogeneity including data model, platform, access interfaces; coping with various forms of data distribution and maintenance policies, scalability, performance, security and trust, reliability and resilience, legal issues etc. It is obvious that each of these dimensions deserves a separate thread of research efforts. One particular challenge among the ones listed above tha...
Fuzzy querying im XML databases Üstünkaya, Ekin; Yazıcı, Adnan; Department of Computer Engineering (2004) Real-world information containing subjective opinions and judgments has emerged the need to represent complex and imprecise data in databases. Additionally, the challenge of transferring information between databases whose data storage methods are not compatible has been an important research topic. Extensible Markup Language (XML) has the potential to meet these challenges since it has the ability to represent complex and imprecise data. In this thesis, an XML based fuzzy data representation and querying s...
Using Social Networks to Solve Data Sparsity Problem in One-Class Collaborative Filtering KAYA, hamza; Alpaslan, Ferda Nur (2010-04-14) One-Class Collaborative Filtering (OCCF) problems are more problematic than traditional collaborative filtering problems, since OCCF datasets lack counter-examples. Social networks can be used to remedy dataset issues faced by OCCF applications. In this work, we compare social networks belong to specific domains and the ones belong to more generic domains in terms of their usability in OCCF problems. Our experiments show that social networks that belong to a specific domain may better be appropriate for use...

Citation Formats

H. Kaya, “Using social graphs in one-class collaborative filtering problem,” M.S. - Master of Science, Middle East Technical University, 2009.