Li He
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Li He has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Xianzhi Wang
University of Technology Sydney, Sydney, Australia
4 shared publications - Guandong Xu
The Education University of Hong Kong, Hong Kong, China
3 shared publications - Hongxu Chen
The University of Queensland, Brisbane, Australia
2 shared publications - Bo Zheng
Alibaba Group, Hangzhou, China
1 shared publication - Chi Chen
Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China
1 shared publication - Chunxiao Xing
Tsinghua University
1 shared publication
Latest Publications
- Open Access
- 13 January 2024
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
- Vol. 9 (3) , 585-594
A topic‐controllable keywords‐to‐text generator with knowledge base network
With the introduction of more recent deep learning models such as encoder‐decoder, text generation frameworks have gained a lot of popularity. In Natural Language Generation (NLG), controlling the information and style of the output produced is a crucial and challenging task. The purpose of this paper is to develop informative and controllable text using social media language by incorporating topic knowledge into a keyword‐to‐text framework. A novel Topic‐Controllable Key‐to‐Text (TC‐K2T) generator that focuses on the issues of ignoring unordered keywords and utilising subject‐controlled information from previous research is presented. TC‐K2T is built on the framework of conditional language encoders. In order to guide the model to produce an informative and controllable language, the generator first inputs unordered keywords and uses subjects to simulate prior human knowledge. Using an additional probability term, the model increases the likelihood of topic words appearing in the generated text to bias the overall distribution. The proposed TC‐K2T can produce more informative and controllable senescence, outperforming state‐of‐the‐art models, according to empirical research on automatic evaluation metrics and human annotations.
- 13 January 2024
- Published by Institution of Engineering and Technology (IET) in CAAI Transactions on Intelligence Technology
- Vol. 9 (3) , 585-594
Open AccessA topic‐controllable keywords‐to‐text generator with knowledge base network
With the introduction of more recent deep learning models such as encoder‐decoder, text generation frameworks have gained a lot of popularity. In Natural Language Generation (NLG), controlling the information and style of the output produced is a crucial and challenging task. The purpose of this paper is to develop informative and controllable text using social media language by incorporating topic knowledge into a keyword‐to‐text framework. A novel Topic‐Controllable Key‐to‐Text (TC‐K2T) generator that focuses on the issues of ignoring unordered keywords and utilising subject‐controlled information from previous research is presented. TC‐K2T is built on the framework of conditional language encoders. In order to guide the model to produce an informative and controllable language, the generator first inputs unordered keywords and uses subjects to simulate prior human knowledge. Using an additional probability term, the model increases the likelihood of topic words appearing in the generated text to bias the overall distribution. The proposed TC‐K2T can produce more informative and controllable senescence, outperforming state‐of‐the‐art models, according to empirical research on automatic evaluation metrics and human annotations.
- Open Access
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 60-68
Simplifying Graph-based Collaborative Filtering for Recommendation
Graph Convolutional Networks (GCNs) are a popular type of machine learning models that use multiple layers of convolutional aggregation operations and non-linear activations to represent data. Recent studies apply GCNs to Collaborative Filtering (CF)-based recommender systems (RSs) by modeling user-item interactions as a bipartite graph and achieve superior performance. However, these models face difficulty in training with non-linear activations on large graphs. Besides, most GCN-based models could not model deeper layers due to the over-smoothing effect with the graph convolution operation. In this paper, we improve the GCN-based CF models from two aspects. First, we remove non-linearities to enhance recommendation performance, which is consistent with the theories in simple graph convolutional networks. Second, we obtain the initialization of the embedding for each node in the graph by computing the network embedding on the condensed graph, which alleviates the over smoothing problem in graph convolution aggregation operation with sparse interaction data. The proposed model is a linear model that is easy to train, scalable to large datasets, and shown to yield better efficiency and effectiveness on four real datasets.
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 60-68
Open AccessSimplifying Graph-based Collaborative Filtering for Recommendation
Graph Convolutional Networks (GCNs) are a popular type of machine learning models that use multiple layers of convolutional aggregation operations and non-linear activations to represent data. Recent studies apply GCNs to Collaborative Filtering (CF)-based recommender systems (RSs) by modeling user-item interactions as a bipartite graph and achieve superior performance. However, these models face difficulty in training with non-linear activations on large graphs. Besides, most GCN-based models could not model deeper layers due to the over-smoothing effect with the graph convolution operation. In this paper, we improve the GCN-based CF models from two aspects. First, we remove non-linearities to enhance recommendation performance, which is consistent with the theories in simple graph convolutional networks. Second, we obtain the initialization of the embedding for each node in the graph by computing the network embedding on the condensed graph, which alleviates the over smoothing problem in graph convolution aggregation operation with sparse interaction data. The proposed model is a linear model that is easy to train, scalable to large datasets, and shown to yield better efficiency and effectiveness on four real datasets.
- Open Access
- 14 August 2022
- Published by Association for Computing Machinery (ACM)
- p. 2732-2740
EXTR: Click-Through Rate Prediction with Externalities in E-Commerce Sponsored Search
Click-Through Rate (CTR) prediction, estimating the probability of a user clicking on items, plays a key fundamental role in sponsored search. E-commerce platforms display organic search results and advertisements (ads), collectively called items, together as a mixed list. The items displayed around the predicted ad, i.e. external items, may affect the user clicking on the predicted. Previous CTR models assume the user click only relies on the ad itself, which overlooks the effects of external items, referred to as external effects, or externalities. During the advertising prediction, the organic results have been generated by the organic system, while the final displayed ads on multiple ad slots have not been figured out, which leads to two challenges: 1) the predicted (target) ad may win any ad slot, bringing about diverse externalities. 2) external ads are undetermined, resulting in incomplete externalities. Facing the above challenges, inspired by the Transformer, we propose EXternality TRansformer (EXTR) which regards target ad with all slots as query and external items as key&value to model externalities in all exposure situations in parallel. Furthermore, we design a Potential Allocation Generator (PAG) for EXTR, to learn the allocation of potential external ads to complete the externalities. Extensive experimental results on Alibaba datasets demonstrate the effectiveness of externalities in the task of CTR prediction and illustrate that our proposed approach can bring significant profits to the real-world e-commerce platform. EXTR now has been successfully deployed in the online search advertising system in Alibaba, serving the main traffic.
- 14 August 2022
- Published by Association for Computing Machinery (ACM)
- p. 2732-2740
Open AccessEXTR: Click-Through Rate Prediction with Externalities in E-Commerce Sponsored Search
Click-Through Rate (CTR) prediction, estimating the probability of a user clicking on items, plays a key fundamental role in sponsored search. E-commerce platforms display organic search results and advertisements (ads), collectively called items, together as a mixed list. The items displayed around the predicted ad, i.e. external items, may affect the user clicking on the predicted. Previous CTR models assume the user click only relies on the ad itself, which overlooks the effects of external items, referred to as external effects, or externalities. During the advertising prediction, the organic results have been generated by the organic system, while the final displayed ads on multiple ad slots have not been figured out, which leads to two challenges: 1) the predicted (target) ad may win any ad slot, bringing about diverse externalities. 2) external ads are undetermined, resulting in incomplete externalities. Facing the above challenges, inspired by the Transformer, we propose EXternality TRansformer (EXTR) which regards target ad with all slots as query and external items as key&value to model externalities in all exposure situations in parallel. Furthermore, we design a Potential Allocation Generator (PAG) for EXTR, to learn the allocation of potential external ads to complete the externalities. Extensive experimental results on Alibaba datasets demonstrate the effectiveness of externalities in the task of CTR prediction and illustrate that our proposed approach can bring significant profits to the real-world e-commerce platform. EXTR now has been successfully deployed in the online search advertising system in Alibaba, serving the main traffic.
- 19 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 10 (5) , 2557-2565
Graph-Aware Deep Fusion Networks for Online Spam Review Detection
Product reviews on e-commerce platforms play a critical role in shaping users’ purchasing decisions. Unfortunately, online reviews sometimes can be intentionally misleading to manipulate the ecosystem. To date, existing methods to automatically detect “spam reviews” either focus on sophisticated feature engineering with traditional classification models or rely on tuning neural networks with aggregated features. In this article, we develop a novel graph-based model, namely, graph-aware deep fusion networks (GDFNs) that use information from relevant metadata (review text, features of users, and items) and relational data (network) to capture the semantic information from their complex heterogeneous interactions via graph convolutional networks (GCNs). Besides, GDFN also uses a novel fusion technique to synthesize low-and high-order interactions with propagated information across multiple review-related subgraphs. Extensive experiments on publicly available datasets show that our proposed model is effective and outperforms several strong state-of-the-art baselines.
- 19 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 10 (5) , 2557-2565
Graph-Aware Deep Fusion Networks for Online Spam Review Detection
Product reviews on e-commerce platforms play a critical role in shaping users’ purchasing decisions. Unfortunately, online reviews sometimes can be intentionally misleading to manipulate the ecosystem. To date, existing methods to automatically detect “spam reviews” either focus on sophisticated feature engineering with traditional classification models or rely on tuning neural networks with aggregated features. In this article, we develop a novel graph-based model, namely, graph-aware deep fusion networks (GDFNs) that use information from relevant metadata (review text, features of users, and items) and relational data (network) to capture the semantic information from their complex heterogeneous interactions via graph convolutional networks (GCNs). Besides, GDFN also uses a novel fusion technique to synthesize low-and high-order interactions with propagated information across multiple review-related subgraphs. Extensive experiments on publicly available datasets show that our proposed model is effective and outperforms several strong state-of-the-art baselines.
- Open Access
- 5 May 2022
- Published by Springer Nature in Human-Centric Intelligent Systems
- Vol. 2 (1-2) , 14-30
Online Spam Review Detection: A Survey of Literature
The increasingly developed online platform generates a large amount of online reviews every moment, e.g., Yelp and Amazon. Consumers gradually develop the habit of reading previous reviews before making a decision of buying or choosing various products. Online reviews play an vital part in determining consumers’ purchase choices in e-commerce, yet many online reviews are intentionally created to confuse or mislead potential consumers. Moreover, driven by product reputations and merchants’ profits, more and more spam reviews were inserted into online platform. This kind of reviews can be positive, negative or neutral, but they had common features: misleading consumers or damaging reputations. In the past decade, many people conducted research on detecting spam reviews using statistical or deep learning method with various datasets. In view of that, this article first introduces the task of spam online reviews detection and makes a common definition of spam reviews. Then, we comprehensively conclude the existing method and available datasets. Third, we summarize the existing network-based approaches in dealing with this task and propose some direction for future research.
- 5 May 2022
- Published by Springer Nature in Human-Centric Intelligent Systems
- Vol. 2 (1-2) , 14-30
Open AccessOnline Spam Review Detection: A Survey of Literature
The increasingly developed online platform generates a large amount of online reviews every moment, e.g., Yelp and Amazon. Consumers gradually develop the habit of reading previous reviews before making a decision of buying or choosing various products. Online reviews play an vital part in determining consumers’ purchase choices in e-commerce, yet many online reviews are intentionally created to confuse or mislead potential consumers. Moreover, driven by product reputations and merchants’ profits, more and more spam reviews were inserted into online platform. This kind of reviews can be positive, negative or neutral, but they had common features: misleading consumers or damaging reputations. In the past decade, many people conducted research on detecting spam reviews using statistical or deep learning method with various datasets. In view of that, this article first introduces the task of spam online reviews detection and makes a common definition of spam reviews. Then, we comprehensively conclude the existing method and available datasets. Third, we summarize the existing network-based approaches in dealing with this task and propose some direction for future research.
- Open Access
- 21 April 2020
- Published by Frontiers Media SA in Frontiers in Genetics
- Vol. 11, 328
Predicting the Disease Genes of Multiple Sclerosis Based on Network Representation Learning
Multiple sclerosis (MS) is an autoimmune disease for which it is difficult to find exact disease-related genes. Effectively identifying disease-related genes would contribute to improving the treatment and diagnosis of multiple sclerosis. Current methods for identifying disease-related genes mainly focus on the hypothesis of guilt-by-association and pay little attention to the global topological information of the whole protein-protein-interaction (PPI) network. Besides, network representation learning (NRL) has attracted a huge amount of attention in the area of network analysis because of its promising performance in node representation and many downstream tasks. In this paper, we try to introduce NRL into the task of disease-related gene prediction and propose a novel framework for identifying the disease-related genes multiple sclerosis. The proposed framework contains three main steps: capturing the topological structure of the PPI network using NRL-based methods, encoding learned features into low-dimensional space using a stacked autoencoder, and training a support vector machine (SVM) classifier to predict disease-related genes. Compared with three state-of-the-art algorithms, our proposed framework shows superior performance on the task of predicting disease-related genes of multiple sclerosis.
- 21 April 2020
- Published by Frontiers Media SA in Frontiers in Genetics
- Vol. 11, 328
Open AccessPredicting the Disease Genes of Multiple Sclerosis Based on Network Representation Learning
Multiple sclerosis (MS) is an autoimmune disease for which it is difficult to find exact disease-related genes. Effectively identifying disease-related genes would contribute to improving the treatment and diagnosis of multiple sclerosis. Current methods for identifying disease-related genes mainly focus on the hypothesis of guilt-by-association and pay little attention to the global topological information of the whole protein-protein-interaction (PPI) network. Besides, network representation learning (NRL) has attracted a huge amount of attention in the area of network analysis because of its promising performance in node representation and many downstream tasks. In this paper, we try to introduce NRL into the task of disease-related gene prediction and propose a novel framework for identifying the disease-related genes multiple sclerosis. The proposed framework contains three main steps: capturing the topological structure of the PPI network using NRL-based methods, encoding learned features into low-dimensional space using a stacked autoencoder, and training a support vector machine (SVM) classifier to predict disease-related genes. Compared with three state-of-the-art algorithms, our proposed framework shows superior performance on the task of predicting disease-related genes of multiple sclerosis.