7,019 research outputs found
Deep matrix factorization for trust-aware recommendation in social networks
Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE
Explainable Recommendation: Theory and Applications
Although personalized recommendation has been investigated for decades, the
wide adoption of Latent Factor Models (LFM) has made the explainability of
recommendations a critical issue to both the research community and practical
application of recommender systems. For example, in many practical systems the
algorithm just provides a personalized item recommendation list to the users,
without persuasive personalized explanation about why such an item is
recommended while another is not. Unexplainable recommendations introduce
negative effects to the trustworthiness of recommender systems, and thus affect
the effectiveness of recommendation engines. In this work, we investigate
explainable recommendation in aspects of data explainability, model
explainability, and result explainability, and the main contributions are as
follows:
1. Data Explainability: We propose Localized Matrix Factorization (LMF)
framework based Bordered Block Diagonal Form (BBDF) matrices, and further
applied this technique for parallelized matrix factorization.
2. Model Explainability: We propose Explicit Factor Models (EFM) based on
phrase-level sentiment analysis, as well as dynamic user preference modeling
based on time series analysis. In this work, we extract product features and
user opinions towards different features from large-scale user textual reviews
based on phrase-level sentiment analysis techniques, and introduce the EFM
approach for explainable model learning and recommendation.
3. Economic Explainability: We propose the Total Surplus Maximization (TSM)
framework for personalized recommendation, as well as the model specification
in different types of online applications. Based on basic economic concepts, we
provide the definitions of utility, cost, and surplus in the application
scenario of Web services, and propose the general framework of web total
surplus calculation and maximization.Comment: 169 pages, in Chinese, 3 main research chapter
Scalable and interpretable product recommendations via overlapping co-clustering
We consider the problem of generating interpretable recommendations by
identifying overlapping co-clusters of clients and products, based only on
positive or implicit feedback. Our approach is applicable on very large
datasets because it exhibits almost linear complexity in the input examples and
the number of co-clusters. We show, both on real industrial data and on
publicly available datasets, that the recommendation accuracy of our algorithm
is competitive to that of state-of-art matrix factorization techniques. In
addition, our technique has the advantage of offering recommendations that are
textually and visually interpretable. Finally, we examine how to implement our
technique efficiently on Graphical Processing Units (GPUs).Comment: In IEEE International Conference on Data Engineering (ICDE) 201
CIMTDetect: A Community Infused Matrix-Tensor Coupled Factorization Based Method for Fake News Detection
Detecting whether a news article is fake or genuine is a crucial task in
today's digital world where it's easy to create and spread a misleading news
article. This is especially true of news stories shared on social media since
they don't undergo any stringent journalistic checking associated with main
stream media. Given the inherent human tendency to share information with their
social connections at a mouse-click, fake news articles masquerading as real
ones, tend to spread widely and virally. The presence of echo chambers (people
sharing same beliefs) in social networks, only adds to this problem of
wide-spread existence of fake news on social media. In this paper, we tackle
the problem of fake news detection from social media by exploiting the very
presence of echo chambers that exist within the social network of users to
obtain an efficient and informative latent representation of the news article.
By modeling the echo-chambers as closely-connected communities within the
social network, we represent a news article as a 3-mode tensor of the structure
- and propose a tensor factorization based method to
encode the news article in a latent embedding space preserving the community
structure. We also propose an extension of the above method, which jointly
models the community and content information of the news article through a
coupled matrix-tensor factorization framework. We empirically demonstrate the
efficacy of our method for the task of Fake News Detection over two real-world
datasets. Further, we validate the generalization of the resulting embeddings
over two other auxiliary tasks, namely: \textbf{1)} News Cohort Analysis and
\textbf{2)} Collaborative News Recommendation. Our proposed method outperforms
appropriate baselines for both the tasks, establishing its generalization.Comment: Presented at ASONAM'1
- …