“…Predictions from the drug and target sides are then averaged to get the final results. [22], SRP [45] Neighborhood methods use relatively simple similarity functions to perform predictions BLMs Bleakley et al [46], LapRLS [47], RLS-avg and RLS-kron [48], BLM-NII [49] BLMs perform two sets of predictions, one from the drug side and one from the target side, and then aggregates these predictions to give the final prediction scores Network diffusion NBI [50], Wang et al [51], NRWRH [52], PSL [53], DASPfind [54] Network diffusion methods investigate graph-based techniques to predict new interactions Matrix factorization KBMF2K [55], PMF [56], CMF [57], WGRMF [58], NRLMF [59], DNILMF [60] Matrix factorization finds two latent feature matrices that, when multiplied together, reconstruct the interaction matrix Feature-based classification He et al [61], Yu et al [62], Fuzzy KNN [63], Ezzat et al [64], EnsemDT [65], SITAR [66], RFDT [78], PDTPS [81], ER-Tree [83], SCCA [84], MH-L1SVM [86] Feature-based classification methods are those that need the drug-target pairs to be explicitly represented as fixed-length feature vectors Specifically, assuming a bipartite DTI network, the algorithm tries to predict whether the edge e ij exists between drug d i and target t j . The following steps are performed:…”