Demo Data from EDBT 2026 / reviewers in the wild / expert
Zhiliang Ying
dblp:40/6373
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 77% Medical and health informatics · 23% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
gradient descent |
0.1 | 1 | 2021 | Unfolding-Model-Based Visualization: Theory, Method and Applications · J. Mach. Learn. Res. 2021 |
Mathematical optimization › gradient descent
projected gradient descent |
0.1 | 1 | 2021 | Unfolding-Model-Based Visualization: Theory, Method and Applications · J. Mach. Learn. Res. 2021 |
Medical and health informatics › oncology
cancer diagnosis |
0.0 | 1 | 2007 | A parsimonious threshold-independent protein feature selection method through the area under receiver operating characteristic curve · Bioinform. 2007 |
Methods — techniques the papers use, named apart from their topics
asymptotic theory · 1.0alternating projected gradient descent · 1.0sigmoid approximation · 0.1ROC analysis · 0.1AUC optimization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Unfolding-Model-Based Visualization: Theory, Method and ApplicationsabstractMultidimensional unfolding methods are widely used for visualizing item response data. Such methods project respondents and items simultaneously onto a low-dimensional Euclidian space, in which respondents and items are represented by ideal points, with person-person, item-item, and person-item similarities being captured by the Euclidian distances between the points. In this paper, we study the visualization of multidimensional unfolding from a statistical perspective. We cast multidimensional unfolding into an estimation problem, where the respondent and item ideal points are treated as parameters to be estimated. An estimator is then proposed for the simultaneous estimation of these parameters. Asymptotic theory is provided for the recovery of the ideal points, shedding lights on the validity of model-based visualization. An alternating projected gradient descent algorithm is proposed for the parameter estimation. We provide two illustrative examples, one on users' movie rating and the other on senate roll call voting. Yunxiao Chen, Zhiliang Ying |
J. Mach. Learn. Res. | 2 |
| 2007 | A parsimonious threshold-independent protein feature selection method through the area under receiver operating characteristic curveabstractMOTIVATION: Protein expression profiling for differences indicative of early cancer holds promise for improving diagnostics. Due to their high dimensionality, statistical analysis of proteomic data from mass spectrometers is challenging in many aspects such as dimension reduction, feature subset selection as well as construction of classification rules. Search of an optimal feature subset, commonly known as the feature subset selection (FSS) problem, is an important step towards disease classification/diagnostics with biomarkers. METHODS: We develop a parsimonious threshold-independent feature selection (PTIFS) method based on the concept of area under the curve (AUC) of the receiver operating characteristic (ROC). To reduce computational complexity to a manageable level, we use a sigmoid approximation to the empirical AUC as the criterion function. Starting from an anchor feature, the PTIFS method selects a feature subset through an iterative updating algorithm. Highly correlated features that have similar discriminating power are precluded from being selected simultaneously. The classification rule is then determined from the resulting feature subset. RESULTS: The performance of the proposed approach is investigated by extensive simulation studies, and by applying the method to two mass spectrometry data sets of prostate cancer and of liver cancer. We compare the new approach with the threshold gradient descent regularization (TGDR) method. The results show that our method can achieve comparable performance to that of the TGDR method in terms of disease classification, but with fewer features selected. AVAILABILITY: Supplementary Material and the PTIFS implementations are available at http://staff.ustc.edu.cn/~ynyang/PTIFS. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Zhanfeng Wang, Yuan-chin Ivan Chang, Zhiliang Ying, Yaning Yang |
Bioinform. | 3 |