聚类分析
计算机科学
决策树
人工智能
二部图
机器学习
树(集合论)
距离矩阵
数据挖掘
图形
模式识别(心理学)
数学
算法
理论计算机科学
数学分析
作者
André Alves,Pedro Ilídio,Ricardo Cerri
标识
DOI:10.1145/3555776.3578606
摘要
Information about interactions between objects can be used to solve many important problems. One of these important problems is drug-target interaction prediction, where different machine learning methods can be applied to solve the prediction task. Among them, Predictive Bi-Clustering Trees (PBCTs) stand out for being a global-based multi-label algorithm with the ability to predict all interactions simultaneously. PBCTs induce a decision tree based on the interaction matrix to produce partitions, where each leaf node corresponds to a partition of the initial matrix. To be used, it needs an interaction matrix built from a true bipartite graph containing the interactions referring to the objects. However, it has a significant disadvantage over unbalanced datasets or datasets with a high rate of unknown (unlabeled) data. In this work, we propose a semi-supervised approach to improve predictive bi-clustering trees, where the semi-supervised impurity function replaces the impurity reduction function used in tree splits. We applied our approach to predict drug-target interaction and obtained competitive results compared to the original state-of-the-art PBCT.
科研通智能强力驱动
Strongly Powered by AbleSci AI