Yue Ma

Dr. Yue Ma


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
12 August 2020 in IEEE Access
Verified
Journal Article
Open access
YMYue Ma
Yue Ma
KZKun Zhao
Kun Zhao
QWQi Wang
Qi Wang
SZSiyu Zhu
Siyu Zhu
Incremental learning or online learning as a branch of machine learning has attracted more attention recently. For large-scale problems and dynamic data problem, incremental learning overwhelms batch learning, because of its efficient treatment for new data. However, class imbalance problem, which always appears in online classification brings a considerable challenge for incremental learning. The serious class imbalance problem may directly lead to a useless learning system. Cost-sensitive learning is an important learning paradigm for class imbalance problems and widely used in many applications. In this paper, we propose an incremental cost-sensitive learning method to tackle the class imbalance problems in the online situation. This proposed algorithm is based on a novel cost-sensitive support vector machine, which uses the Linear-exponential (LINEX) loss to implement high cost for minority class and low cost for majority class. Using the half-quadratic optimization, we first put forward the algorithm for the cost-sensitive support vector machine, called CSLINEX-SVM*. Then we propose the incremental cost-sensitive algorithm, ICSL-SVM. The results of numeric experiments demonstrate that the proposed incremental algorithm outperforms some conventional batch algorithms except the proposed CSLINEX-SVM*.

1 January 2018 in Complexity
Verified
Journal Article
Open access
PDF file
YHYiwei He
Yiwei He
YTYingjie Tian
Yingjie Tian
JTJingjing Tang
Jingjing Tang
YMYue Ma
Yue Ma
Domain adaptation has recently attracted attention for visual recognition. It assumes that source and target domain data are drawn from the same feature space but different margin distributions and its motivation is to utilize the source domain instances to assist in training a robust classifier for target domain tasks. Previous studies always focus on reducing the distribution mismatch across domains. However, in many real‐world applications, there also exist problems of sample selection bias among instances in a domain; this would reduce the generalization performance of learners. To address this issue, we propose a novel model named Domain Adaptation Exemplar Support Vector Machines (DAESVMs) based on exemplar support vector machines (exemplar‐SVMs). Our approach aims to address the problems of sample selection bias and domain adaptation simultaneously. Comparing with usual domain adaptation problems, we go a step further in slacking the assumption of i.i.d. First, we formulate the DAESVMs training classifiers with reducing Maximum Mean Discrepancy (MMD) among domains by mapping data into a latent space and preserving properties of original data, and then, we integrate classifiers to make a prediction for target domain instances. Our experiments were conducted on Office and Caltech10 datasets and verify the effectiveness of the model we proposed.

9 December 2024 in Neural Networks
Verified
Journal Article
Closed access
YMYue Ma
Yue Ma
CXChunjie Xu
Chunjie Xu
WSWei Song
Wei Song
HLHanyu Liang
Hanyu Liang

4 January 2026 in Sustainability
Verified
Journal Article
Open access
PDF file
PLPeijia Li
Peijia Li
YMYue Ma
Yue Ma
KHKunqi Hou
Kunqi Hou
SLShipeng Li
Shipeng Li
When new purchasers or products are added in the supply chain management system, the recommendation system will face severe challenges of data sparsity and cold start. A knowledge graph that can enrich the representations of both procurement managers and products offers a promising pathway to mitigate the challenges. This paper proposes a knowledge-aware recommendation network for supply chain management, called KnoChain. The proposed model refines purchaser representations through outward propagation along knowledge graph links and enhances product representations via inward aggregation of multi-hop neighbourhood information. This dual approach enables the simultaneous discovery of purchasers’ latent preferences and products’ underlying characteristics, facilitating precise and personalised recommendations. Extensive experiments on three real-world datasets demonstrate that the proposed method consistently outperforms several state-of-the-art baselines, achieving average AUC improvements of 9.36%, 5.91%, and 8.81%, and average accuracy gains of 8.56%, 6.27%, and 8.67% on the movie, book, and music datasets, respectively. These results underscore the model’s potential to enhance recommendation robustness in supply chain management. The KnoChain framework proposed in this article combines purchaser-aware attention with knowledge graphs to improve the accuracy of purchaser SKU matching. The method can help enhance supply chain resilience and reduce returns caused by over-ordering, inventory backlog, and incorrect procurement. In addition, the model provides interpretable recommendation paths based on the knowledge graph, which improves trust and auditability for procurement personnel and helps balance environmental and operational costs.