Demo Data from VLDB 2026 / reviewers in the wild / expert
Guiliang Ou
dblp:302/7348
· DBLP profile ↗
6ranked-venue papers
4as first author
6since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling
classification |
0.9 | 1 | 2025 | Attribute grouping-based naive Bayesian classifier · Sci. China Inf. Sci. 2025 |
Data mining › clustering
feature clustering |
0.9 | 1 | 2025 | Attribute grouping-based naive Bayesian classifier · Sci. China Inf. Sci. 2025 |
Data mining › predictive modeling › classification
naive bayes |
0.9 | 1 | 2025 | Attribute grouping-based naive Bayesian classifier · Sci. China Inf. Sci. 2025 |
Methods — techniques the papers use, named apart from their topics
naive bayes · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Attribute grouping-based naive Bayesian classifier
Yu-Lin He, Guiliang Ou, Philippe Fournier-Viger, Joshua Zhexue Huang |
Sci. China Inf. Sci. | 2 |
| 2025 | Relaxed naïve Bayesian classifier based on maximum dependent attribute groups
Guiliang Ou, Yu-Lin He, Yingchao Cheng, Joshua Zhexue Huang |
Inf. Sci. | 1 |
| 2025 | A novel multi-source weighted naive Bayes classifier
Guiliang Ou, Yu-Lin He, Philippe Fournier-Viger, Joshua Zhexue Huang |
Inf. Sci. | 1 |
| 2022 | Auto-Encoding Independent Attribute Transformation for Naive Bayesian ClassifierabstractTo alleviate the attribute independence assumption, this paper proposes an auto-encoding naive Bayesian classifier (AE-NBC) which is trained based on transformed independent condition-attributes using an auto-encoding strategy. First, an auto-encoding neural network (AENN) with single hidden-layer is created to map the original data set to a high-dimensional data space. To guarantee the independence among auto-encoding condition-attributes (AECAs), an efficient and convergent objective function is elaborated to optimize the input-layer and output-layer weights of the AENN by considering both the auto-encoding error and attribute independence degree. Second, independent component analysis is iteratively carried out to remove the redundant attributes in AECAs so that the optimal transformed condition-attributes (TCAs) are obtained for the training of the NBC. Experiments were conducted on 29 benchmark data sets to validate the rationality, feasibility, and effectiveness of AE- NBC. Experimental results show that the independence among TCAs is stronger than among the original condition-attributes, and that AE- NBC can obtain higher training and testing accuracies than six Bayesian classifiers. Guiliang Ou, Yu-Lin He, Philippe Fournier-Viger, Joshua Zhexue Huang |
IJCNN | 1 |
| 2022 | A novel dependency-oriented mixed-attribute data classification method
Yu-Lin He, Guiliang Ou, Philippe Fournier-Viger, Joshua Zhexue Huang, Ponnuthurai N. Suganthan |
Expert Syst. Appl. | 2 |
| 2021 | A Compressed Hidden Naive Bayesian ClassifierabstractThis paper proposes a compressed hidden naive Bayesian (C-HNB) classifier which is an improved version of hidden naive Bayesian (HNB) by compressing the Bayesian network structure and calculating the attribute correlation with maximal information coefficient (MIC). In C-HNB, we remodel the Bayesian network structure based on the chain rule of joint probability distribution so that the number of hidden parent nodes in C-HNB is smaller than the number of hidden parent nodes in HNB, which reduces the training complexity of Bayesian network. In addition, the attribute correlation in C-HNB is calculated with MIC rather than the mutual information, which makes the Bayesian network more stable because the calculation of mutual information is severely influenced by the discretization of continuous attribute. On the selected KEEL benchmark data sets, we compare the classification performances of C-HNB with HNB. The comparative results show that C-HNB can obtain the better prediction accuracy with the less training time in comparison with HNB and thus the experimental results demonstrate the effectiveness of C-HNB. Guiliang Ou, Yu-Lin He, Joshua Zhexue Huang |
IJCNN | 1 |