Trust-aware recommendation approaches are widely used to mitigate the cold-start problem in recommender systems by utilizing trust networks. In this paper, we point out the problems of existing trust-aware recommendation approaches as follows: (P1) exploiting sparse explicit trust and distrust relationships; (P2) considering a misleading assumption that a user pair having a trust/distrust relationship certainly has a similar/dissimilar preference in practice; (P3) employing the transitivity of distrust relationships. Then, we propose TrustRec, a novel approach based on the matrix factorization that provides an effective solution to each of the aforementioned problems and incorporates all of them in a single matrix factorization model. Furthermore, TrustRec exploits only top-k most similar trustees and dissimilar distrustees of each user to improve both the computational cost and accuracy. The results of our extensive experiments demonstrate that TructRec outperforms existing approaches in terms of both effectiveness and efficiency.
E-recruitment sites such as LinkedIn, Reed, and Indeed have a huge number of professional resumes from job seekers and job openings posted by recruiters. In this situation, it is a very time-consuming task for job seekers to find job openings that are well matched to their careers and desired conditions. Accordingly, active studies on job recommendation (JR) have been conducted recently. In this paper, we address the important property of transition patterns in JR that previous studies have overlooked. To incorporate the property into JR, we first propose two data modeling methods of adjacent pairing and all paring that represent a career path of a job seeker as a set of job pairs. Then, we propose frequency-based and graph-based methods of preference inference based on the data modeling methods. Finally, we develop four recommendation approaches, AdjacentFreq, AllFreq, AdjacentGraph, and AllGraph, each of which is a combination of two data modeling methods and two preference inference methods. Through extensive experiments using a real-life dataset, we show that our proposed approaches effectively address the unique property of JR. Also, we show that JR utilizing the transition information provides accuracy higher than JR not using the information.
31 July 2017 in Concurrency and Computation: Practice and Experience
Mobile smart devices are now being used by many people as the primary means of listening to music. Based on the observation that a user's preferences for particular music pieces change with the contexts she/he faces, this paper proposes an approach to music recommendation that takes the target context into account by exploiting data gathered from a smart device. In addition, the proposed approach improves recommendations by including newly-added music pieces and newly-faced contexts, avoiding repeated recommendations of the same music piece, and reflecting a user's positive and negative feedback over time. We show the effectiveness of the proposed approach through extensive user study.
AskStory is an e-recruitment site that maintains a large number of resumes and job openings. Job seekers in AskStory have difficulty in finding proper job openings that she/he is likely to be interested in. We discuss an approach to recommend job openings to jobs seekers. We identify the properties of the dataset used in job recommendation, discover the problems caused by the properties, and propose the methods for alleviating the problems. We evaluate our approach through extensive experiments. The results show that our approach is effective in alleviating the problems and provides recommendation accuracy satisfactory to job seekers.