Guoshuai Zhao

Prof. Dr. Guoshuai Zhao


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 October 2013 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XQXueming Qian
Xueming Qian
HFHe Feng
He Feng
GZGuoshuai Zhao
Guoshuai Zhao
TMTao Mei
Tao Mei
With the advent and popularity of social network, more and more users like to share their experiences, such as ratings, reviews, and blogs. The new factors of social network like interpersonal influence and interest based on circles of friends bring opportunities and challenges for recommender system (RS) to solve the cold start and sparsity problem of datasets. Some of the social factors have been used in RS, but have not been fully considered. In this paper, three social factors, personal interest, interpersonal interest similarity, and interpersonal influence, fuse into a unified personalized recommendation model based on probabilistic matrix factorization. The factor of personal interest can make the RS recommend items to meet users' individualities, especially for experienced users. Moreover, for cold start users, the interpersonal interest similarity and interpersonal influence can enhance the intrinsic link among features in the latent space. We conduct a series of experiments on three rating datasets: Yelp, MovieLens, and Douban Movie. Experimental results show the proposed approach outperforms the existing RS approaches.

15 June 2020 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YWYuxia Wu
Yuxia Wu
KLKe Li
Ke Li
GZGuoshuai Zhao
Guoshuai Zhao
XQXueming Qian
Xueming Qian
Next POI recommendation has been studied extensively in recent years. The goal is to recommend next POI for users at specific time given users' historical check-in data. Therefore, it is crucial to model both users' general taste and recent sequential behavior. Moreover, different users show different dependencies on the two parts. However, most existing methods learn the same dependencies for different users. Besides, the locations and categories of POIs contain different information about users' preference. However, current researchers always treat them as the same factors or believe that categories determined where to go. To this end, we propose a novel method named Personalized Long- and Short-term Preference Learning (PLSPL) to learn the specific preference for each user. Specially, we combine the long- and short-term preference via user-based attention mechanism to learn the personalized weights on different parts for different users. Besides, the context information such as the category and check-in time is also important to capture user preference. Therefore, in long-term module, we consider the contextual features of POIs in users' history records and leverage attention mechanism to capture users' preference. In the short-term module, we train two LSTM models for location- and category-based sequence, respectively.

22 September 2020 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
QWQianqian Wang
Qianqian Wang
JCJiafeng Cheng
Jiafeng Cheng
QGQuanxue Gao
Quanxue Gao
GZGuoshuai Zhao
Guoshuai Zhao
LJLicheng Jiao
Licheng Jiao
Deep multi-view subspace clustering has achieved promising performance compared with other multi-view clustering. However, existing deep multi-view subspace clustering only considers the global structure for all views, and they ignore the local geometric structure among each view. In addition, they cannot learn discriminative feature on different clusters of different views, i.e., inter-cluster difference. To solve these problems, in this paper, we propose a novel Deep Multi-view Subspace Clustering with Unified and Discriminative Learning (DMSC-UDL). DMSC-UDL combines global and local structures with self-expression layer. The global and local structures help each other forward and achieve small distance between samples of the same cluster. To make samples in different clusters of different views farther, DMSC-UDL uses a discriminative constraint between different views. In this way, DMSC-UDL makes the same cluster's samples have large weights, while different clusters' samples have small weights. Thus, it can learn a better shared connection matrix for multi-view clustering. Extensive experimental results reveal that the proposed multi-view clustering method is superior to several state-of-the-art multi-view clustering methods in terms of performance.

2 June 2016 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
XLXiaojiang Lei
Xiaojiang Lei
XQXueming Qian
Xueming Qian
GZGuoshuai Zhao
Guoshuai Zhao
In recent years, we have witnessed a flourish of review websites. It presents a great opportunity to share our viewpoints for various products we purchase. However, we face an information overloading problem. How to mine valuable information from reviews to understand a user's preferences and make an accurate recommendation is crucial. Traditional recommender systems (RS) consider some factors, such as user's purchase records, product category, and geographic location. In this work, we propose a sentiment-based rating prediction method (RPS) to improve prediction accuracy in recommender systems. Firstly, we propose a social user sentimental measurement approach and calculate each user's sentiment on items/products. Secondly, we not only consider a user's own sentimental attributes but also take interpersonal sentimental influence into consideration. Then, we consider product reputation, which can be inferred by the sentimental distributions of a user set that reflect customers' comprehensive evaluation. At last, we fuse three factors-user sentiment similarity, interpersonal sentimental influence, and item's reputation similarity-into our recommender system to make an accurate rating prediction. We conduct a performance evaluation of the three sentimental factors on a real-world dataset collected from Yelp. Our experimental results show the sentiment can well characterize user preferences, which helps to improve the recommendation performance.

6 January 2016 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
GZGuoshuai Zhao
Guoshuai Zhao
XQXueming Qian
Xueming Qian
XXXing Xie
Xing Xie
With the boom of social media, it is a very popular trend for people to share what they are doing with friends across various social networking platforms. Nowadays, we have a vast amount of descriptions, comments, and ratings for local services. The information is valuable for new users to judge whether the services meet their requirements before partaking. In this paper, we propose a user-service rating prediction approach by exploring social users' rating behaviors. In order to predict user-service ratings, we focus on users' rating behaviors. In our opinion, the rating behavior in recommender system could be embodied in these aspects: 1) when user rated the item, 2) what the rating is, 3) what the item is, 4) what the user interest that we could dig from his/her rating records is, and 5) how the user's rating behavior diffuses among his/her social friends. Therefore, we propose a concept of the rating schedule to represent users' daily rating behaviors. In addition, we propose the factor of interpersonal rating behavior diffusion to deep understand users' rating behaviors. In the proposed user-service rating prediction approach, we fuse four factors-user personal interest (related to user and the item's topics), interpersonal interest similarity (related to user interest), interpersonal rating behavior similarity (related to users' rating behavior habits), and interpersonal rating behavior diffusion (related to users' behavior diffusions)-into a unified matrix-factorized framework. We conduct a series of experiments in the Yelp dataset and Douban Movie dataset. Experimental results show the effectiveness of our approach.

20 January 2023 in Knowledge-Based Systems
Verified
Journal Article
Closed access
GZGuoshuai Zhao
Guoshuai Zhao
YLYiling Luo
Yiling Luo
QCQiang Chen
Qiang Chen
XQXueming Qian
Xueming Qian