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

Haoda Fu

dblp:77/489 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0002-0538-4651ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 1 since 2021Databases, data management, data science and information retrieval · 2

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.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 100%
Artificial intelligence
3 papers
Knowledge representation and reasoning · 51% Optimization for machine learning · 27% Graph learning · 22%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Medical and health informatics › precision medicine
dynamic treatment regime
0.812024
Learning Optimal Dynamic Treatment Regimens Subject to Stagewise Risk Controls · J. Mach. Learn. Res. 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
open-world learning
0.412020
Near-optimal Individualized Treatment Recommendations · J. Mach. Learn. Res. 2020
Medical and health informatics
precision medicine
0.412020
Near-optimal Individualized Treatment Recommendations · J. Mach. Learn. Res. 2020
Machine learning › Graph learning
label correlation
0.212014
Learning from Label and Feature Heterogeneity · ICDM 2014

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

weighted support vector machine · 1.5fisher consistency · 1.5backward learning · 1.5consistency analysis · 0.9generalization bounds · 0.4generalization bound · 0.4rademacher complexity · 0.4iterative optimization · 0.4
YearPublicationVenuePosition
2024 Learning Optimal Dynamic Treatment Regimens Subject to Stagewise Risk Controls
abstract
Dynamic treatment regimens (DTRs) aim at tailoring individualized sequential treatment rules that maximize cumulative beneficial outcomes by accommodating patients' heterogeneity in decision-making. For many chronic diseases including type 2 diabetes mellitus (T2D), treatments are usually multifaceted in the sense that aggressive treatments with a higher expected reward are also likely to elevate the risk of acute adverse events. In this paper, we propose a new weighted learning framework, namely benefit-risk dynamic treatment regimens (BR-DTRs), to address the benefit-risk trade-off. The new framework relies on a backward learning procedure by restricting the induced risk of the treatment rule to be no larger than a pre-specified risk constraint at each treatment stage. Computationally, the estimated treatment rule solves a weighted support vector machine problem with a modified smooth constraint. Theoretically, we show that the proposed DTRs are Fisher consistent, and we further obtain the convergence rates for both the value and risk functions. Finally, the performance of the proposed method is demonstrated via extensive simulation studies and application to a real study for T2D patients.
Mochuan Liu, Yuanjia Wang, Haoda Fu, Donglin Zeng
J. Mach. Learn. Res.3
2020 Near-optimal Individualized Treatment Recommendations
abstract
The individualized treatment recommendation (ITR) is an important analytic framework for precision medicine. The goal of ITR is to assign the best treatments to patients based on their individual characteristics. From the machine learning perspective, the solution to the ITR problem can be formulated as a weighted classification problem to maximize the mean benefit from the recommended treatments given patients' characteristics. Several ITR methods have been proposed in both the binary setting and the multicategory setting. In practice, one may prefer a more flexible recommendation that includes multiple treatment options. This motivates us to develop methods to obtain a set of near-optimal individualized treatment recommendations alternative to each other, called alternative individualized treatment recommendations (A-ITR). We propose two methods to estimate the optimal A-ITR within the outcome weighted learning (OWL) framework. Simulation studies and a real data analysis for Type 2 diabetic patients with injectable antidiabetic treatments are conducted to show the usefulness of the proposed A-ITR framework. We also show the consistency of these methods and obtain an upper bound for the risk between the theoretically optimal recommendation and the estimated one. An R package "aitr" has been developed, found at https://github.com/menghaomiao/aitr.
Haomiao Meng, Ying-Qi Zhao, Haoda Fu, Xingye Qiao
J. Mach. Learn. Res.3
2016 Jointly Modeling Label and Feature Heterogeneity in Medical Informatics
abstract
Multiple types of heterogeneity including label heterogeneity and feature heterogeneity often co-exist in many real-world data mining applications, such as diabetes treatment classification, gene functionality prediction, and brain image analysis. To effectively leverage such heterogeneity, in this article, we propose a novel graph-based model for Learning with both Label and Feature heterogeneity, namely L 2 F . It models the label correlation by requiring that any two label-specific classifiers behave similarly on the same views if the associated labels are similar, and imposes the view consistency by requiring that view-based classifiers generate similar predictions on the same examples. The objective function for L 2 F is jointly convex. To solve the optimization problem, we propose an iterative algorithm, which is guaranteed to converge to the global optimum. One appealing feature of L 2 F is that it is capable of handling data with missing views and labels. Furthermore, we analyze its generalization performance based on Rademacher complexity, which sheds light on the benefits of jointly modeling the label and feature heterogeneity. Experimental results on various biomedical datasets show the effectiveness of the proposed approach.
Pei Yang 0001, Hongxia Yang, Haoda Fu, Dawei Zhou 0003, Jieping Ye, Theodoros Lappas, Jingrui He
ACM Trans. Knowl. Discov. Data3
2015 A multi-scale non-parametric and parametric hybrid multi-category recognition algorithm with probabilistic outputs
abstract
The synthesis of an effective multi-category nonlinear classifier with the capability to output calibrated posterior probabilities to enable post-processing is of great significance in practical recognition situations because the posterior probability reflects the assessment uncertainty. However, the estimation of posterior probability for multi-category classifiers is an unwieldy problem in the realm of pattern recognition, which usually is more intractable than that in dichotomic cases. In this paper, with the aid of binary tree representation for nested structures, a new polychotomous classification and posterior probability estimation scheme is developed on the strength of Bayesian decision theory. In particular, by capitalising on the intrinsic conexus between hierarchical structure and multi-scale analysis, the polychotomous multi-scale Bayesian kernel Fisher discriminant (KFD) is implemented for building the classifier at different scales for different levels. Finally, the performance of the proposed classification and posterior probability estimation algorithm is validated by designing a multi-category Bayesian KFD classifier for a benchmark satellite images dataset.
Haoda Fu, Gangbing Song
J. Exp. Theor. Artif. Intell.2
2014 Learning from Label and Feature Heterogeneity
abstract
Multiple types of heterogeneity, such as label heterogeneity and feature heterogeneity, often co-exist in many real-world data mining applications, such as news article categorization, gene functionality prediction. To effectively leverage such heterogeneity, in this paper, we propose a novel graph-based framework for Learning with both Label and Feature heterogeneities, namely L2F. It models the label correlation by requiring that any two label-specific classifiers behave similarly on the same views if the associated labels are similar, and imposes the view consistency by requiring that view-based classifiers generate similar predictions on the same examples. To solve the resulting optimization problem, we propose an iterative algorithm, which is guaranteed to converge to the global optimum. Furthermore, we analyze its generalization performance based on Rademacher complexity, which sheds light on the benefits of jointly modeling the label and feature heterogeneity. Experimental results on various data sets show the effectiveness of the proposed approach.
Pei Yang 0001, Jingrui He, Hongxia Yang, Haoda Fu
ICDM4