Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shaofen Cheng

dblp:285/3557 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1

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
1 paper
Learning paradigms · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
abductive learning
0.412020
Semi-Supervised Abductive Learning and Its Application to Theft Judicial Sentencing · ICDM 2020
Computational social science and digital humanities
legal informatics
0.112020
Semi-Supervised Abductive Learning and Its Application to Theft Judicial Sentencing · ICDM 2020

Methods — techniques the papers use, named apart from their topics

semi-supervised learning · 0.9pseudo-labeling · 0.9abductive reasoning · 0.9
YearPublicationVenuePosition
2020 Semi-Supervised Abductive Learning and Its Application to Theft Judicial Sentencing
abstract
In many practical tasks, there are usually two kinds of common information: cheap unlabeled data and domain knowledge in the form of symbols. There are some attempts using one single information source, such as semi-supervised learning and abductive learning. However, there is little work to use these two kinds of information sources at the same time, because it is very difficult to combine symbolic logical representation and numerical model optimization effectively. The learning becomes even more challenging when the domain knowledge is insufficient. In this paper, we present an attempt-Semi-Supervised ABductive Learning (SS-ABL) framework. In this framework, semi-supervised learning is trained via pseudo labels of unlabeled data generated by abductive learning, and the background knowledge is refined via the label distribution predicted by semi-supervised learning. The above framework can be optimized iteratively and can be naturally interpretable. The effectiveness of our framework has been fully verified in the theft judicial sentencing of real legal documents. In the case of missing sentencing elements and mixed legal rules, our framework is apparently superior to many existing baseline practices, and provides explanatory assistance to judicial sentencing.
Yu-Xuan Huang, Wang-Zhou Dai, Le-Wen Cai, Shaofen Cheng, Ruizhang Huang, Yufeng Li 0008, Zhi-Hua Zhou
ICDM5