This paper investigates a missing feature imputation problem for graph learning tasks. Several methods have previously addressed learning tasks on graphs with missing features. However, in cases of high rates of missing features, they were unable to avoid significant performance degradation. To overcome this limitation, we introduce a novel concept of channel-wise confidence in a node feature, which is assigned to each imputed channel feature of a node for reflecting certainty of the imputation. We then design pseudo-confidence using the channel-wise shortest path distance between a missing-feature node and its nearest known-feature node to replace unavailable true confidence in an actual learning process. Based on the pseudo-confidence, we propose a novel feature imputation scheme that performs channel-wise inter-node diffusion and node-wise inter-channel propagation. The scheme can endure even at an exceedingly high missing rate (e.g., 99.5\%) and it achieves state-of-the-art accuracy for both semi-supervised node classification and link prediction on various datasets containing a high rate of missing features. Codes are available at https://github.com/daehoum1/pcfi.
Imputation Uncertainty in Interpretable Machine Learning Methods
Leibniz Institute for Prevention Research & Epidemiology – BIPS(预防研究与流行病学研究所);Faculty of Mathematics and Computer Science, University of Bremen(数学与计算机科学学院)
Semi-Supervised Learning with Multiple Imputations on Non-Random Missing Labels
Millburn High School(米尔本高中);Franklin High School(富兰克林高中);Beijing University of Posts and Telecommunication(北京邮电大学);Yew Wah International Education School of Guangzhou(广州耀华国际教育学校)
High-dimensional multiple imputation (HDMI) for partially observed confounders including natural language processing-derived auxiliary covariates
Kaiser Permanente Washington Health Research Institute(凯撒永久华盛顿健康研究所);Duke University School of Medicine(杜克大学医学院);US Food and Drug Administration(美国食品药品监督管理局);Harvard Medical School and Harvard Pilgrim Health Care Institute(哈佛医学院与哈佛朝圣者医疗保健研究所);Harvard Pilgrim Health Care Institute(哈佛朝圣者医疗保健研究所)
Imputation-free transformer learning enables robust Alzheimer's disease prediction and calibrated uncertainty quantification across heterogeneous clinical cohorts
Platform of Bioinformatics(生物信息平台);Lausanne University Hospital(洛桑大学医院);Faculty of Biology and Medicine(生物学与医学学院);University of Lausanne(洛桑大学);Leenaards Memory Centre(Leenaards记忆中心);Department of Clinical Neurosciences(临床神经科学系)
Fed-ReMasker: Federated Tabular Imputation under Feature-Level Missingness
ARTORG Center for Biomedical Engineering Research University of Bern(伯尔尼大学生物医学工程研究中心);Graduate School for Cellular and Biomedical Sciences University of Bern(伯尔尼大学细胞与生物医学科学研究生院)
Deep Generative Imputation Model for Missing Not At Random Data
Institute for Clarity in Documentation(清晰文档研究所);Inria Paris-Rocquencourt(巴黎-罗克琴堡国家信息与自动化研究所);Rajiv Gandhi University(拉吉夫·甘地大学);Tsinghua University(清华大学);Palmer Research Laboratories(帕勒尔研究实验室);MIC Lab(微电子实验室);Department of Computer Science and Technology(计算机科学与技术系);Jilin University(吉林大学)
Conditional expectation with regularization for missing data imputation
University of Science, Ho Chi Minh City(胡志明市科学大学);Simula Metropolitan(Simula大都会);University of Notre Dame(圣母大学);Vietnam National University, Ho Chi Minh City(胡志明市越南国家大学)
Propensity score estimation using classification and regression trees in the presence of missing covariate data
Leiden University Medical Center(莱顿大学医学中心)
数据挖掘和机器学习技术,如分类和回归树(CART)代表了一个有前途的替代传统的逻辑斯谛回归的倾向得分估计。尽管不完整的数据排除了对所有受试者进行逻辑斯谛回归的拟合,但CART之所以吸引人,部分原因是某些实现允许将不完整的记录并入树拟合中,并为所有受试者提供倾向得分估计。基于理论上的考虑,我们认为,自动处理缺失数据的CART可能是不合适的。使用一系列模拟实验,我们检查了不同方法处理缺失协变量数据的性能;(i)将CART算法直接应用于(部分)不完整的数据,(ii)完整的案例分析,(iii)多重插补。评估了评估确认-结局效应\add{among the exposed}的偏倚、标准误、均方误差和覆盖率。将CART算法直接应用于不完整的数据会导致偏倚,即使在数据完全随机完全随机缺失的情况下也是如此。总体而言,多重插补后加CART的结果最佳。我们的研究表明,在CART中自动处理缺失数据可能会导致严重偏倚,并且作为解释缺失数据的一种手段,其性能并不优于多重插补。
Shapley Value Estimation for Multi-Site Data with Blockwise-Missing Features
Centre for Biomedical Data Science, Duke-NUS Medical School(杜克-新加坡国立大学医学院生物医学数据科学中心);School of Data Science, Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)数据科学学院);Columbia University(哥伦比亚大学);National University of Singapore(新加坡国立大学);Peking University(北京大学)
Theoretical Analysis of Measure Consistency Regularization for Partially Observed Data
H. Milton Stewart School of Industrial & Systems Engineering at Georgia Institute of Technology(佐治亚理工学院H.Milton Stewart工业与系统工程学院);Department of Mechanical and Industrial Engineering at Northeastern University(东北大学机械与工业工程系)
Hybrid Gaussian Process Regression with Temporal Feature Extraction for Partially Interpretable Remaining Useful Life Interval Prediction in Aeroengine Prognostics