0


与PCT的多标签分类的距离比较

Comparison of distances for multi-label classification with PCTs
课程网址: http://videolectures.net/sikdd2011_gjorgjioski_classification/  
主讲教师: Valentin Gjorgjioski
开课单位: 约瑟夫·斯特凡学院
开课时间: 2011-11-04
课程语种: 英语
中文简介:
近年来,多标签分类在研究领域得到了广泛的关注:这导致了多种多标签分类方法的发展。这些方法可以将多标签数据集转换为多个更简单的数据集,也可以调整学习算法以处理多标签。在本文中,我们考虑后一种方法。也就是说,我们使用预测聚类树来执行多标签分类。此外,我们还对用于选择树节点分裂的四种距离测量方法进行了实验比较。采用6种不同的评价方法对6个基准数据集进行了实验评价。结果表明,欧氏距离和汉明损失的平均值是最佳的预测性能。
课程简介: Multi-label classification has received significant attention in the research community over the past few years: this has resulted in the development of a variety of multi-label classification methods. These methods either transform the multi-label dataset to several simpler datasets or adapt the learning algorithm so it can handle the multiple labels. In this paper, we consider the latter approach. Namely, we use predictive clustering trees to perform multi-label classification. Furthermore, we perform an experimental comparison of four distance measures used to select the splits in the nodes of the trees. The experimental evaluation was conducted on 6 benchmark datasets using 6 different evaluation measures. The results show that, averaged overall, the Euclidean distance and the Hamming loss yield the best predictive performance.
关 键 词: 计算机科学; 机器学习; 多任务学习
课程来源: 视频讲座网
最后编审: 2020-07-28:yumf
阅读次数: 14