Yi Yang

Dr. Yi Yang

the College of Computer Science and Technology, Huaibei Normal University, Huaibei, Anhui, China
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
3 June 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
YYYi Yang
Yi Yang
LHLixin Han
Lixin Han
YLYuanzhen Liu
Yuanzhen Liu
JZJun Zhu
Jun Zhu
HYHong Yan
Hong Yan
Inspired by the accuracy and efficiency of the $\gamma$ -norm of a matrix, which is closer to the original rank minimization problem than nuclear norm minimization (NNM), we generalize the $\gamma$ -norm of a matrix to tensors and propose a new tensor completion approach within the tensor singular value decomposition (t-svd) framework. An efficient algorithm, which combines the augmented Lagrange multiplier and closed-resolution of a cubic equation, was developed to solve the associated nonconvex tensor multi-rank minimization problem. Experimental results show that the proposed approach has an advantage over current state of the art algorithms in recovery accuracy.

24 October 2018 in IEEE Access
Verified
Journal Article
Open access
YYYi Yang
Yi Yang
LHLixin Han
Lixin Han
ZGZhinan Gou
Zhinan Gou
BDBaobin Duan
Baobin Duan
JZJun Zhu
Jun Zhu
HYHong Yan
Hong Yan
In order to address data sparsity, missing value, and over-fitting problems in a social tagging system, a coupled matrix and tensor factorization (CMTF) method named Tagrec-CMTF for tag recommendation is proposed in this paper. In the CMTF method, we decompose the tag-item-user tensor joint with tag graph and two auxiliary matrices by using the CMTF, optimize the learning parameters with an alternating direction method of multipliers algorithm, and recommend the tag according to the predicted tensor. Our algorithm infuses the homogeneous and heterogeneous information of the tag and provides good prediction performance. Experiment results show that Tagrec-CMTF outperforms existing methods that do not utilize the homogeneous and heterogeneous information of the tag simultaneously.

1 February 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
BDBaobin Duan
Baobin Duan
LHLixin Han
Lixin Han
ZGZhinan Gou
Zhinan Gou
YYYi Yang
Yi Yang
SCShuangshuang Chen
Shuangshuang Chen
With the universal existence of mixed data with numerical and categorical attributes in real world, a variety of clustering algorithms have been developed to discover the potential information hidden in mixed data. Most existing clustering algorithms often compute the distances or similarities between data objects based on original data, which may cause the instability of clustering results because of noise. In this paper, a clustering framework is proposed to explore the grouping structure of the mixed data. First, the transformed categorical attributes by one-hot encoding technique and normalized numerical attributes are input to a stacked denoising autoencoders to learn the internal feature representations. Secondly, based on these feature representations, all the distances between data objects in feature space can be calculated and the local density and relative distance of each data object can be also computed. Thirdly, the density peaks clustering algorithm is improved and employed to allocate all the data objects into different clusters. Finally, experiments conducted on some UCI datasets have demonstrated that our proposed algorithm for clustering mixed data outperforms three baseline algorithms in terms of the clustering accuracy and the rand index.

15 July 2019 in IEEE Access
Verified
Journal Article
Open access
YLYuanzhen Liu
Yuanzhen Liu
LHLixin Han
Lixin Han
ZGZhinan Gou
Zhinan Gou
YYYi Yang
Yi Yang
The diffusion-based algorithm is a promising member of the family of recommendation algorithms. It makes recommendations through the diffusion process on user-object bipartite graphs. However, a user's taste is often influenced by his/her trusted friends in social networks. In this paper, we propose a new trust-based diffusion on tripartite graphs, which integrates explicit trust relations and implicit trust relations into the diffusion process. Explicit trust relations are obtained from the social networks while implicit trust relations are inferred from implicit feedback. The experimental results indicate that our proposed method has a remarkable improvement in accuracy, and even only implicit trust relations employed, that is, diffusion on user-object bipartite graphs, the recommendation accuracy is still enhanced. We further present a general framework of applying implicit trust relations and explicit trust relations into basic network-based diffusion method, which is more general and flexible, and specific parameters can be selected to meet actual requirements for different datasets and real-world online platforms.

6 December 2019 in Symmetry
Verified
Journal Article
Open access
PDF file
ZGZhinan Gou
Zhinan Gou
ZHZheng HUO
Zheng HUO
YLYuanzhen Liu
Yuanzhen Liu
YYYi Yang
Yi Yang
Supervised topic modeling has been successfully applied in the fields of document classification and tag recommendation in recent years. However, most existing models neglect the fact that topic terms have the ability to distinguish topics. In this paper, we propose a term frequency-inverse topic frequency (TF-ITF) method for constructing a supervised topic model, in which the weight of each topic term indicates the ability to distinguish topics. We conduct a series of experiments with not only the symmetric Dirichlet prior parameters but also the asymmetric Dirichlet prior parameters. Experimental results demonstrate that the result of introducing TF-ITF into a supervised topic model outperforms several state-of-the-art supervised topic models.

1 April 2021 in Expert Systems with Applications
Verified
Journal Article
Closed access
JZJun Zhu
Jun Zhu
LHLixin Han
Lixin Han
ZGZhinan Gou
Zhinan Gou
YYYi Yang
Yi Yang
XYXiaofeng Yuan
Xiaofeng Yuan
SLShu Li
Shu Li