Far Point Algorithm: Active Semi-supervised Clustering for Rare Category Detection

R. Loveland, Jonathan Amdahl
{"title":"Far Point Algorithm: Active Semi-supervised Clustering for Rare Category Detection","authors":"R. Loveland, Jonathan Amdahl","doi":"10.1145/3387168.3389117","DOIUrl":null,"url":null,"abstract":"In some data sets the number of categories (i.e. classes) that are represented is not known in advance. The process of discovering these categories can be difficult, particularly when a data set is skewed, such that the number of data points of some classes may greatly exceed those of other classes. Rare category detection algorithms address this problem by trying to present a user with at least one data point from each category, while minimizing the overall number of data points presented. We present an algorithm based on active and semi-supervised learning that finds category clusters using a query selection strategy that maximizes the distance from a set of already labeled data points to a query data point. We evaluate the algorithm's performance on artificially skewed versions of the MNIST data set as a rare category detection algorithm, investigating differences in performance due to both the effects of relative frequency and inherent class structure differences in feature space.","PeriodicalId":346739,"journal":{"name":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","volume":"158 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd International Conference on Vision, Image and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3387168.3389117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In some data sets the number of categories (i.e. classes) that are represented is not known in advance. The process of discovering these categories can be difficult, particularly when a data set is skewed, such that the number of data points of some classes may greatly exceed those of other classes. Rare category detection algorithms address this problem by trying to present a user with at least one data point from each category, while minimizing the overall number of data points presented. We present an algorithm based on active and semi-supervised learning that finds category clusters using a query selection strategy that maximizes the distance from a set of already labeled data points to a query data point. We evaluate the algorithm's performance on artificially skewed versions of the MNIST data set as a rare category detection algorithm, investigating differences in performance due to both the effects of relative frequency and inherent class structure differences in feature space.
远点算法:用于稀有类别检测的主动半监督聚类
在一些数据集中,所表示的类别(即类)的数量是事先不知道的。发现这些类别的过程可能很困难,特别是当数据集倾斜时,某些类的数据点数量可能大大超过其他类的数据点数量。罕见的类别检测算法通过尝试向用户提供来自每个类别的至少一个数据点来解决这个问题,同时最小化所提供的数据点的总数。我们提出了一种基于主动和半监督学习的算法,该算法使用查询选择策略来查找类别聚类,该策略最大化了从一组已经标记的数据点到查询数据点的距离。作为一种罕见的类别检测算法,我们评估了该算法在人为倾斜的MNIST数据集上的性能,研究了由于相对频率和特征空间中固有类结构差异的影响而导致的性能差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信