Demo Data from EDBT 2026 / reviewers in the wild / expert
Cai-Zhi Tang
dblp:195/8181
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
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.
| Artificial intelligence
2 papers |
Learning paradigms · 80% Trustworthy machine learning · 20% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning paradigms › weakly supervised learning
partial label learning |
0.6 | 2 | 2017 | Disambiguation-Free Partial Label Learning · IEEE Trans. Knowl. Data Eng. 2017 Confidence-Rated Discriminative Partial Label Learning · AAAI 2017 |
Machine learning › Learning paradigms
weakly supervised learning |
0.6 | 2 | 2017 | Disambiguation-Free Partial Label Learning · IEEE Trans. Knowl. Data Eng. 2017 Confidence-Rated Discriminative Partial Label Learning · AAAI 2017 |
Machine learning › Trustworthy machine learning
confidence-weighted learning |
0.3 | 1 | 2017 | Confidence-Rated Discriminative Partial Label Learning · AAAI 2017 |
Data mining › predictive modeling › classification
error-correcting output codes |
0.3 | 1 | 2017 | Disambiguation-Free Partial Label Learning · IEEE Trans. Knowl. Data Eng. 2017 |
Methods — techniques the papers use, named apart from their topics
loss-based decoding · 0.6error-correcting output codes · 0.6discriminative modeling · 0.3boosting · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Confidence-Rated Discriminative Partial Label LearningabstractPartial label learning aims to induce a multi-class classifier from training examples where each of them is associated with a set of candidate labels, among which only one label is valid. The common discriminative solution to learn from partial label examples assumes one parametric model for each class label, whose predictions are aggregated to optimize specific objectives such as likelihood or margin over the training examples. Nonetheless, existing discriminative approaches treat the predictions from all parametric models in an equal manner, where the confidence of each candidate label being the ground-truth label is not differentiated. In this paper, a boosting-style partial label learning approach is proposed to enabling confidence-rated discriminative modeling. Specifically, the ground-truth confidence of each candidate label is maintained in each boosting round and utilized to train the base classifier. Extensive experiments on artificial as well as real-world partial label data sets validate the effectiveness of the confidence-rated discriminative modeling. Cai-Zhi Tang, Min-Ling Zhang |
AAAI | 1 |
| 2017 | Disambiguation-Free Partial Label LearningabstractIn partial label learning, each training example is associated with a set of candidate labels among which only one is the ground-truth label. The common strategy to induce predictive model is trying to disambiguate the candidate label set, i.e., differentiating the modeling outputs of individual candidate labels. Specifically, disambiguation by differentiation can be conducted either by identifying the ground-truth label iteratively or by treating each candidate label equally. Nonetheless, the disambiguation strategy is prone to be misled by the false positive labels co-occurring with ground-truth label. In this paper, a new partial label learning strategy is studied which refrains from conducting disambiguation. Specifically, by adapting error-correcting output codes (ECOC), a simple yet effective approach named PL-ECOC is proposed by utilizing candidate label set as an entirety. During training phase, to build binary classifier w.r.t. each column coding, any partially labeled example will be regarded as a positive or negative training example only if its candidate label set entirely falls into the coding dichotomy. During testing phase, class label for the unseen instance is determined via loss-based decoding which considers binary classifiers' empirical performance and predictive margin. Extensive experiments show that PL-ECOC performs favorably against state-of-the-art partial label learning approaches. Min-Ling Zhang, Fei Yu 0010, Cai-Zhi Tang |
IEEE Trans. Knowl. Data Eng. | 3 |