Rongxin Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rongxin Chen has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Zhijin Wang
College of Computer Engineering, Jimei University, Xiamen, China
3 shared publications - Zongyue Wang
School of Computer Engineering, Jimei University, Xiamen 361021, China
3 shared publications - Hang Su
College of Computer Science, Beijing University of Technology, Beijing, China
2 shared publications Cun-Ying Song
School of Foreign Languages
1 shared publicationHu-Sheng Liao
1 shared publicationHui Sun
College of Computer Engineering Jimei University China
1 shared publication
Latest Publications
- 21 September 2026
- Published by Elsevier in Neurocomputing
- Vol. 708
Instance-level discriminative enhancement for few-shot relation extraction
- 21 September 2026
- Published by Elsevier in Neurocomputing
- Vol. 708
Instance-level discriminative enhancement for few-shot relation extraction
- Open Access
- 16 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 868-874
AI-enabled teaching reform of programming courses based on OBE
- 16 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 868-874
Open AccessAI-enabled teaching reform of programming courses based on OBE
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
Resource-Aware Scheduling of Graph Partitions for Distributed Graph Computing in Heterogeneous Clusters
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
Open AccessResource-Aware Scheduling of Graph Partitions for Distributed Graph Computing in Heterogeneous Clusters
- Open Access
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 2668-2677
Enhancing the Prototype Network with Local-to-Global Optimization for Few-Shot Relation Extraction
Hui Sun, Rongxin Chen. Findings of the Association for Computational Linguistics: NAACL 2025. 2025.
- 1 January 2025
- Published by Association for Computational Linguistics (ACL)
- p. 2668-2677
Open AccessEnhancing the Prototype Network with Local-to-Global Optimization for Few-Shot Relation Extraction
Hui Sun, Rongxin Chen. Findings of the Association for Computational Linguistics: NAACL 2025. 2025.
- 24 September 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (4) , 5420-5449
Parallel XPath query based on cost optimization
- 24 September 2021
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (4) , 5420-5449
Parallel XPath query based on cost optimization
- Open Access
- 20 August 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-14
Predicting Learning Behavior Using Log Data in Blended Teaching
Online and offline blended teaching mode, the future trend of higher education, has recently been widely used in colleges around the globe. In the article, we conducted a study on students learning behavior analysis and student performance prediction based on the data about students behavior logs in three consecutive years of blended teaching in a colleges Java Language Programming course. Firstly, the data from diverse platforms such as MOOC, Rain Classroom, PTA, and cnBlog are integrated and preprocessed. Secondly, a novel multiclass classification framework, combining the genetic algorithm (GA) and the error correcting output codes (ECOC) method, is developed to predict the grade levels of students. In the framework, GA is designed to realize both the feature selection and binary classifier selection to fit the ECOC models. Finally, key factors affecting grades are identified in line with the optimal subset of features selected by GA, which can be analyzed for teaching significance. The results show that the multiclass classification algorithm designed in this article can effectively predict grades compared with other algorithms. In addition, the selected subset of features corresponding to learning behaviors is pedagogically instructive.
- 20 August 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-14
Open AccessPredicting Learning Behavior Using Log Data in Blended Teaching
Online and offline blended teaching mode, the future trend of higher education, has recently been widely used in colleges around the globe. In the article, we conducted a study on students learning behavior analysis and student performance prediction based on the data about students behavior logs in three consecutive years of blended teaching in a colleges Java Language Programming course. Firstly, the data from diverse platforms such as MOOC, Rain Classroom, PTA, and cnBlog are integrated and preprocessed. Secondly, a novel multiclass classification framework, combining the genetic algorithm (GA) and the error correcting output codes (ECOC) method, is developed to predict the grade levels of students. In the framework, GA is designed to realize both the feature selection and binary classifier selection to fit the ECOC models. Finally, key factors affecting grades are identified in line with the optimal subset of features selected by GA, which can be analyzed for teaching significance. The results show that the multiclass classification algorithm designed in this article can effectively predict grades compared with other algorithms. In addition, the selected subset of features corresponding to learning behaviors is pedagogically instructive.
- Open Access
- 27 May 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-16
Pipelined XPath Query Based on Cost Optimization
XPath query is the key part of XML data processing, and its performance is usually critical for XML applications. In the process of XPath query, there is inherent seriality between query steps, which makes it difficult to parallelize the query effectively as a whole. On the other hand, although XPath query has the characteristics of data stream processing and is suitable for pipeline processing, the data flow of each query step usually varies a lot, which results in limited performance under multithreading conditions. In this paper, we propose a pipelined XPath query method (PXQ) based on cost optimization. This method uses pipelined query primitives to process query steps based on relation index. During pipeline construction, a cost estimation model based on XML statistics is proposed to estimate the cost of the query primitive and provide guidance for the creation of a pipeline phase through the partition of query primitive sequence. The pipeline construction technique makes full use of available worker threads and optimizes the load balance between pipeline stages. The experimental results show that our method can adapt to the multithreaded environment and stream processing scenarios of XPath query, and its performance is better than the existing typical query methods based on data parallelism.
- 27 May 2021
- Published by Wiley in Scientific Programming
- Vol. 2021, 1-16
Open AccessPipelined XPath Query Based on Cost Optimization
XPath query is the key part of XML data processing, and its performance is usually critical for XML applications. In the process of XPath query, there is inherent seriality between query steps, which makes it difficult to parallelize the query effectively as a whole. On the other hand, although XPath query has the characteristics of data stream processing and is suitable for pipeline processing, the data flow of each query step usually varies a lot, which results in limited performance under multithreading conditions. In this paper, we propose a pipelined XPath query method (PXQ) based on cost optimization. This method uses pipelined query primitives to process query steps based on relation index. During pipeline construction, a cost estimation model based on XML statistics is proposed to estimate the cost of the query primitive and provide guidance for the creation of a pipeline phase through the partition of query primitive sequence. The pipeline construction technique makes full use of available worker threads and optimizes the load balance between pipeline stages. The experimental results show that our method can adapt to the multithreaded environment and stream processing scenarios of XPath query, and its performance is better than the existing typical query methods based on data parallelism.
- 7 March 2016
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 72 (4) , 1517-1548
Automatic parallelization of XQuery programs on multi-core systems
- 7 March 2016
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 72 (4) , 1517-1548
Automatic parallelization of XQuery programs on multi-core systems
- 20 March 2011
- Published by China Science Publishing & Media Ltd. in Journal of Computer Applications
- Vol. 31 (3) , 839-842
Fractal computing parallelization and implementation in TBB
- 20 March 2011
- Published by China Science Publishing & Media Ltd. in Journal of Computer Applications
- Vol. 31 (3) , 839-842
Fractal computing parallelization and implementation in TBB