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

Po-Yang Yeh

dblp:270/7610 · 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

Databases, 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.

Software engineering, system software, and programming languages
1 paper
Empirical software engineering · 100%
Artificial intelligence
1 paper
Trustworthy machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
accuracy estimation
0.412020
Reliable Accuracy Estimates from k-Fold Cross Validation · IEEE Trans. Knowl. Data Eng. 2020
Empirical software engineering
cross-validation
0.412020
Reliable Accuracy Estimates from k-Fold Cross Validation · IEEE Trans. Knowl. Data Eng. 2020
Empirical software engineering › software engineering research methodology
empirical study
0.412020
Reliable Accuracy Estimates from k-Fold Cross Validation · IEEE Trans. Knowl. Data Eng. 2020

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

statistical dependency testing · 0.9k-nearest neighbors · 0.9
YearPublicationVenuePosition
2020 Reliable Accuracy Estimates from k-Fold Cross Validation
abstract
It is popular to evaluate the performance of classification algorithms by k-fold cross validation. A reliable accuracy estimate will have a relatively small variance, and several studies therefore suggested to repeatedly perform k-fold cross validation. Most of them did not consider the correlation among the replications of k-fold cross validation, and hence the variance could be underestimated. The purpose of this study is to explore whether k-fold cross validation should be repeatedly performed for obtaining reliable accuracy estimates. The dependency relationships between the predictions of the same instance in two replications of k-fold cross validation are first analyzed for k-nearest neighbors with k = 1. Then, statistical methods are proposed to test the strength of the dependency level between the accuracy estimates resulting from two replications of k-fold cross validation. The experimental results on 20 data sets show that the accuracy estimates obtained from various replications of k-fold cross validation are generally highly correlated, and the correlation will be higher as the number of folds increases. The k-fold cross validation with a large number of folds and a small number of replications should be adopted for performance evaluation of classification algorithms.
Tzu-Tsung Wong, Po-Yang Yeh
IEEE Trans. Knowl. Data Eng.2