Changsheng Ma
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
Changsheng Ma has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Bin Hu
Beijing Institute of Technology
2 shared publications - Minqiang Yang
Lanzhou University
2 shared publications - Qiang Yang
College of Medicine, University of Florida, Gainesville, Florida, USA
2 shared publications - Xin Gao
King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
2 shared publications - Chenchen Dai
Ant Group, Beijing, China
1 shared publication - Chengsheng Mao
Northwestern University
1 shared publication
Latest Publications
- 24 March 2026
- Published by Elsevier in Pattern Recognition
- Vol. 179
EmoRAct: A neuro-symbolic framework coupling acoustic tokens with prosody semantics for emotion recognition
- 24 March 2026
- Published by Elsevier in Pattern Recognition
- Vol. 179
EmoRAct: A neuro-symbolic framework coupling acoustic tokens with prosody semantics for emotion recognition
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 41297-41308
Echoes of Empathy: A Symbiotic IoT-Based Emotion Feedback Framework for Psychological Interventions via Large Language Model
Large AI models, connected to terminal devices via high-speed mobile communication networks, enable task collaboration and resource sharing, forming an intelligent framework for the Symbiotic Internet of Things (SIoT) paradigm in industry applications. Despite large language models hold significant potential for psychological intervention, their emotional interaction capabilities remain limited. This paper introduces a SIoT framework for psychological intervention and proposes an emotion-enhanced human-machine interaction architecture incorporating behavioral information captured by IoT devices. The system leverages ubiquitous sensing devices such as cameras and microphones, along with technologies like speech recognition and generation, as well as hyper-realistic digital humans, to create a natural interaction interface. Additionally, we introduce the end-of-utterance detection method and the behavior pattern control algorithm to facilitate smoother and more goal-oriented conversations. The proposed methods and prototype system have been validated through subjective and objective experiments, with results demonstrating their feasibility and suggesting that this approach could become one of the primary forms of humanmachine interaction for psychological intervention in the future.
- 2 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (20) , 41297-41308
Echoes of Empathy: A Symbiotic IoT-Based Emotion Feedback Framework for Psychological Interventions via Large Language Model
Large AI models, connected to terminal devices via high-speed mobile communication networks, enable task collaboration and resource sharing, forming an intelligent framework for the Symbiotic Internet of Things (SIoT) paradigm in industry applications. Despite large language models hold significant potential for psychological intervention, their emotional interaction capabilities remain limited. This paper introduces a SIoT framework for psychological intervention and proposes an emotion-enhanced human-machine interaction architecture incorporating behavioral information captured by IoT devices. The system leverages ubiquitous sensing devices such as cameras and microphones, along with technologies like speech recognition and generation, as well as hyper-realistic digital humans, to create a natural interaction interface. Additionally, we introduce the end-of-utterance detection method and the behavior pattern control algorithm to facilitate smoother and more goal-oriented conversations. The proposed methods and prototype system have been validated through subjective and objective experiments, with results demonstrating their feasibility and suggesting that this approach could become one of the primary forms of humanmachine interaction for psychological intervention in the future.
- Open Access
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 360-368
Multi-Intent Attribute-Aware Text Matching in Searching
Text matching systems have become a fundamental service in most Searching platforms. For instance, they are responsible for matching user queries to relevant candidate items, or rewriting the user-input query to a pre-selected high-performing one for a better search experience. In practice, both the queries and items often contain multiple attributes, such as the category of the item and the location mentioned in the query, which represent condensed key information that is helpful for matching. However, most of the existing works downplay the effectiveness of attributes by integrating them into text representations as supplementary information. Hence, in this work, we focus on exploring the relationship between the attributes from two sides. Since attributes from two ends are often not aligned in terms of number and type, we propose to exploit the benefit of attributes by multiple-intent modeling. The intents extracted from attributes summarize the diverse needs of queries and provide rich content of items, which are more refined and abstract, and can be aligned for paired inputs. Concretely, we propose a multi-intent attribute-aware matching model (MIM), which consists of three main components: attribute-aware encoder, multi-intent modeling, and intent-aware matching. In the attribute-aware encoder, the text and attributes are weighted and processed through a scaled attention mechanism with regard to the attributes' importance. Afterward, the multi-intent modeling extracts intents from two ends and aligns them. Herein, we come up with a distribution loss to ensure the learned intents are diverse but concentrated, and a kullback-leibler divergence loss that aligns the learned intents. Finally, in the intent-aware matching, the intents are evaluated by a self-supervised masking task, and then incorporated to output the final matching result. Extensive experiments on three real-world datasets from different matching scenarios show that MIM significantly outperforms state-of-the-art matching baselines. MIM is also tested by online A/B test, which brings significant improvements over three business metrics in query rewriting and query-item relevance tasks compared with the online baseline in Alipay App.
- 4 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 360-368
Open AccessMulti-Intent Attribute-Aware Text Matching in Searching
Text matching systems have become a fundamental service in most Searching platforms. For instance, they are responsible for matching user queries to relevant candidate items, or rewriting the user-input query to a pre-selected high-performing one for a better search experience. In practice, both the queries and items often contain multiple attributes, such as the category of the item and the location mentioned in the query, which represent condensed key information that is helpful for matching. However, most of the existing works downplay the effectiveness of attributes by integrating them into text representations as supplementary information. Hence, in this work, we focus on exploring the relationship between the attributes from two sides. Since attributes from two ends are often not aligned in terms of number and type, we propose to exploit the benefit of attributes by multiple-intent modeling. The intents extracted from attributes summarize the diverse needs of queries and provide rich content of items, which are more refined and abstract, and can be aligned for paired inputs. Concretely, we propose a multi-intent attribute-aware matching model (MIM), which consists of three main components: attribute-aware encoder, multi-intent modeling, and intent-aware matching. In the attribute-aware encoder, the text and attributes are weighted and processed through a scaled attention mechanism with regard to the attributes' importance. Afterward, the multi-intent modeling extracts intents from two ends and aligns them. Herein, we come up with a distribution loss to ensure the learned intents are diverse but concentrated, and a kullback-leibler divergence loss that aligns the learned intents. Finally, in the intent-aware matching, the intents are evaluated by a self-supervised masking task, and then incorporated to output the final matching result. Extensive experiments on three real-world datasets from different matching scenarios show that MIM significantly outperforms state-of-the-art matching baselines. MIM is also tested by online A/B test, which brings significant improvements over three business metrics in query rewriting and query-item relevance tasks compared with the online baseline in Alipay App.
- 5 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 27, 379-386
A Distribution Preserving Model for Molecular Graph Generation
Generating molecular graphs using deep graph generative models is a challenging task that involves optimizing a given target within an enormous search space while adhering to chemical valence rules. Despite promising results, existing models mainly focus on learning molecular graph structures at the individual level while ignoring inter-molecular relationships regarding molecular characterization features and molecular activity. This can lead to the generation of molecules that are unresponsive to their true neighbors possessing similar characterization features, resulting in a divergence between the learned generation distribution and the actual molecular distribution. In this paper, we propose a distribution preserving model, designed to maintain the inter-molecular relationships of the original distribution within the generated space. Specifically, the model operates on a student-teacher paradigm, where the teacher module learns the inter-molecular relationship dynamics of the original distribution, and imparts this knowledge to the student module, which is responsible for generating molecules. Experimental results on two benchmark datasets demonstrate that our model outperforms the state-of-the-art models in generating valid, novel and unique molecules. Moreover, our model is verified on preserving molecule distribution in the generation space.
- 5 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 27, 379-386
A Distribution Preserving Model for Molecular Graph Generation
Generating molecular graphs using deep graph generative models is a challenging task that involves optimizing a given target within an enormous search space while adhering to chemical valence rules. Despite promising results, existing models mainly focus on learning molecular graph structures at the individual level while ignoring inter-molecular relationships regarding molecular characterization features and molecular activity. This can lead to the generation of molecules that are unresponsive to their true neighbors possessing similar characterization features, resulting in a divergence between the learned generation distribution and the actual molecular distribution. In this paper, we propose a distribution preserving model, designed to maintain the inter-molecular relationships of the original distribution within the generated space. Specifically, the model operates on a student-teacher paradigm, where the teacher module learns the inter-molecular relationship dynamics of the original distribution, and imparts this knowledge to the student module, which is responsible for generating molecules. Experimental results on two benchmark datasets demonstrate that our model outperforms the state-of-the-art models in generating valid, novel and unique molecules. Moreover, our model is verified on preserving molecule distribution in the generation space.
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 2988-2998
Counterfactual Learning on Heterogeneous Graphs with Greedy Perturbation
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 2988-2998
Open AccessCounterfactual Learning on Heterogeneous Graphs with Greedy Perturbation