Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation
|
|
- Darren Malone
- 5 years ago
- Views:
Transcription
1 Asymmetric Correlation Regularized Matrix Factorization for Web Service Recommendation Qi Xie, Shenglin Zhao, Zibin Zheng, Jieming Zhu and Michael R. Lyu School of Computer Science and Technology, Southwest University for Nationalities, Chengdu, China Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong, China School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China {slzhao, zbzheng, jmzhu, Abstract Web service recommendation has recently drawn much attention with the growing amount of Web services. Previous work usually exploits the collaborative filtering techniques for Web service recommendation, but suffers from the data sparsity problem that leads to inaccurate results. Our analysis on a real-world Quality of Service (QoS) dataset shows that there is a hidden correlation among users and services. We define such hidden correlation with an asymmetric matrix (namely asymmetric correlation), in which each entry presents the hidden correlation between a user pair or between a service pair. The goal of this work is to employ such asymmetric correlation among users and services to alleviate the data sparsity problem and further enhance the prediction accuracy in service recommendation. Specifically, we propose an asymmetric correlation regularized matrix factorization (MF) framework, in which asymmetric correlation and asymmetric correlation propagation have been naturally integrated. Finally, experimental results on a wellknown real-world QoS dataset validate that the use of asymmetric correlation among users and services is effective in improving prediction accuracy for Web service recommendation. Index Terms Web service; service recommendation; matrix factorization; collaborative filtering; random walk I. INTRODUCTION Web services on the Internet are abundant due to the wide adoption of service-oriented architectures and cloud platforms [1] [3]. It becomes challenging for users to find the optimal Web services satisfying their needs from the large number of services with the same functional characteristics. Therefore, effective recommendation approaches arise to help users analyze the available information for better service selection and application development. To recommend the optimal Web services for target users, Collaborative Filtering (CF) based Web service recommendation approaches have been widely studied in recent years [1], [4] [11]. These approaches typically employ historical QoS (Quality of Service) usage data to predict the unobserved QoS values. However, they usually suffer from the data sparsity problem. In practice, the available training data are usually highly sparse (e.g., two users have only a few co-invoked Web services) and can lead to inaccurate prediction results. For example, one critical issue for the memory-based CF [8] is to find the best similar users or services through calculating the Pearson Correlation Coefficient (PCC) between each pair of users and services. But it is likely that the similarity measured by PCC is inaccurately estimated when the historical QoS data Service users u 5 Web services u 4 s 3 u 6 u 8 u 7 u 9 s 5 s 1 s s 7 s 6 s 8 Fig. 1. s 4 u 1 Web Services Invocation Scenario are sparse [1], [1]. Recently, the correlation among users and services is incorporated in CF approaches to circumvent the data sparsity problem [1], [7], [13], [14]. Those CF approaches incorporated the correlation based on the intuition that a pair of services share higher similarity if they are commonly invoked by more users [13]. As shown in Fig. 1, user u has invoked service s 4 and s 6, and we want to predict the QoS value of user u invoking service s 8. Fig. 1 shows that 4 users invoking service pair (s 8, s 4 ) is larger than users invoking service pair (s 8, s 6 ). Then it is natural to suppose that the QoS value of s 4 is liable to be a better predictor for service s 8 than the QoS value of s 6 [1], [13]. Existing approaches utilize a significance weight to decrease the influence of a small number of similar co-invoking users or co-invoked services. However, these approaches only consider the correlation to improve the computation of similarity. Motivated by the above intuition, we exploit a hidden correlation among users and services named as Asymmetric Correlation (AC) in this paper. The asymmetric correlation is defined with an asymmetric matrix, where each entry presents the hidden correlation between a user pair or between a service pair. Furthermore, the higher value of asymmetric correlation user pair (service pair) is, the more similar Web service invocation experience user pair (service pair) enjoys. The goal of this work is to employ such asymmetric correlation among users and services to alleviate the data sparsity in existing approaches, and to further enhance the prediction accuracy in service recommendation. Moreover, we also explore the following problems: u u 3 s 9
2 Can we exploit the asymmetric correlation with matrix factorization to improve the recommendation performance, when the available data are sparse? Can we take advantages of both user asymmetric correlation and service asymmetric correlation? To address these problems, this paper proposes an asymmetric correlation regularized Matrix Factorization (MF) framework for Web service recommendation, in which asymmetric correlation and asymmetric correlation propagation have been naturally integrated under three models. Specifically, this paper makes the following contributions: We construct both user asymmetric correlation and service asymmetric correlation by taking into account dependent relations and propagation. We systematically demonstrate how to design three asymmetric correlation based models of MF, in which asymmetric correlation among both users and services has been naturally integrated. We evaluate our models on a well-known real-world QoS dataset, and the results show that both user asymmetric correlation and service asymmetric correlation are effective in enhancing the prediction accuracy. The rest of this paper is organized as follows. Section II presents the problem description. Section III details the asymmetric correlation regularized matrix factorization. Section IV shows the experimental results. Section V describes related work and Section VI concludes the paper. II. PROBLEM DESCRIPTION In this section, we demonstrate the asymmetric correlation regularized matrix factorization via a toy example. Before describing the example, we define several terms first. Definition 1 (Co-occurrence criterion): Co-occurrence criterion describes the co-invoked services which are invoked by user pairs or co-invoking users who invoke services pairs, shown in Fig. (b) and Fig. (c) respectively. Definition (Dependent relation): Dependent relation contains not only the co-occurrence criterion of each pair but also the co-occurrence criterion of the other pairs. Dependent relation can be obtained by constructing the stochastic matrix illustrated in Fig. (d) and Fig. (e) respectively. Definition 3 (Asymmetric correlation): Asymmetric correlation is the hidden correlation among users and services defined with an asymmetric matrix. And every entry in asymmetric matrix presents the dependent relation related to a cooccurrence criterion of user pair or service pair. To illustrate the concept of asymmetric correlation regularized matrix factorization more clearly, a toy example is given in Fig.. According to Web services invocation scenario in Fig. 1, we extract three users (u, u 8, u 9 ) and three services (s 4, s 6, s 8 ) to construct a toy 3 3 user-service QoS matrix. Furthermore, Fig. (a) shows the 3 3 user-service QoS matrix where every entry r i,j represents the QoS values (e.g., response time, throughput, etc.) invoked by user u i on service s j. Based on the intuition that the higher value of asymmetric correlation user pair (service pair) is, the more similar Web service invocation experience user pair (service pair) enjoys, the overview of asymmetric correlation regularized matrix factorization is illustrated in the toy example as follows. Firstly, the 3 3 user-user correlation matrix and the 3 3 service-service correlation matrix can be constructed according to the co-occurrence criterion in 3 3 userservice QoS matrix, which are shown in Fig. (b) and Fig. (c) respectively. Secondly, as shown in Fig. (d) and Fig. (e), user asymmetric correlation matrix and service asymmetric correlation matrix can be obtained separately, by using corresponding correlation matrices and dependent relation of correlation. And then, asymmetric correlation propagation is taken into consideration by employing random walk algorithm. Thus, the asymmetric correlation ranks of users and services are produced respectively as shown in Fig. (f) and Fig. (g). After that, three asymmetric correlation based regularization terms shown in Fig. (h) are designed by employing the sets of Top-K high rank values of user asymmetric correlation and service asymmetric correlation. That can construct corresponding three unified MF models where asymmetric correlation among both users and services is systematically integrated. The problem we address in this paper is how to predict the missing QoS values of the user-service QoS matrix and recommend the optimal Web services for target users effectively by exploiting asymmetric correlation among both users and services. III. ASYMMETRIC CORRELATION REGULARIZED MATRIX FACTORIZATION A. Asymmetric Correlation Calculation Given an m n user-service QoS matrix including m users and n services, we calculate the asymmetric correlation by two steps: asymmetric correlation matrix construction and asymmetric correlation propagation. 1) Asymmetric Correlation Matrix Construction: We first define the symmetric User Correlation Matrix (U CM) and the symmetric Service Correlation Matrix (SCM). U(u i, u f ) is a set of services which invoked by both user u i and user u f with a co-occurrence criterion, and if u i u f then the value of U(u i, u f ) is. It is formulated as U(u i, u f ) { {sg : (r i,g ) (r f,g )} (u i u f ) (u i u f ) (1) where g is in the range of [1, n], and r i,g and r f,g are the vectors of QoS values of service g invoked by user u i and u f respectively. Further, we define the entry of UCM as UCM ui,u f U(u i, u f ) i, f 1,..., m, () where U(u i, u f ) is the number of U(u i, u f ).
3 u u 8 u 9 u 3 u 8 1 u u u 8 u 9 u u u u u u m i1 ptopuap ( K ) UAP( p) u u i p F s 4 s 6 s 8 u r,4 r,6 r,8 u 8 r 8,4 - - u 9 r 9,4 - r 9,8 (a) (b) (d) (f) + n j1 qtopsap( K ) SAP( q) s s j q F s 4 s 6 s 8 s s 6 1 s 8 4 s 4 s 6 s 8 s s s s s s m n 1 UAP( p) ui u p ( ) F SAP q s j sq F i1 ptopuap( K ) j1 qtopsap( K ) (c) (e) (g) (h) Fig.. A Toy Example Similar to user correlation matrix, the service correlation matrix is defined as: SCM sj,s g S(s j, s g ) j, g 1,..., n, (3) where S(s j, s g ) is a set of users which invoke both service s j and service s g. By incorporating the dependent relations among users and services, we define the asymmetric UCM and SCM. Dependent relations can be exploited from above correlation matrices by constructing a stochastic matrix. That is to say, each entry in the asymmetric correlation matrix is related to not only the numbers of co-occurrence criterion of each pair but also the numbers of co-occurrence criterion of the other pairs. Therefore, the Asymmetric Correlation of user u i and u f is defined by the ratio of entry UCM ui,u f among the sum of entries in f-th column of user correlation matrix. In formal, we define the User Asymmetric Correlation Matrix (U ACM) as U(u i,u f ) U(u UACM ui,u f s,u f ) (u i u f ) s m, (4) (u i u f ) where i, f, and s are in the range of [1, m], and the matrix entry UACM ui,u f presents the dependent relation of correlation between user u i and user u f. Likewise, we define the service asymmetric correlation matrix (SACM) as: S(s j,s g) S(s SACM sj,s g l,s g) (s j s g ) l n, (5) (s j s g ) where j, g and l are in the range of [1, n], the matrix entry SACM sj,s g presents the dependent relation of correlation between service s j and service s g. ) Asymmetric Correlation Propagation: The asymmetric correlation propagation is the key to exploit the asymmetric correlation. Following [14], we leverage the asymmetric correlation propagation to find the top users and services through the random walk algorithm. Observing from (4) and (5), we see that the UACM and SACM are the stochastic matrices which can be considered as transition probability matrices in the random walk algorithm. Then, every entry in U ACM represents the probability of user u i with the next state u f, similar to matrix SACM. Like computing the PageRank [15], the asymmetric correlation of users and services can spread throughout the corresponding transition probability matrices. Then the random walk algorithm with User Asymmetric correlation Propagation (UAP) is designed by employing the following equations: { UAP (u 0 i ) 1 m 1 m UAP (u t+1 i ) a UACM UAP (u t i ) + (1 a) 1 m 1 m, (6) where UAP (u i ) is a vector with length of m, 1 m is a m long vector of ones, and a is a decay factor which is set to. UAP (u i ) means the rank value of asymmetric correlation for user u i, and UACM is the user asymmetric correlation matrix. At the beginning of the iteration, the initial value of UAP (u i ) is set to UAP (u 0 i ) which means that all users obtain a same rank value. Then, UAP (u i ) iterates finite steps to convergence. Likewise, the random walk algorithm with Service Asymmetric correlation Propagation (SAP) is defined as: { SAP (s 0 j ) 1 n 1 n SAP (s t+1 j ) a SACM SAP (s t j ) + (1 a) 1 n 1 n, (7) where SAP (s j ) is a vector with length of n, 1 n is a n long vector of ones, and a is also a decay factor set to. SACM is the service asymmetric correlation matrix, and SAP (s j ) means the rank value of asymmetric correlation for service s j. We calculate the value of SAP (s j ) via the same strategy of computing UAP (u i ). From (6) and (7), we see that the values UAP and SAP generate a rank of users and services according to their Web service invocation experience after a random walk. The higher is the rank value of UAP (SAP ), the higher is the probability that the user (service) is popular with services (users) [16]. B. Asymmetric Correlation based Regularization Three asymmetric correlation based regularization terms are constructed from U AP and SAP to enhance the Web service recommendation. According to [14], [16], target users (services) are liable to have similar Web service invocation experience with popular users (services) which have high rank values of asymmetric correlation. Based on this intuition, a set of users T opuap (K) with top-k high rank values of user asymmetric correlation and a set of services T opsap (K)
4 with top-k high rank values of service asymmetric correlation can be discovered in the UAP and the SAP respectively. 1) User Asymmetric Correlation based Regularization (): We define T opuap (K) as the set of users with top-k high rank values of user asymmetric correlation except the service user u i itself. We propose a user asymmetric correlation based regularization term as follows: β 1 m i1 p T opuap (K) UAP (p) u i u p F (u p u i ), (8) where user u p belongs to T opuap (K), and β 1 is the regularization parameter with β 1 > 0. UAP (p) is a vector of the rank values of user asymmetric correlation for user u p. Furthermore, (8) is employed to minimize the invocation preference between user u i and other popular users with top- K high rank values of user asymmetric correlation. As a consequence, we gain the first asymmetric correlation regularized matrix factorization model, min U,S L 1(R, U, S) 1 + β 1 m i1 j1 m n I ij (R ij Ui T S j ) i1 p T opuap (K) UAP (p) u i u p F + λ 1 U F + λ S F, (9) where R is the m n user-service QoS matrix including m users and n services, in which every entry represents a vector of QoS values. The R matrix can be approximately divided into two submatrices which are U R d m and S R d n with dimensionality d < min(m, n). represents the F robenius norm. I ij is a indicator function. When service s j is invoked by user u i, the I ij is set to 1 and set to 0 otherwise. In addition, two regularization terms including λ1 U F and λ S F are employed to avoid overfitting where λ 1, λ > 0. In order to obtain the local minimum of the above objective function, we exploit the gradient descent algorithm to learn U i and S j, L 1 U i L 1 S j n I ij (Ui T S j R ij )S j + λ 1 U i j1 + β 1 p T opuap (K) UAP (p)(u i u p ), m I ij (Ui T S j R ij )U i + λ S j. i1 (10) ) Service Asymmetric Correlation based Regularization (): Similar to user asymmetric correlation based regularization, the regularization can be expanded by taking advantages of service asymmetric correlation. And the service asymmetric correlation based regularization term can defined as follows: β n j1 q T opsap (K) SAP (q) s j s q F (s q s j ), (11) where SAP (q) is the set of rank values of service asymmetric correlation for service s q. And service s q is the set of services who belong to T opsap (K) except the service s j itself. In addition, β is also the regularization parameter with β > 0. Moreover, (11) is employed to minimize the invocation preference between service s j and other popular services with top-k high rank values of service asymmetric correlation. Same as the first model, the second asymmetric correlation regularized matrix factorization model can be formulated by: min U,S L (R, U, S) 1 + β m i1 j1 n n I ij (R ij Ui T S j ) j1 q T opsap (K) SAP (q) s j s q F + λ 1 U F + λ S F. (1) The gradient descent algorithm of both U i and S j is used to find a local minimum of the objective function in (1) by employing the following equations: L U i L S j n I ij (Ui T S j R ij )S j + λ 1 U i, j1 m I ij (Ui T S j R ij )U i + λ S j i1 + β q T opsap (K) SAP (p)(s j s q ). (13) 3) Hybrid Asymmetric Correlation based Regularization (): From subsection III-B1 and subsection III-B, we can take advantages of both user asymmetric correlation and service asymmetric correlation. Asymmetric correlation will possibly benefit the Web service recommendation. Then, the hybrid model can be constructed as the third asymmetric correlation regularized matrix factorization model by: min U,S L 3(R, U, S) 1 + β 1 + β m i1 j1 m n I ij (R ij Ui T S j ) i1 p T opuap (K) n j1 q T opsap (K) UAP (p) u i u p F SAP (q) s j s q F + λ 1 U F + λ S F, (14) where the objective function L 3 minimizes the invocation preferences among both users and services.
5 Thus, the local minimum of the objective function L 3 can also be searched by employing gradient descent algorithm of both U i and S j as: L 1 U i L S j n I ij (Ui T S j R ij )S j + λ 1 U i j1 + β 1 p T opuap (K) UAP (p)(u i u p ), m I ij (Ui T S j R ij )U i + λ S j i1 + β q T opsap (K) SAP (p)(s j s q ), where we set the λ 1 λ in all experiments for simplicity. IV. EXPERIMENT (15) In this section, we conduct experiments to explore the following questions: Is asymmetric correlation effective in enhancing the performance of Web service recommendation by using MF? Can we take advantages of both user asymmetric correlation and service asymmetric correlation? What are the effects of parameters on the models performance? A. Dataset Description We employ the well-known real-world QoS dataset provided by Zheng et al. [1] to study the prediction accuracy of our proposed approaches. The dataset contains about 1,974,675 Web service response time invocations from 339 users on 585 Web services. In order to keep consistence with the real-world QoS data sparsity, we randomly choose different number of entries, named Given Service (GS), from 585 Web services. Then, the new 339 GS user-service QoS matrix is divided into two parts, one part as the training matrix which covers 80% of 339 GS matrix and the other part as the test matrix. As to the training matrix, we randomly remove entries to gain different densities. There are 9 parameters in our experiments including a, β 1, β, λ 1, λ, top-k, GS, denstiy, and dimensionality. The parameter settings are as follows, λ 1 λ 30, a, and β 1 β β in all experiments for simplicity. B. Metrics Two popular metrics, Mean Absolute Error () and Normalized Mean Absolute Error (N) are employed to measure the prediction accuracy by using the following equations: i,j R i,j ˆR i,j, (16) N N i,j R i,j/n, (17) where R i,j and ˆR i,j denote the real QoS value and the predicted QoS value of service j invoked by user i respectively. And N is the number of missing QoS values in user-service QoS matrix. C. Comparison To study the effectiveness of our asymmetric correlation regularized MF approaches (, and ), we compare the performance with four state-of-the-art Web service recommendation approaches: UPCC [4], IPCC [1], WS- Rec [1], and PMF [17]. UPCC and IPCC are user-based CF approach and item-based CF approach respectively, which use PCC to measure the similarity and find the best services. When measuring the performance of UPCC and IPCC, we set the negative predicted QoS values as 0 to calculate and N. WSRec is a model that integrates both UPCC and IPCC systematically. PMF namely probabilistic matrix factorization is a state-of-the-art MF model for recommendation task. In this paper, the compared four approaches and our proposed three approaches employ the same error measures and the same datasets. Table 1 shows the performance comparison of seven approaches on response time with β 30, density10%, dimensionality10, GS from 1000 to 3000 with a step value of From Table 1, we draw the following conclusions: When GS1000, we set top-k60 for, top-k0 for and top-k10 for. Table 1 shows that our proposed three approaches obtain smaller and N values than other approaches, and gains the smallest and N values than others. This observation shows that both user asymmetric correlation and service asymmetric correlation can enhance the performance of Web service recommendation effectively by using MF. When GS000 and GS3000, we set top-k60 for, top-k70 for and top-k50 for. As shown in Table 1, and approaches outperform other five approaches. This observation shows that service asymmetric correlation based approaches can obtain better prediction accuracy. Our three approaches by using asymmetric correlation can obtain smaller and N values than others, which indicates better prediction accuracy. That confirms the asymmetric correlation is effective in enhancing the performance of Web service recommendation. Moreover, it also can be seen from Table 1 that our three approaches experience a downward trend with the increase GS from 1000 to This indicates that more QoS values can improve the prediction accuracy. In addition, the can obtain smaller and N values. This observation shows that taking advantages of both user and service asymmetric correlation in a unified model can also enhance the prediction accuracy. D. Impact of Top-K In our asymmetric correlation regularized matrix factorization approaches, the parameter top-k is employed to control
6 TABLE I PERFORMANCE COMPARISON GS Metric Methods UPCC IPCC WSRec PMF N N N Top K (a) Density5% N Top K (b) Density5% Top K (c) Density10% N Top K (d) Density10% Fig. 3. Impact of Top-K Beta (a) Density5% N Beta (b) Density5% Beta (c) Density10% N Beta (d) Density10% Fig. 4. Impact of Beta N N Training Matrix Density Training Matrix Density Training Matrix Density Training Matrix Density (a) GS1000 (b) GS1000 (c) GS3000 (d) GS3000 Fig. 5. Impact of Training Matrix Density Dimensionality (a) Density5% N Dimensionality (b) Density5% Dimensionality (c) Density10% N Dimensionality (d) Density10% Fig. 6. Impact of Dimensionality
7 the number of popular entries which include users and services. Fig. 3 illustrates the impact of top-k on the prediction accuracy of our three approaches (, and ) with β 30, GS1000, dimensionality10, density5%, density10%, and top-k from 10 to 100 with a step size of 10. When density5%, it can be seen from the Fig. 3 that the and N values of both and become smaller with the increase of top-k, indicating larger popular services provides more information for recommendation. Moreover, can obtain the optimal performance with top-k10, while the and can obtain the optimal performance when top-k100. This indicates that popular services provide more information than users for recommendation. Also when density10%, obtains better performance consistently versus and. It shows that the performance of, and has been affected differently with the increase of top-k. Whatever the values of top-k are, one of our three approaches can obtain the optimal performance, indicating AC based approaches can effectively enhance the performance of Web service recommendation. E. Impact of Beta In our approaches, β 1 and β are the regularization parameters to determine how much the asymmetric correlation of users and services influences to the objective functions respectively. Moreover, we set top-k70, GS1000, dimensionality10, density5% and density10% respectively. And we also vary β from 10 to 100 with a step value of 10. As shown in Fig. 4, when density5%, the performance of and becomes better but the performance of becomes worse with the increase of β. And when density10%, the performance of and becomes little worse but the performance of becomes stable with better results with the increase of β. This observation shows that the values of β affect our three approaches differently, indicating AC has an important impact on objective functions. Also whatever the values of β are, one of our three approaches can obtain the optimal performance. It indicates that AC based approaches can effectively enhance the performance. F. Impact of Training Matrix Density To study the impact of training matrix density, we set β 30, top-k70, GS1000, GS3000 and change the density from 1% to 10% with a step of 1%. Fig. 5 shows that our proposed three approaches experience a downward trend with the increase of density from 1% to 10%, indicating that more QoS values can enhance the prediction accuracy and the AC is effective in enhancing the performance. Moreover, the firstly performs little worse than when GS1000 and density increases from 3% to 6%. After that the performs better than when density increases from 7% to 10%. This observation indicates that more QoS values can enhance the prediction accuracy of with GS1000. But as to GS3000, the and N values of become smaller than the ones of with density increase from 1% to 10%, indicating that more Web services and QoS values can remarkably increase the performance accuracy of with GS3000. G. Impact of Dimensionality Aiming to discuss the influence of dimensionality which controls how many latent features related to MF, we set β 30, top-k70, GS1000, density5% and density10% respectively. And we also tune the dimensionality from 10 to 100 with a step size of 10. Fig. 6(a) and Fig. 6(b) show and firstly fluctuate, after that they tend to gentle with the growth of dimensionality from 50 to 100, indicating that dimensionality has an important impart on the stability and accuracy of prediction performance. In addition, Fig. 6(c) and Fig. 6(d) show that the performance of our three asymmetric correlation based approaches are stable with the increase of dimensionality from 10 to 100 when density10% and GS1000. This observation also indicates that more QoS values may enhance the stability of prediction performance. V. RELATED WORK In this section, we review some approaches on Web service recommendation, which mainly include two types of CF-based approaches: memory-based [1], [6], [7] and model-based [18], [19]. Currently, some matrix factorization approaches have been presented for Web service recommendation [6], [8], [19]. However, CF-based service recommendation approaches suffer from the data sparsity. Then context information such as location and time is considered to tackle this problem [8], [10], [14]. But context information may be missing for privacy protection of Web services. Hence, researchers attempt to dig correlation hidden in user-service QoS matrix to solve this problem [1], [7], [13], [0], [1]. Some approaches have been proposed to by incorporating the correlation among users or services to improve the deviation or similarity [1], [7], [13]. D. Lemire et al. [13] and Zheng et al. [1] employ the number of similar co-invoked items or co-invoking users to improve the deviation or similarity. Jiang et al. [7] employ the degree of users and services to compute the personalized similarity. Gao et al. [] incorporate the user weight into the computation of item similarities and differentials. Hu et al. [14] perform a hybrid personalized random walk algorithm to handle data sparsity by inferring more indirect user and service similarities. And Gori et al. [16] present Item- Rank that exploits a random walk based scoring algorithm to rank products according to expected user preferences and recommend top-rank items to potentially interested users. Tang et al. [3] propose a random walk method combining location-aware and collaborative filtering method for Web service recommendation. These approaches only consider the correlation to improve the deviation or similarity, but fail to study the influence of the correlation on recommendation performance directly. In specific, the dependent relation and correlation propagation are not involved. Our approaches are most related to [0], [1], [4]. Yet our proposed approaches distinguish these methods in model
8 construction and means of incorporating the asymmetric correlation. Gong et al. [4] leverage a user relationship and preference, which are derived from the feedback from user to service. Different from this work using the relationship from user to service, we exploit the relationship from user to user and service to service respectively in user-service QoS matrix. Furthermore, the relationship of users and services in our approaches has different definition which is related to a co-occurrence criterion in Web services. In our previous work, [0] combines asymmetric correlation among users and propagation into the deviation computation of different service items in QoS prediction; [1] employs the asymmetric correlation among services to improve the process of choosing Top- K different services by using slope one approach. Different from these approaches, our proposed approaches in this paper leverage the asymmetric correlation both of users and services to construct three corresponding regularization terms which are integrated in an MF model. VI. CONCLUSION AND FUTURE WORK In this paper, we aim to employ asymmetric correlation among users and services to enhance the prediction accuracy in Web service recommendation. Our methods are based on the intuition that the higher value of asymmetric correlation user pair (or service pair) is, the more similar Web service invocation experience user pair (or service pair) enjoys. We propose three asymmetric correlation based matrix factorization approaches for Web service recommendation. In the proposed approaches, we leverage both user asymmetric correlation and service asymmetric correlation in which asymmetric correlation propagation is taken into consideration via the random walk algorithm. Furthermore, the experimental analysis on a real-world QoS dataset shows that the asymmetric correlation among users and services indeed has an important effect on prediction accuracy. In future, we will continue to optimize our models in terms of stability and prediction accuracy. Moreover, more QoS properties will be considered, and other contextual features of Web services (e.g., location, time, etc.) can be integrated into our framework to further enhance the performance of Web service recommendation. ACKNOWLEDGMENT This work was supported by the National Natural Science Foundation of China (Grant No ), the Research Grants Council of the Hong Kong Special Administrative Region, China (No. CUHK of the General Research Fund), Guangdong Natural Science Foundation (Project No. 014A ). REFERENCES [1] Z. Zheng, H. Ma, M. R. Lyu, and I. King, QoS-aware Web service recommendation by collaborative filtering, IEEE Transactions on Service Computing, vol. 4, no., pp , 011. [] S. Wang, Z. Zheng, Z. Wu, M. R. Lyu, and F. Yang, Reputation measurement and malicious feedback rating prevention in web service recommendation systems, IEEE Transactions on Service Computing, vol. 8, no. 5, pp , 015. [3] J. Zhu, P. He, Z. Zheng, and M. R. Lyu, Towards online, accurate, and scalable qos prediction for runtime service adaptation, in Proc. 34th Int l Conf. Distributed Computing Systems ICDCS 14, 014, pp [4] L. Shao, J. Zhang, Y. Wei, J. Zhao, B. Xie, and H. Mei, Personalized QoS prediction for Web services via collaborative filtering, in Proc. 5th Int l Conf. Web Services (ICWS 07), 007, pp [5] Z. Zheng, H. Ma, M. R. Lyu, and I. King, WSRec: A collaborative filtering based Web service recommender system, in Proc. 7th Int l Conf. Web Services (ICWS 09), 009, pp [6] X. Chen, Z. Zheng, X. Liu, Z. Huang, and H. Sun, Personalized QoSaware Web service recommendation and visualization, IEEE Transactions on Services Computing, vol. 6, no. 1, pp , 013. [7] Y. Jiang, J. Liu, M. Tang, and X. Liu, An affective web service recommendation method based on personalized collaborative filtering, in Proceedings of the 18th IEEE International Conference on Web Services (ICWS 11). IEEE, 011, pp [8] W. Lo, J. Yin, S. Deng, Y. Li, and Z. Wu, Collaborative Web service qos prediction with location-based regularization, in Proceedings of the 19th IEEE International Conference on Web Services (ICWS 1). IEEE, 01, pp [9] P. He, J. Zhu, Z. Zheng, J. Xu, and M. R. Lyu, Location-based hierarchical matrix factorization for Web service recommendation, in Proceedings of the 1th IEEE International Conference on Web Services (ICWS 14). IEEE, 014, pp [10] K. Lee, J. Park, and J. Baik, Location-based Web service QoS prediction via preference propagation for improving cold start problem, in Proceedings of the th IEEE International Conference on Web Services (ICWS 15). IEEE, 015, pp [11] Z. Zheng, H. Ma, M. R. Lyu, and I. King, Collaborative web service QoS prediction via neighborhood integrated matrix factorization, IEEE Transactions on Service Computing, vol. 6, no. 3, pp , 013. [1] M. R. McLaughlin and J. L. Herlocker, A collaborative filtering algorithm and evaluation metric that accurately model the user experience, in Proc. 7th Int l ACM SIGIR Conf. on Research and Development in Information Retrieval (SIGIR 04), 004, pp [13] D. Lemire and A. Maclachlan, Slope one predictors for online ratingbased collaborative filtering, in SDM, vol. 5. SIAM, 005, pp [14] Y. Hu, Q. Peng, and X. Hu, A time-aware and data sparsity tolerant approach for Web service recommendation, in Proceedings of the 1th IEEE International Conference on Web Services (ICWS 14). IEEE, 014, pp [15] L. Page, S. Brin, R. Motwani, and T. Winograd, The pagerank citation ranking: bringing order to the web [16] M. Gori, A. Pucci, V. Roma, and I. Siena, Itemrank: A random-walk based scoring algorithm for recommender engines, in International Joint Conference on Artificial Intelligence, vol. 7, 007, pp [17] R. Salakhutdinov and A. Mnih, Probabilistic matrix factorization, Advances in Neural Information Processing Systems, vol. 0, 008. [18] H. Ma, H. Yang, M. R. Lyu, and I. King, Sorec: social recommendation using probabilistic matrix factorization, in Proceedings of the 17th ACM conference on Information and knowledge management. ACM, 008, pp [19] H. Ma, An experimental study on implicit social recommendation, in Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval(sigir 13). ACM, 013, pp [0] Q. Xie, B. Tang, Z. Zheng, and M. Cui, Qos prediction in dynamic web services with asymmetric correlation, in Proceedings of the 15th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 15). Springer, 015, pp [1] Q. Xie, Z. Zheng, L. Liu, and M. Cui, Correlation-based top-k recommendation for web services, in Proceedings of the 13th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC 15). IEEE, 015, pp [] M. Gao, Z. Wu, and F. Jiang, Userrank for item-based collaborative filtering recommendation, Information Processing Letters, vol. 111, no. 9, pp , 011. [3] M. Tang, X. Dai, B. Cao, and J. Liu, Wswalker: A random walk method for QoS-Aware Web service recommendation, in Proc. th Int l Conf. Web Services (ICWS 15). IEEE, 015, pp [4] M. Gong, Z. Xu, L. Xu, Y. Li, and L. Chen, Recommending web service based on user relationships and preferences, in Proc. 0th Int l Conf. Web Services (ICWS 13). IEEE, 013, pp
A Modified PMF Model Incorporating Implicit Item Associations
A Modified PMF Model Incorporating Implicit Item Associations Qiang Liu Institute of Artificial Intelligence College of Computer Science Zhejiang University Hangzhou 31007, China Email: 01dtd@gmail.com
Service Recommendation for Mashup Composition with Implicit Correlation Regularization
205 IEEE International Conference on Web Services Service Recommendation for Mashup Composition with Implicit Correlation Regularization Lina Yao, Xianzhi Wang, Quan Z. Sheng, Wenjie Ruan, and Wei Zhang
* Matrix Factorization and Recommendation Systems
Matrix Factorization and Recommendation Systems Originally presented at HLF Workshop on Matrix Factorization with Loren Anderson (University of Minnesota Twin Cities) on 25 th September, 2017 15 th March,
Collaborative Recommendation with Multiclass Preference Context
Collaborative Recommendation with Multiclass Preference Context Weike Pan and Zhong Ming {panweike,mingz}@szu.edu.cn College of Computer Science and Software Engineering Shenzhen University Pan and Ming
Scaling Neighbourhood Methods
Quick Recap Scaling Neighbourhood Methods Collaborative Filtering m = #items n = #users Complexity : m * m * n Comparative Scale of Signals ~50 M users ~25 M items Explicit Ratings ~ O(1M) (1 per billion)
Department of Computer Science, Guiyang University, Guiyang , GuiZhou, China
doi:10.21311/002.31.12.01 A Hybrid Recommendation Algorithm with LDA and SVD++ Considering the News Timeliness Junsong Luo 1*, Can Jiang 2, Peng Tian 2 and Wei Huang 2, 3 1 College of Information Science
SCMF: Sparse Covariance Matrix Factorization for Collaborative Filtering
SCMF: Sparse Covariance Matrix Factorization for Collaborative Filtering Jianping Shi Naiyan Wang Yang Xia Dit-Yan Yeung Irwin King Jiaya Jia Department of Computer Science and Engineering, The Chinese
Joint user knowledge and matrix factorization for recommender systems
World Wide Web (2018) 21:1141 1163 DOI 10.1007/s11280-017-0476-7 Joint user knowledge and matrix factorization for recommender systems Yonghong Yu 1,2 Yang Gao 2 Hao Wang 2 Ruili Wang 3 Received: 13 February
Aggregated Temporal Tensor Factorization Model for Point-of-interest Recommendation
Aggregated Temporal Tensor Factorization Model for Point-of-interest Recommendation Shenglin Zhao 1,2B, Michael R. Lyu 1,2, and Irwin King 1,2 1 Shenzhen Key Laboratory of Rich Media Big Data Analytics
arxiv: v2 [cs.ir] 14 May 2018
A Probabilistic Model for the Cold-Start Problem in Rating Prediction using Click Data ThaiBinh Nguyen 1 and Atsuhiro Takasu 1, 1 Department of Informatics, SOKENDAI (The Graduate University for Advanced
Mixture-Rank Matrix Approximation for Collaborative Filtering
Mixture-Rank Matrix Approximation for Collaborative Filtering Dongsheng Li 1 Chao Chen 1 Wei Liu 2 Tun Lu 3,4 Ning Gu 3,4 Stephen M. Chu 1 1 IBM Research - China 2 Tencent AI Lab, China 3 School of Computer
Recommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 21, 2014 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 21, 2014 1 / 52 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
RaRE: Social Rank Regulated Large-scale Network Embedding
RaRE: Social Rank Regulated Large-scale Network Embedding Authors: Yupeng Gu 1, Yizhou Sun 1, Yanen Li 2, Yang Yang 3 04/26/2018 The Web Conference, 2018 1 University of California, Los Angeles 2 Snapchat
Large-Scale Social Network Data Mining with Multi-View Information. Hao Wang
Large-Scale Social Network Data Mining with Multi-View Information Hao Wang Dept. of Computer Science and Engineering Shanghai Jiao Tong University Supervisor: Wu-Jun Li 2013.6.19 Hao Wang Multi-View Social
Learning to Recommend Point-of-Interest with the Weighted Bayesian Personalized Ranking Method in LBSNs
information Article Learning to Recommend Point-of-Interest with the Weighted Bayesian Personalized Ranking Method in LBSNs Lei Guo 1, *, Haoran Jiang 2, Xinhua Wang 3 and Fangai Liu 3 1 School of Management
Matrix Factorization Techniques for Recommender Systems
Matrix Factorization Techniques for Recommender Systems By Yehuda Koren Robert Bell Chris Volinsky Presented by Peng Xu Supervised by Prof. Michel Desmarais 1 Contents 1. Introduction 4. A Basic Matrix
Additive Co-Clustering with Social Influence for Recommendation
Additive Co-Clustering with Social Influence for Recommendation Xixi Du Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing, China 100044 1510391@bjtu.edu.cn Huafeng
Collaborative Filtering. Radek Pelánek
Collaborative Filtering Radek Pelánek 2017 Notes on Lecture the most technical lecture of the course includes some scary looking math, but typically with intuitive interpretation use of standard machine
Content-based Recommendation
Content-based Recommendation Suthee Chaidaroon June 13, 2016 Contents 1 Introduction 1 1.1 Matrix Factorization......................... 2 2 slda 2 2.1 Model................................. 3 3 flda 3
Collaborative topic models: motivations cont
Collaborative topic models: motivations cont Two topics: machine learning social network analysis Two people: " boy Two articles: article A! girl article B Preferences: The boy likes A and B --- no problem.
Decoupled Collaborative Ranking
Decoupled Collaborative Ranking Jun Hu, Ping Li April 24, 2017 Jun Hu, Ping Li WWW2017 April 24, 2017 1 / 36 Recommender Systems Recommendation system is an information filtering technique, which provides
Matrix Factorization Techniques for Recommender Systems
Matrix Factorization Techniques for Recommender Systems Patrick Seemann, December 16 th, 2014 16.12.2014 Fachbereich Informatik Recommender Systems Seminar Patrick Seemann Topics Intro New-User / New-Item
Exploiting Local and Global Social Context for Recommendation
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Exploiting Local and Global Social Context for Recommendation Jiliang Tang, Xia Hu, Huiji Gao, Huan Liu Computer
Recommendation Systems
Recommendation Systems Pawan Goyal CSE, IITKGP October 29-30, 2015 Pawan Goyal (IIT Kharagpur) Recommendation Systems October 29-30, 2015 1 / 61 Recommendation System? Pawan Goyal (IIT Kharagpur) Recommendation
Location Regularization-Based POI Recommendation in Location-Based Social Networks
information Article Location Regularization-Based POI Recommendation in Location-Based Social Networks Lei Guo 1,2, * ID, Haoran Jiang 3 and Xinhua Wang 4 1 Postdoctoral Research Station of Management
Facing the information flood in our daily lives, search engines mainly respond
Interaction-Rich ransfer Learning for Collaborative Filtering with Heterogeneous User Feedback Weike Pan and Zhong Ming, Shenzhen University A novel and efficient transfer learning algorithm called interaction-rich
Circle-based Recommendation in Online Social Networks
Circle-based Recommendation in Online Social Networks Xiwang Yang, Harald Steck*, and Yong Liu Polytechnic Institute of NYU * Bell Labs/Netflix 1 Outline q Background & Motivation q Circle-based RS Trust
Restricted Boltzmann Machines for Collaborative Filtering
Restricted Boltzmann Machines for Collaborative Filtering Authors: Ruslan Salakhutdinov Andriy Mnih Geoffrey Hinton Benjamin Schwehn Presentation by: Ioan Stanculescu 1 Overview The Netflix prize problem
SQL-Rank: A Listwise Approach to Collaborative Ranking
SQL-Rank: A Listwise Approach to Collaborative Ranking Liwei Wu Depts of Statistics and Computer Science UC Davis ICML 18, Stockholm, Sweden July 10-15, 2017 Joint work with Cho-Jui Hsieh and James Sharpnack
Iterative Laplacian Score for Feature Selection
Iterative Laplacian Score for Feature Selection Linling Zhu, Linsong Miao, and Daoqiang Zhang College of Computer Science and echnology, Nanjing University of Aeronautics and Astronautics, Nanjing 2006,
Mitigating Data Sparsity Using Similarity Reinforcement-Enhanced Collaborative Filtering
Mitigating Data Sparsity Using Similarity Reinforcement-Enhanced Collaborative Filtering YAN HU, University of Chinese Academy of Sciences and Wayne State University WEISONG SHI, Wayne State University
NOWADAYS, Collaborative Filtering (CF) [14] plays an
JOURNAL OF L A T E X CLASS FILES, VOL. 4, NO. 8, AUGUST 205 Multi-behavioral Sequential Prediction with Recurrent Log-bilinear Model Qiang Liu, Shu Wu, Member, IEEE, and Liang Wang, Senior Member, IEEE
Robust Web Service Recommendation via Quantile Matrix Factorization
Robust Web Service Recommendation via Quantile Matrix Factorization Rui Zhu, Di Niu, and Zongpeng Li Department of Electrical and Computer Engineering, University of Alberta Department of Computer Science,
Point-of-Interest Recommendations: Learning Potential Check-ins from Friends
Point-of-Interest Recommendations: Learning Potential Check-ins from Friends Huayu Li, Yong Ge +, Richang Hong, Hengshu Zhu University of North Carolina at Charlotte + University of Arizona Hefei University
Rating Prediction with Topic Gradient Descent Method for Matrix Factorization in Recommendation
Rating Prediction with Topic Gradient Descent Method for Matrix Factorization in Recommendation Guan-Shen Fang, Sayaka Kamei, Satoshi Fujita Department of Information Engineering Hiroshima University Hiroshima,
Recommender Systems with Social Regularization
Recommender Systems with Social Regularization Hao Ma The Chinese University of Hong Kong Shatin, N.T., Hong Kong hma@cse.cuhk.edu.hk Michael R. Lyu The Chinese University of Hong Kong Shatin, N.T., Hong
Andriy Mnih and Ruslan Salakhutdinov
MATRIX FACTORIZATION METHODS FOR COLLABORATIVE FILTERING Andriy Mnih and Ruslan Salakhutdinov University of Toronto, Machine Learning Group 1 What is collaborative filtering? The goal of collaborative
Evolutionary Games on Networks. Wen-Xu Wang and G Ron Chen Center for Chaos and Complex Networks
Evolutionary Games on Networks Wen-Xu Wang and G Ron Chen Center for Chaos and Complex Networks Email: wenxuw@gmail.com; wxwang@cityu.edu.hk Cooperative behavior among selfish individuals Evolutionary
Impact of Data Characteristics on Recommender Systems Performance
Impact of Data Characteristics on Recommender Systems Performance Gediminas Adomavicius YoungOk Kwon Jingjing Zhang Department of Information and Decision Sciences Carlson School of Management, University
Transfer Learning for Collective Link Prediction in Multiple Heterogenous Domains
Transfer Learning for Collective Link Prediction in Multiple Heterogenous Domains Bin Cao caobin@cse.ust.hk Nathan Nan Liu nliu@cse.ust.hk Qiang Yang qyang@cse.ust.hk Hong Kong University of Science and
Combining Heterogenous Social and Geographical Information for Event Recommendation
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Combining Heterogenous Social and Geographical Information for Event Recommendation Zhi Qiao,3, Peng Zhang 2, Yanan Cao 2, Chuan
Collaborative Filtering Applied to Educational Data Mining
Journal of Machine Learning Research (200) Submitted ; Published Collaborative Filtering Applied to Educational Data Mining Andreas Töscher commendo research 8580 Köflach, Austria andreas.toescher@commendo.at
Collaborative Topic Modeling for Recommending Scientific Articles
Collaborative Topic Modeling for Recommending Scientific Articles Chong Wang and David M. Blei Best student paper award at KDD 2011 Computer Science Department, Princeton University Presented by Tian Cao
Time-aware Collaborative Topic Regression: Towards Higher Relevance in Textual Item Recommendation
Time-aware Collaborative Topic Regression: Towards Higher Relevance in Textual Item Recommendation Anas Alzogbi Department of Computer Science, University of Freiburg 79110 Freiburg, Germany alzoghba@informatik.uni-freiburg.de
Improving Quality of Crowdsourced Labels via Probabilistic Matrix Factorization
Human Computation AAAI Technical Report WS-12-08 Improving Quality of Crowdsourced Labels via Probabilistic Matrix Factorization Hyun Joon Jung School of Information University of Texas at Austin hyunjoon@utexas.edu
Collaborative Filtering with Aspect-based Opinion Mining: A Tensor Factorization Approach
2012 IEEE 12th International Conference on Data Mining Collaborative Filtering with Aspect-based Opinion Mining: A Tensor Factorization Approach Yuanhong Wang,Yang Liu, Xiaohui Yu School of Computer Science
Note on Algorithm Differences Between Nonnegative Matrix Factorization And Probabilistic Latent Semantic Indexing
Note on Algorithm Differences Between Nonnegative Matrix Factorization And Probabilistic Latent Semantic Indexing 1 Zhong-Yuan Zhang, 2 Chris Ding, 3 Jie Tang *1, Corresponding Author School of Statistics,
A Randomized Approach for Crowdsourcing in the Presence of Multiple Views
A Randomized Approach for Crowdsourcing in the Presence of Multiple Views Presenter: Yao Zhou joint work with: Jingrui He - 1 - Roadmap Motivation Proposed framework: M2VW Experimental results Conclusion
Recurrent Latent Variable Networks for Session-Based Recommendation
Recurrent Latent Variable Networks for Session-Based Recommendation Panayiotis Christodoulou Cyprus University of Technology paa.christodoulou@edu.cut.ac.cy 27/8/2017 Panayiotis Christodoulou (C.U.T.)
ParaGraphE: A Library for Parallel Knowledge Graph Embedding
ParaGraphE: A Library for Parallel Knowledge Graph Embedding Xiao-Fan Niu, Wu-Jun Li National Key Laboratory for Novel Software Technology Department of Computer Science and Technology, Nanjing University,
Random Surfing on Multipartite Graphs
Random Surfing on Multipartite Graphs Athanasios N. Nikolakopoulos, Antonia Korba and John D. Garofalakis Department of Computer Engineering and Informatics, University of Patras December 07, 2016 IEEE
Collaborative Filtering on Ordinal User Feedback
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence Collaborative Filtering on Ordinal User Feedback Yehuda Koren Google yehudako@gmail.com Joseph Sill Analytics Consultant
Matrix Factorization Techniques For Recommender Systems. Collaborative Filtering
Matrix Factorization Techniques For Recommender Systems Collaborative Filtering Markus Freitag, Jan-Felix Schwarz 28 April 2011 Agenda 2 1. Paper Backgrounds 2. Latent Factor Models 3. Overfitting & Regularization
Predicting Neighbor Goodness in Collaborative Filtering
Predicting Neighbor Goodness in Collaborative Filtering Alejandro Bellogín and Pablo Castells {alejandro.bellogin, pablo.castells}@uam.es Universidad Autónoma de Madrid Escuela Politécnica Superior Introduction:
A Matrix Factorization Technique with Trust Propagation for Recommendation in Social Networks
A Matrix Factorization Technique with Trust Propagation for Recommendation in Social Networks ABSTRACT Mohsen Jamali School of Computing Science Simon Fraser University Burnaby, BC, Canada mohsen_jamali@cs.sfu.ca
Recommendation Systems
Recommendation Systems Popularity Recommendation Systems Predicting user responses to options Offering news articles based on users interests Offering suggestions on what the user might like to buy/consume
Recommendations in Signed Social Networks
Recommendations in Signed Social Networks Jiliang Tang, Charu Aggarwal #, and Huan Liu Computer Science & Engineering, Arizona State University, Tempe, AZ, USA Yahoo Labs, Sunnyvalue, CA, USA # IBM T.
Scalable Bayesian Matrix Factorization
Scalable Bayesian Matrix Factorization Avijit Saha,1, Rishabh Misra,2, and Balaraman Ravindran 1 1 Department of CSE, Indian Institute of Technology Madras, India {avijit, ravi}@cse.iitm.ac.in 2 Department
Algorithms for Collaborative Filtering
Algorithms for Collaborative Filtering or How to Get Half Way to Winning $1million from Netflix Todd Lipcon Advisor: Prof. Philip Klein The Real-World Problem E-commerce sites would like to make personalized
Collaborative Filtering with Social Local Models
2017 IEEE International Conference on Data Mining Collaborative Filtering with Social Local Models Huan Zhao, Quanming Yao 1, James T. Kwok and Dik Lun Lee Department of Computer Science and Engineering
Semantics with Dense Vectors. Reference: D. Jurafsky and J. Martin, Speech and Language Processing
Semantics with Dense Vectors Reference: D. Jurafsky and J. Martin, Speech and Language Processing 1 Semantics with Dense Vectors We saw how to represent a word as a sparse vector with dimensions corresponding
Time-aware Point-of-interest Recommendation
Time-aware Point-of-interest Recommendation Quan Yuan, Gao Cong, Zongyang Ma, Aixin Sun, and Nadia Magnenat-Thalmann School of Computer Engineering Nanyang Technological University Presented by ShenglinZHAO
Fast Nonnegative Matrix Factorization with Rank-one ADMM
Fast Nonnegative Matrix Factorization with Rank-one Dongjin Song, David A. Meyer, Martin Renqiang Min, Department of ECE, UCSD, La Jolla, CA, 9093-0409 dosong@ucsd.edu Department of Mathematics, UCSD,
Item Recommendation for Emerging Online Businesses
Item Recommendation for Emerging Online Businesses Chun-Ta Lu Sihong Xie Weixiang Shao Lifang He Philip S. Yu University of Illinois at Chicago Presenter: Chun-Ta Lu New Online Businesses Emerge Rapidly
Collaborative Filtering with Entity Similarity Regularization in Heterogeneous Information Networks
Collaborative Filtering with Entity Similarity Regularization in Heterogeneous Information Networks Xiao Yu Xiang Ren Quanquan Gu Yizhou Sun Jiawei Han University of Illinois at Urbana-Champaign, Urbana,
Missing Data Prediction in Multi-source Time Series with Sensor Network Regularization
Missing Data Prediction in Multi-source Time Series with Sensor Network Regularization Weiwei Shi, Yongxin Zhu, Xiao Pan, Philip S. Yu, Bin Liu, and Yufeng Chen School of Microelectronics, Shanghai Jiao
Similar but Different: Exploiting Users Congruity for Recommendation Systems
Similar but Different: Exploiting Users Congruity for Recommendation Systems Ghazaleh Beigi and Huan Liu {gbeigi, huan.liu}@asu.edu Arizona State University, Tempe, Arizona, USA Abstract. The pervasive
Data Mining Techniques
Data Mining Techniques CS 622 - Section 2 - Spring 27 Pre-final Review Jan-Willem van de Meent Feedback Feedback https://goo.gl/er7eo8 (also posted on Piazza) Also, please fill out your TRACE evaluations!
Outliers Treatment in Support Vector Regression for Financial Time Series Prediction
Outliers Treatment in Support Vector Regression for Financial Time Series Prediction Haiqin Yang, Kaizhu Huang, Laiwan Chan, Irwin King, and Michael R. Lyu Department of Computer Science and Engineering
TopicMF: Simultaneously Exploiting Ratings and Reviews for Recommendation
Proceedings of the wenty-eighth AAAI Conference on Artificial Intelligence opicmf: Simultaneously Exploiting Ratings and Reviews for Recommendation Yang Bao Hui Fang Jie Zhang Nanyang Business School,
Synergies that Matter: Efficient Interaction Selection via Sparse Factorization Machine
Synergies that Matter: Efficient Interaction Selection via Sparse Factorization Machine Jianpeng Xu, Kaixiang Lin, Pang-Ning Tan, Jiayu Zhou Department of Computer Science and Engineering, Michigan State
New Feedback Control Model in the Lattice Hydrodynamic Model Considering the Historic Optimal Velocity Difference Effect
Commun. Theor. Phys. 70 (2018) 803 807 Vol. 70, No. 6, December 1, 2018 New Feedback Control Model in the Lattice Hydrodynamic Model Considering the Historic Optimal Velocity Difference Effect Guang-Han
Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen. Recommendation. Tobias Scheffer
Universität Potsdam Institut für Informatik Lehrstuhl Maschinelles Lernen Recommendation Tobias Scheffer Recommendation Engines Recommendation of products, music, contacts,.. Based on user features, item
Inferring Friendship from Check-in Data of Location-Based Social Networks
Inferring Friendship from Check-in Data of Location-Based Social Networks Ran Cheng, Jun Pang, Yang Zhang Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg
A Bayesian Treatment of Social Links in Recommender Systems ; CU-CS
University of Colorado, Boulder CU Scholar Computer Science Technical Reports Computer Science Spring 5--0 A Bayesian Treatment of Social Links in Recommender Systems ; CU-CS-09- Mike Gartrell University
Preserving Privacy in Data Mining using Data Distortion Approach
Preserving Privacy in Data Mining using Data Distortion Approach Mrs. Prachi Karandikar #, Prof. Sachin Deshpande * # M.E. Comp,VIT, Wadala, University of Mumbai * VIT Wadala,University of Mumbai 1. prachiv21@yahoo.co.in
2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media,
2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising
Collaborative Filtering via Ensembles of Matrix Factorizations
Collaborative Ftering via Ensembles of Matrix Factorizations Mingrui Wu Max Planck Institute for Biological Cybernetics Spemannstrasse 38, 72076 Tübingen, Germany mingrui.wu@tuebingen.mpg.de ABSTRACT We
Modeling User Rating Profiles For Collaborative Filtering
Modeling User Rating Profiles For Collaborative Filtering Benjamin Marlin Department of Computer Science University of Toronto Toronto, ON, M5S 3H5, CANADA marlin@cs.toronto.edu Abstract In this paper
Collaborative Filtering
Collaborative Filtering Nicholas Ruozzi University of Texas at Dallas based on the slides of Alex Smola & Narges Razavian Collaborative Filtering Combining information among collaborating entities to make
Large-scale Ordinal Collaborative Filtering
Large-scale Ordinal Collaborative Filtering Ulrich Paquet, Blaise Thomson, and Ole Winther Microsoft Research Cambridge, University of Cambridge, Technical University of Denmark ulripa@microsoft.com,brmt2@cam.ac.uk,owi@imm.dtu.dk
Kronecker Product Approximation with Multiple Factor Matrices via the Tensor Product Algorithm
Kronecker Product Approximation with Multiple actor Matrices via the Tensor Product Algorithm King Keung Wu, Yeung Yam, Helen Meng and Mehran Mesbahi Department of Mechanical and Automation Engineering,
CS 277: Data Mining. Mining Web Link Structure. CS 277: Data Mining Lectures Analyzing Web Link Structure Padhraic Smyth, UC Irvine
CS 277: Data Mining Mining Web Link Structure Class Presentations In-class, Tuesday and Thursday next week 2-person teams: 6 minutes, up to 6 slides, 3 minutes/slides each person 1-person teams 4 minutes,
Probabilistic Local Matrix Factorization based on User Reviews
Probabilistic Local Matrix Factorization based on User Reviews Xu Chen 1, Yongfeng Zhang 2, Wayne Xin Zhao 3, Wenwen Ye 1 and Zheng Qin 1 1 School of Software, Tsinghua University 2 College of Information
What is Happening Right Now... That Interests Me?
What is Happening Right Now... That Interests Me? Online Topic Discovery and Recommendation in Twitter Ernesto Diaz-Aviles 1, Lucas Drumond 2, Zeno Gantner 2, Lars Schmidt-Thieme 2, and Wolfgang Nejdl
Matrix Factorization and Factorization Machines for Recommender Systems
Talk at SDM workshop on Machine Learning Methods on Recommender Systems, May 2, 215 Chih-Jen Lin (National Taiwan Univ.) 1 / 54 Matrix Factorization and Factorization Machines for Recommender Systems Chih-Jen
Little Is Much: Bridging Cross-Platform Behaviors through Overlapped Crowds
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16) Little Is Much: Bridging Cross-Platform Behaviors through Overlapped Crowds Meng Jiang, Peng Cui Tsinghua University Nicholas
A Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem
A Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem Kangkang Deng, Zheng Peng Abstract: The main task of genetic regulatory networks is to construct a
Aspect Term Extraction with History Attention and Selective Transformation 1
Aspect Term Extraction with History Attention and Selective Transformation 1 Xin Li 1, Lidong Bing 2, Piji Li 1, Wai Lam 1, Zhimou Yang 3 Presenter: Lin Ma 2 1 The Chinese University of Hong Kong 2 Tencent
Orthogonal Nonnegative Matrix Factorization: Multiplicative Updates on Stiefel Manifolds
Orthogonal Nonnegative Matrix Factorization: Multiplicative Updates on Stiefel Manifolds Jiho Yoo and Seungjin Choi Department of Computer Science Pohang University of Science and Technology San 31 Hyoja-dong,
Exploiting Emotion on Reviews for Recommender Systems
Exploiting Emotion on Reviews for Recommender Systems Xuying Meng 1,2, Suhang Wang 3, Huan Liu 3 and Yujun Zhang 1 1 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China
Self-Tuning Spectral Clustering
Self-Tuning Spectral Clustering Lihi Zelnik-Manor Pietro Perona Department of Electrical Engineering Department of Electrical Engineering California Institute of Technology California Institute of Technology
Deleting a marked state in quantum database in a duality computing mode
Article Quantum Information August 013 Vol. 58 o. 4: 97 931 doi: 10.1007/s11434-013-595-9 Deleting a marked state in quantum database in a duality computing mode LIU Yang 1, 1 School of uclear Science
Probabilistic Partial User Model Similarity for Collaborative Filtering
Probabilistic Partial User Model Similarity for Collaborative Filtering Amancio Bouza, Gerald Reif, Abraham Bernstein Department of Informatics, University of Zurich {bouza,reif,bernstein}@ifi.uzh.ch Abstract.
Collaborative Filtering with Temporal Dynamics with Using Singular Value Decomposition
ISSN 1330-3651 (Print), ISSN 1848-6339 (Online) https://doi.org/10.17559/tv-20160708140839 Original scientific paper Collaborative Filtering with Temporal Dynamics with Using Singular Value Decomposition
SOFTWARE ARCHITECTURE DESIGN OF GIS WEB SERVICE AGGREGATION BASED ON SERVICE GROUP
SOFTWARE ARCHITECTURE DESIGN OF GIS WEB SERVICE AGGREGATION BASED ON SERVICE GROUP LIU Jian-chuan*, YANG Jun, TAN Ming-jian, GAN Quan Sichuan Geomatics Center, Chengdu 610041, China Keywords: GIS; Web;
Learning Optimal Ranking with Tensor Factorization for Tag Recommendation
Learning Optimal Ranking with Tensor Factorization for Tag Recommendation Steffen Rendle, Leandro Balby Marinho, Alexandros Nanopoulos, Lars Schmidt-Thieme Information Systems and Machine Learning Lab
A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE SIMILARITY
IJAMML 3:1 (015) 69-78 September 015 ISSN: 394-58 Available at http://scientificadvances.co.in DOI: http://dx.doi.org/10.1864/ijamml_710011547 A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE
Three Steps toward Tuning the Coordinate Systems in Nature-Inspired Optimization Algorithms
Three Steps toward Tuning the Coordinate Systems in Nature-Inspired Optimization Algorithms Yong Wang and Zhi-Zhong Liu School of Information Science and Engineering Central South University ywang@csu.edu.cn
Discerning individual interests and shared interests for social user profiling
World Wide Web (2017) 20:417 435 DOI 10.1007/s11280-016-0397-x Discerning individual interests and shared interests for social user profiling Enhong Chen 1 Guangxiang Zeng 1 Ping Luo 2 Hengshu Zhu 3 Jilei