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

Zhenxing Qin

dblp:23/4791 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0003-1164-6547ORCID · corroborated

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

Databases, data management, data science and information retrieval · 5 · 3 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 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.

Databases, data mining, and information retrieval
1 paper
Data mining · 75% Data integration and cleaning · 25%

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

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling
classification
0.112005
"Missing Is Useful': Missing Values in Cost-Sensitive Decision Trees · IEEE Trans. Knowl. Data Eng. 2005
Data mining › predictive modeling › classification › decision tree learning
cost-sensitive decision tree
0.112005
"Missing Is Useful': Missing Values in Cost-Sensitive Decision Trees · IEEE Trans. Knowl. Data Eng. 2005
Data mining › predictive modeling › classification
cost-sensitive learning
0.112005
"Missing Is Useful': Missing Values in Cost-Sensitive Decision Trees · IEEE Trans. Knowl. Data Eng. 2005
Data integration and cleaning
missing data
0.112005
"Missing Is Useful': Missing Values in Cost-Sensitive Decision Trees · IEEE Trans. Knowl. Data Eng. 2005

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

decision tree learning · 0.1cost-sensitive learning · 0.1
YearPublicationVenuePosition
2013 Cost-Sensitive Classification with k-Nearest Neighbors
Zhenxing Qin, Alan Tao Wang, Chengqi Zhang, Shichao Zhang 0001
KSEM1
2012 Cost-sensitive classification with inadequate labeled data
Tao Wang 0080, Zhenxing Qin, Shichao Zhang 0001, Chengqi Zhang
Inf. Syst.2
2010 Cost Sensitive Classification in Data Mining
Zhenxing Qin, Chengqi Zhang, Tao Wang 0080, Shichao Zhang 0001
ADMA (1)1
2010 Handling over-fitting in test cost-sensitive decision tree learning by feature selection, smoothing and pruning
Tao Wang 0080, Zhenxing Qin, Zhi Jin 0001, Shichao Zhang 0001
J. Syst. Softw.2
2005 "Missing Is Useful': Missing Values in Cost-Sensitive Decision Trees
abstract
Many real-world data sets for machine learning and data mining contain missing values and much previous research regards it as a problem and attempts to impute missing values before training and testing. In this paper, we study this issue in cost-sensitive learning that considers both test costs and misclassification costs. If some attributes (tests) are too expensive in obtaining their values, it would be more cost-effective to miss out their values, similar to skipping expensive and risky tests (missing values) in patient diagnosis (classification). That is, "missing is useful" as missing values actually reduces the total cost of tests and misclassifications and, therefore, it is not meaningful to impute their values. We discuss and compare several strategies that utilize only known values and that "missing is useful" for cost reduction in cost-sensitive decision tree learning.
Shichao Zhang 0001, Zhenxing Qin, Charles Ling 0001, Shengli Sheng
IEEE Trans. Knowl. Data Eng.2
2004 Mining Term Association Rules for Heuristic Query Construction
Zhenxing Qin, Li Liu 0033, Shichao Zhang 0001
PAKDD1