ShengLei Chen

Dr. ShengLei Chen

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 September 2016 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
SCShengLei Chen
ShengLei Chen
AMAna M. Martinez
Ana M. Martinez
GWGeoffrey I. Webb
Geoffrey I. Webb
LWLimin Wang
Limin Wang
More and more applications have come with large data sets in the past decade. However, existing algorithms cannot guarantee to scale well on large data. Averaged n-Dependence Estimators (AnDE) allows for flexible learning from out-of-core data, by varying the value of n (number of super parents). Hence, AnDE is especially appropriate for large data learning. In this paper, we propose a sample-based attribute selection technique for AnDE. It needs one more pass through the training data, in which a multitude of approximate AnDE models are built and efficiently assessed by leave-one-out cross validation. The use of a sample reduces the training time. Experiments on 15 large data sets demonstrate that the proposed technique significantly reduces AnDE's error at the cost of a modest increase in training time. This efficient and scalable out-of-core approach delivers superior or comparable performance to typical in-core Bayesian network classifiers.

31 March 2016 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
SCShengLei Chen
ShengLei Chen
AMAna M. Martínez
Ana M. Martínez
GWGeoffrey I. Webb
Geoffrey I. Webb
LWLimin Wang
Limin Wang

13 October 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
SCShengLei Chen
ShengLei Chen
ZZZhonghui Zhang
Zhonghui Zhang
LLLinyuan Liu
Linyuan Liu
As an important improvement to naive Bayes, Tree-Augmented Naive Bayes (TAN) exhibits excellent classification performance and efficiency since it allows that every attribute depends on at most one other attribute in addition to the class variable. However, its performance might be lowered as some attributes might be redundant. In this paper, we propose an attribute Selective Tree-Augmented Naive Bayes (STAN) algorithm which builds a sequence of approximate models each involving only the top certain attributes and searches the model to minimize the cross validation risk. Five different approaches to ranking the attributes have been explored. As the models can be evaluated simultaneously in one pass learning through the data, it is efficient and can avoid local optima in the model space. The extensive experiments on 70 UCI data sets demonstrated that STAN achieves superior performance while maintaining the efficiency and simplicity.

23 July 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
CZChengzhen Zhang
Chengzhen Zhang
SCShengLei Chen
ShengLei Chen
HKHuihang Ke
Huihang Ke
The Averaged One-Dependence Estimators (AODE) is a popular and effective method of Bayesian classification. In AODE, selecting the optimal sub-model based on a cross-validated risk minimization strategy can further enhance classification performance. However, existing cross-validation risk minimization strategies do not consider the differences in attributes in classification decisions. Consequently, this paper introduces an algorithm for Model Selection-based Weighted AODE (SWAODE). To express the differences in attributes in classification decisions, the ODE corresponding to attributes are weighted, with mutual information commonly used in the field of machine learning adopted as weights. Then, these weighted sub-models are evaluated and selected using leave-one-out cross-validation (LOOCV) to determine the best model. The new method can improve the accuracy and robustness of the model and better adapt to different data features, thereby enhancing the performance of the classification algorithm. Experimental results indicate that the algorithm merges the benefits of weighting with model selection, markedly enhancing the classification efficiency of the AODE algorithm.

28 April 2022 in Journal of Experimental & Theoretical Artificial Intelligence
Verified
Journal Article
Closed access
SCShengLei Chen
ShengLei Chen
XMXin Ma
Xin Ma
LLLinyuan Liu
Linyuan Liu
LWLimin Wang
Limin Wang
Attribute selection has been proved to be an effective trick to strengthen the classification capability of Bayesian network classifiers, such as Averaged n-Dependence Estimators (AnDE). However, conventional mutual information-based attribute ranking considers only the correlation between the attribute and the class, regardless of the redundancies among the attributes. In this paper, we propose a new ranking approach, called Maximin Conditional Mutual Information (MMCMI), which first minimises the conditional mutual information for any unsorted attribute with regard to the sorted attribute sequence, and then maximise the minimal conditional mutual information within all unsorted attributes. When ranking the very first attribute, the mutual information with the class is maximised within all attributes. Extensive empirical results demonstrate that the MMCMI ranking approach together with attribute selection framework achieves significantly superior classification performance and less classification time with respect to regular AnDE and the mutual information counterparts.

1 January 2005
Verified
Conference Paper
Closed access
SCShengLei Chen
ShengLei Chen
HWHui-Zhong Wu
Hui-Zhong Wu
XHXiang-Lan Han
Xiang-Lan Han
LXLiang Xiao
Liang Xiao
Q learning is of great importance in reinforcement learning. To compensate the drawbacks of Q learning and Q(λ) algorithm, MTQ algorithm is proposed in this paper. It makes use of future information of k steps to update current Q value. Thus it can consider more long-term benefit and the computation complexity is also decreased. Good balance is achieved between update speed and computation complexity. Experiments demonstrate effectiveness of this algorithm.