No abstract

No abstract

Classification of incomplete instance is a challenging problem due to the missing features generally cause uncertainty in the classification result. A new evidential classification method of incomplete instance based on adaptive imputation thanks to the framework of evidence theory. Specifically, the missing values of different incomplete instances in test set are adaptively estimated based on Shannon entropy and K-nearest centroid neighbors (KNCNs) technology. The single or multiple edited instances (with estimations) then are classified by the chosen classifier to get single or multiple classification results for the instances with different discounting (weighting) factors, and a new adaptive global fusion method finally is proposed to unify the different discounted results. The proposed method can well capture the imprecision degree of classification by submitting the instances that are difficult to be classified into a specific class to associate the meta-class and effectively reduce the classification error rates. The effectiveness and robustness of the proposed method has been tested through four experiments with artificial and real datasets.

Transfer learning (TL) has grown popular in recent years. It is effective to improve the classification accuracy in the target domain by using the training knowledge in the related domain (called source domain). However, the classification of missing data (or incomplete data) is a challenging task for TL because different strategies of imputation may have strong impacts on learning models. To address this problem, we propose credal transfer learning (CTL) with multi-estimation for missing data based on belief function theory by introducing uncertainty and imprecision in data imputation procedure. CTL mainly consists of three steps: Firstly, the query patterns are reasonably mapped into multiple versions in source domain to characterize the uncertainty caused by missing values. Afterwards, the multiple mapping patterns are classified in the source domain to obtain the corresponding outputs with different discounting factors. Finally, the discounted outputs, represented by the basic belief assignments (BBAs), are submitted to a new belief-based fusion system to get the final classification result for the query patterns. Three comparative experiments are given to illustrate the interests and potentials of CTL method.

No abstract