Generating Synthetic Missing Data: A Review by Missing Mechanism <s> D. MCAR UNIFO IMPLEMENTATIONS <s> Datasets with missing values are frequent in real-world classification problems. It seems obvious that imputation of missing values can be considered as a series of secondary tasks, while classification is the main purpose of any machine dealing with these datasets. Consequently, Multi-Task Learning (MTL) schemes offer an interesting alternative approach to solve missing data problems. In this paper, we propose an MTL-based method for training and operating a modified Multi-Layer Perceptron (MLP) architecture to work in incomplete data contexts. The proposed approach achieves a balance between both classification and imputation by exploiting the advantages of MTL. Extensive experimental comparisons with well-known imputation algorithms show that this approach provides excellent results. The method is never worse than the traditional algorithms - an important robustness property - and, also, it clearly outperforms them in several problems. <s> BIB001 </s> Generating Synthetic Missing Data: A Review by Missing Mechanism <s> D. MCAR UNIFO IMPLEMENTATIONS <s> Display Omitted Survival prediction of HCC patients is modeled in a real and high complex scenario.Its complexity is due to a small dataset with heterogeneous and missing input data.We propose a new cluster-based oversampling method to overcome these drawbacks.Neural networks and logistic regression are applied in the classification stage.Experimental results show that our method outperforms previous existing approaches. Liver cancer is the sixth most frequently diagnosed cancer and, particularly, Hepatocellular Carcinoma (HCC) represents more than 90% of primary liver cancers. Clinicians assess each patients treatment on the basis of evidence-based medicine, which may not always apply to a specific patient, given the biological variability among individuals. Over the years, and for the particular case of Hepatocellular Carcinoma, some research studies have been developing strategies for assisting clinicians in decision making, using computational methods (e.g. machine learning techniques) to extract knowledge from the clinical data. However, these studies have some limitations that have not yet been addressed: some do not focus entirely on Hepatocellular Carcinoma patients, others have strict application boundaries, and none considers the heterogeneity between patients nor the presence of missing data, a common drawback in healthcare contexts. In this work, a real complex Hepatocellular Carcinoma database composed of heterogeneous clinical features is studied. We propose a new cluster-based oversampling approach robust to small and imbalanced datasets, which accounts for the heterogeneity of patients with Hepatocellular Carcinoma. The preprocessing procedures of this work are based on data imputation considering appropriate distance metrics for both heterogeneous and missing data (HEOM) and clustering studies to assess the underlying patient groups in the studied dataset (K-means). The final approach is applied in order to diminish the impact of underlying patient profiles with reduced sizes on survival prediction. It is based on K-means clustering and the SMOTE algorithm to build a representative dataset and use it as training example for different machine learning procedures (logistic regression and neural networks). The results are evaluated in terms of survival prediction and compared across baseline approaches that do not consider clustering and/or oversampling using the Friedman rank test. Our proposed methodology coupled with neural networks outperformed all others, suggesting an improvement over the classical approaches currently used in Hepatocellular Carcinoma prediction models. <s> BIB002 </s> Generating Synthetic Missing Data: A Review by Missing Mechanism <s> D. MCAR UNIFO IMPLEMENTATIONS <s> Dealing with missing data is a crucial step in the preprocessing stage of most data mining projects. Especially in healthcare contexts, addressing this issue is fundamental, since it may result in keeping or loosing critical patient information that can help physicians in their daily clinical practice. Over the years, many researchers have addressed this problem, basing their approach on the implementation of a set of imputation techniques and evaluating their performance in classification tasks. These classic approaches, however, do not consider some intrinsic data information that could be related to the performance of those algorithms, such as features’ distribution. Establishing a correspondence between data distribution and the most proper imputation method avoids the need of repeatedly testing a large set of methods, since it provides a heuristic on the best choice for each feature in the study. The goal of this work is to understand the relationship between data distribution and the performance of well-known imputation techniques, such as Mean, Decision Trees, k-Nearest Neighbours, Self-Organizing Maps and Support Vector Machines imputation. Several publicly available datasets, all complete, were selected attending to several characteristics such as number of distributions, features and instances. Missing values were artificially generated at different percentages and the imputation methods were evaluated in terms of Predictive and Distributional Accuracy. Our findings show that there is a relationship between features’ distribution and algorithms’ performance, although some factors must be taken into account, such as the number of features per distribution and the missing rate at state. <s> BIB003
The characteristics of MCAR unifo approaches are presented in Table 6 . Given the use of Bernoulli trials, MCAR1 unifo suffers from the same limitation of its univa analogous, where for small datasets (small n) the desired MR may not be guaranteed. In MCAR2 unifo , since all x i,j are eligible to be missing, this approach generates a great amount of different missing datasets. Given the variability of possible missing datasets that can be generated (more than for MCAR1 unifo ), it is fundamental that missing data experiments using it perform several runs. These two approaches are rather different, therefore the choice of one will come down to the objectives and necessities of the experiments -MCAR2 unifo is a popular approach BIB002 , BIB003 . Table 7 summarizes the main characteristics and pitfalls of MAR unifo approaches. The flexibility given by MAR1 unifo in what concerns the choice of the number of features to be missing leads to the restriction of possible missing rates according to BIB001 .