Showing 1 - 10 of 45
The past few years have witnessed the great success of recommender systems, which can significantly help users to find out personalized items for them from the information era. One of the widest applied recommendation methods is the Matrix Factorization (MF). However, most of the researches on...
Persistent link: https://www.econbiz.de/10010730333
Recommender systems seek to find the interesting items by filtering out the worthless items. Collaborative filtering is one of the most successful recommendation approaches. It typically associates a user with a group of like-minded users based on their preferences over all the items and...
Persistent link: https://www.econbiz.de/10010872047
Collaborative tags are playing a more and more important role for the organization of information systems. In this paper, we study a personalized recommendation model making use of the ternary relations among users, objects and tags. We propose a measure of user similarity based on his...
Persistent link: https://www.econbiz.de/10010589156
In this paper, by applying a diffusion process, we propose a new index to quantify the similarity between two users in a user–object bipartite graph. To deal with the discrete ratings on objects, we use a multi-channel representation where each object is mapped to several channels with the...
Persistent link: https://www.econbiz.de/10010591705
We apply random graph modeling methodology to analyze bipartite consumer-product graphs that represent sales transactions to better understand consumer purchase behavior in e-commerce settings. Based on two real-world e-commerce data sets, we found that such graphs demonstrate topological...
Persistent link: https://www.econbiz.de/10009191395
The explosive growth of information asks for advanced information filtering techniques to solve the so-called information overload problem. A promising way is the recommender system which analyzes the historical records of users’ activities and accordingly provides personalized...
Persistent link: https://www.econbiz.de/10011060167
In this paper, we introduce a modified collaborative filtering (MCF) algorithm, which has remarkably higher accuracy than the standard collaborative filtering. In the MCF, instead of the cosine similarity index, the user–user correlations are obtained by a diffusion process. Furthermore, by...
Persistent link: https://www.econbiz.de/10011060618
Singular value decomposition (SVD) is a way to decompose a matrix into some successive approximation. This … then approximate it by SVD. Obtained matrix is very useful for creating new feature space. We prove our approach by …
Persistent link: https://www.econbiz.de/10011207173
The detection of chaotic behaviors in commodities, stock markets and weather data is usually complicated by large noise perturbation inherent to the underlying system. It is well known, that predictions, from pure deterministic chaotic systems can be accurate mainly in the short term. Thus, it...
Persistent link: https://www.econbiz.de/10010750796
We consider penalized singular value decomposition (SVD) for a (noisy) data matrix when the left singular vector has a … contrast to the penalized SVD models proposed by Huang et al. (2009) [12] and by Lee et al. (2010) [14]. We carry out some …
Persistent link: https://www.econbiz.de/10011042044