Ruixin Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ruixin Ma has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Liang Zhao
Dalian University of Technology, Dalian, Liaoning, China
6 shared publications - Yunlong Ma
School of Software Technology, Dalian University of Technology, Dalian, China
4 shared publications Xiya Bu
3 shared publications- Xu Yuan
School of Software Technology, Dalian University of Technology, Dalian 116024, China
3 shared publications - Biao Mei
School of Software Technology, Dalian University of Technology, Dalian, China
2 shared publications - Hao Wu
School of Software Technology, Dalian University of Technology, Dalian, China
2 shared publications
Latest Publications
- Open Access
Explicit and Implicit Feature Contrastive Learning Model for Knowledge Graph Link Prediction
Knowledge graph link prediction is crucial for constructing triples in knowledge graphs, which aim to infer whether there is a relation between the entities. Recently, graph neural networks and contrastive learning have demonstrated superior performance compared with traditional translation-based models; they successfully extracted common features through explicit linking between entities. However, the implicit associations between entities without a linking relationship are ignored, which impedes the model from capturing distant but semantically rich entities. In addition, directly applying contrastive learning based on random node dropout to link prediction tasks, or limiting it to triplet-level, leads to constrained model performance. To address these challenges, we design an implicit feature extraction module that utilizes the clustering characteristics of latent vector space to find entities with potential associations and enrich entity representations by mining similar semantic features from the conceptual level. Meanwhile, the subgraph mechanism is introduced to preserve the structural information of explicitly connected entities. Implicit semantic features and explicit structural features serve as complementary information to provide high-quality self-supervised signals. Experiments are conducted on three benchmark knowledge graph datasets. The results validate that our model outperforms the state-of-the-art baselines in link prediction tasks.
Open AccessExplicit and Implicit Feature Contrastive Learning Model for Knowledge Graph Link Prediction
Knowledge graph link prediction is crucial for constructing triples in knowledge graphs, which aim to infer whether there is a relation between the entities. Recently, graph neural networks and contrastive learning have demonstrated superior performance compared with traditional translation-based models; they successfully extracted common features through explicit linking between entities. However, the implicit associations between entities without a linking relationship are ignored, which impedes the model from capturing distant but semantically rich entities. In addition, directly applying contrastive learning based on random node dropout to link prediction tasks, or limiting it to triplet-level, leads to constrained model performance. To address these challenges, we design an implicit feature extraction module that utilizes the clustering characteristics of latent vector space to find entities with potential associations and enrich entity representations by mining similar semantic features from the conceptual level. Meanwhile, the subgraph mechanism is introduced to preserve the structural information of explicitly connected entities. Implicit semantic features and explicit structural features serve as complementary information to provide high-quality self-supervised signals. Experiments are conducted on three benchmark knowledge graph datasets. The results validate that our model outperforms the state-of-the-art baselines in link prediction tasks.
- 16 August 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 257
Knowledge graph fine-grained network with attribute transfer for recommendation
- 16 August 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 257
Knowledge graph fine-grained network with attribute transfer for recommendation
- 15 May 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 253
Attribute mining multi-view contrastive learning network for recommendation
- 15 May 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 253
Attribute mining multi-view contrastive learning network for recommendation
- 26 December 2023
- Published by Springer Nature
- p. 319-330
Multi-view Contrastive Learning Network for Recommendation
- 26 December 2023
- Published by Springer Nature
- p. 319-330
Multi-view Contrastive Learning Network for Recommendation
- 18 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Multi-view semantic enhancement model for few-shot knowledge graph completion
- 18 October 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 238
Multi-view semantic enhancement model for few-shot knowledge graph completion
- 9 April 2023
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 37 (4) , 1591-1608
One-shot relational learning for extrapolation reasoning on temporal knowledge graphs
- 9 April 2023
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 37 (4) , 1591-1608
One-shot relational learning for extrapolation reasoning on temporal knowledge graphs
- 19 July 2022
- Published by Springer Nature
- p. 201-213
Multi-attention User Information Based Graph Convolutional Networks for Explainable Recommendation
- 19 July 2022
- Published by Springer Nature
- p. 201-213
Multi-attention User Information Based Graph Convolutional Networks for Explainable Recommendation
- Open Access
- 12 May 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (10) , 4899
Knowledge Graph Extrapolation Network with Transductive Learning for Recommendation
A knowledge graph is introduced into the personalized recommendation algorithm due to its strong ability to express structural information and exploit side information. However, there is a long tail phenomenon and data sparsity in real knowledge graphs, and most items are related to only a few triples. This results in a significant reduction in the amount of data available for training, and makes it difficult to make accurate recommendations. Motivated by these limitations, the Knowledge Graph Extrapolation Network with Transductive Learning for Recommendation (KGET) is proposed to improve recommendation quality. To be specific, the method first learns the embedding of users and items by knowledge propagation combined with collaborative signal to obtain high-order structural information, and the attention mechanism is used to distinguish the contributions of different neighbor nodes in propagation. In order to better solve with data sparsity and long tail phenomenon, transductive learning is designed to model links between unknown items to enrich feature representation to further extrapolate the knowledge graph. We conduct experiments with two datasets about music and books, the experiment results reveal that our proposed method outperforms state-of-the-art recommendation methods. KGET also achieves strong and stable performance in sparse data scenarios where items have merely a few triples.
- 12 May 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (10) , 4899
Open AccessKnowledge Graph Extrapolation Network with Transductive Learning for Recommendation
A knowledge graph is introduced into the personalized recommendation algorithm due to its strong ability to express structural information and exploit side information. However, there is a long tail phenomenon and data sparsity in real knowledge graphs, and most items are related to only a few triples. This results in a significant reduction in the amount of data available for training, and makes it difficult to make accurate recommendations. Motivated by these limitations, the Knowledge Graph Extrapolation Network with Transductive Learning for Recommendation (KGET) is proposed to improve recommendation quality. To be specific, the method first learns the embedding of users and items by knowledge propagation combined with collaborative signal to obtain high-order structural information, and the attention mechanism is used to distinguish the contributions of different neighbor nodes in propagation. In order to better solve with data sparsity and long tail phenomenon, transductive learning is designed to model links between unknown items to enrich feature representation to further extrapolate the knowledge graph. We conduct experiments with two datasets about music and books, the experiment results reveal that our proposed method outperforms state-of-the-art recommendation methods. KGET also achieves strong and stable performance in sparse data scenarios where items have merely a few triples.
- Open Access
- 23 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (9) , 4284
Adaptive Attentional Network for Few-Shot Relational Learning of Knowledge Graphs
Few-shot knowledge graph reasoning is a research focus in the field of knowledge graph reasoning. At present, in order to expand the application scope of knowledge graphs, a large number of researchers are devoted to the study of the multi-shot knowledge graph model. However, as far as we know, the knowledge graph contains a large number of missing relations and entities, and there are not many reference examples at the time of training. In this paper, our goal is to be able to infer the correct entity given a few training instances, or even only one training instance is available. Therefore, we propose an adaptive attentional network for few-shot relational learning of knowledge graphs, extracting knowledge based on traditional embedding methods, using the Transformer mechanism and hierarchical attention mechanism to obtain hidden attributes of entities, and then using a noise checker to filter out unreasonable candidate entities. Our model produces large performance improvements on the NELL-One dataset.
- 23 April 2022
- Published by MDPI AG in Applied Sciences
- Vol. 12 (9) , 4284
Open AccessAdaptive Attentional Network for Few-Shot Relational Learning of Knowledge Graphs
Few-shot knowledge graph reasoning is a research focus in the field of knowledge graph reasoning. At present, in order to expand the application scope of knowledge graphs, a large number of researchers are devoted to the study of the multi-shot knowledge graph model. However, as far as we know, the knowledge graph contains a large number of missing relations and entities, and there are not many reference examples at the time of training. In this paper, our goal is to be able to infer the correct entity given a few training instances, or even only one training instance is available. Therefore, we propose an adaptive attentional network for few-shot relational learning of knowledge graphs, extracting knowledge based on traditional embedding methods, using the Transformer mechanism and hierarchical attention mechanism to obtain hidden attributes of entities, and then using a noise checker to filter out unreasonable candidate entities. Our model produces large performance improvements on the NELL-One dataset.
- Open Access
- 2 April 2021
- Published by Hindawi Limited in Scientific Programming
- Vol. 2021, 1-9
CPGAN : An Efficient Architecture Designing for Text-to-Image Generative Adversarial Networks Based on Canonical Polyadic Decomposition
Text-to-image synthesis is an important and challenging application of computer vision. Many interesting and meaningful text-to-image synthesis models have been put forward. However, most of the works pay attention to the quality of synthesis images, but rarely consider the size of these models. Large models contain many parameters and high delay, which makes it difficult to be deployed on mobile applications. To solve this problem, we propose an efficient architecture CPGAN for text-to-image generative adversarial networks (GAN) based on canonical polyadic decomposition (CPD). It is a general method to design the lightweight architecture of text-to-image GAN. To improve the stability of CPGAN, we introduce conditioning augmentation and the idea of autoencoder during the training process. Experimental results prove that our architecture CPGAN can maintain the quality of generated images and reduce at least 20 parameters and flops.
- 2 April 2021
- Published by Hindawi Limited in Scientific Programming
- Vol. 2021, 1-9
Open AccessCPGAN : An Efficient Architecture Designing for Text-to-Image Generative Adversarial Networks Based on Canonical Polyadic Decomposition
Text-to-image synthesis is an important and challenging application of computer vision. Many interesting and meaningful text-to-image synthesis models have been put forward. However, most of the works pay attention to the quality of synthesis images, but rarely consider the size of these models. Large models contain many parameters and high delay, which makes it difficult to be deployed on mobile applications. To solve this problem, we propose an efficient architecture CPGAN for text-to-image generative adversarial networks (GAN) based on canonical polyadic decomposition (CPD). It is a general method to design the lightweight architecture of text-to-image GAN. To improve the stability of CPGAN, we introduce conditioning augmentation and the idea of autoencoder during the training process. Experimental results prove that our architecture CPGAN can maintain the quality of generated images and reduce at least 20 parameters and flops.