Hierarchical Affinity Learning for Training Evaluation

Biao Mei
{"title":"Hierarchical Affinity Learning for Training Evaluation","authors":"Biao Mei","doi":"10.1109/ICISCAE52414.2021.9590713","DOIUrl":null,"url":null,"abstract":"Appropriate affinity/similarity measures always play a critical role in data mining. The complex interactions among multiple features and personality of each individual object makes it still a challenging problem. Existing methods simply consider the relevance in a feature-pair manner, and they treat the features for each object equally without considering the personality. In this paper, we propose a hierarchical affinity learning method on categorical data with unsupervised personalized feature weighting, called HAL. HAL captures the interactions by exploring the affinities among objects, features and values, which carry intrinsic data characteristics, via hierarchical affinity learning to handle this complex data. The inferred affinities between objects and features can be treated as the personalized feature weights which is used to refine the initial affinity matrix. The learned affinities between objects obtained by reinforcement affinity learning can be exploited for clustering. Experimental results on 16 real world datasets with diverse characteristics from 6 different domains confirm the superiority of our method. Compared to the state-of-the-art measures, it averagely achieves 8.8% improvement in terms of F-score.","PeriodicalId":121049,"journal":{"name":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 4th International Conference on Information Systems and Computer Aided Education (ICISCAE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCAE52414.2021.9590713","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Appropriate affinity/similarity measures always play a critical role in data mining. The complex interactions among multiple features and personality of each individual object makes it still a challenging problem. Existing methods simply consider the relevance in a feature-pair manner, and they treat the features for each object equally without considering the personality. In this paper, we propose a hierarchical affinity learning method on categorical data with unsupervised personalized feature weighting, called HAL. HAL captures the interactions by exploring the affinities among objects, features and values, which carry intrinsic data characteristics, via hierarchical affinity learning to handle this complex data. The inferred affinities between objects and features can be treated as the personalized feature weights which is used to refine the initial affinity matrix. The learned affinities between objects obtained by reinforcement affinity learning can be exploited for clustering. Experimental results on 16 real world datasets with diverse characteristics from 6 different domains confirm the superiority of our method. Compared to the state-of-the-art measures, it averagely achieves 8.8% improvement in terms of F-score.
训练评估的层次亲和学习
适当的亲和度/相似度度量在数据挖掘中总是起着关键作用。单个对象的多个特征和个性之间复杂的相互作用使其仍然是一个具有挑战性的问题。现有的方法只是简单地以特征对的方式考虑相关性,对每个对象的特征都一视同仁,而不考虑其个性。在本文中,我们提出了一种基于无监督个性化特征加权的分类数据分层亲和学习方法,称为HAL。HAL通过探索带有内在数据特征的对象、特征和值之间的亲和力来捕获交互,通过分层亲和力学习来处理这些复杂的数据。对象与特征之间的推断亲和力可以作为个性化的特征权重,用于细化初始亲和力矩阵。通过强化亲和学习获得的对象之间的亲和关系可以用于聚类。在来自6个不同领域的16个具有不同特征的真实数据集上的实验结果证实了我们方法的优越性。与最先进的措施相比,它的f分数平均提高了8.8%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信