Novelty detection applied to the classification problem using Probabilistic Neural Network

Balvant Yadav, V. Devi
{"title":"Novelty detection applied to the classification problem using Probabilistic Neural Network","authors":"Balvant Yadav, V. Devi","doi":"10.1109/CIDM.2014.7008677","DOIUrl":null,"url":null,"abstract":"A novel pattern is an observation which is different as compared to the rest of the data. The task of novelty detection is to build a model which identifies novel patterns from a data set. This model has to be built in such a way that if a pattern is distant from the given training data, it should be classified as a novel pattern otherwise it should be classified into any one of the given classes. In this paper, we present two such new models, based on Probabilistic Neural Network for novelty detection. In the first model, we generate negative examples around the target class data and then train the classifier with these negative examples. In the second model, which is an incremental model, we present a new method to find optimal threshold for each class and if output value for a test pattern being assigned to a target class is less than the threshold of the target class, then we classify that pattern as a novel pattern. We show how decision boundaries are created when we add novelty detection mechanism and when we do not add novelty detection to our model. We show a comparative performance of both approaches.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIDM.2014.7008677","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

A novel pattern is an observation which is different as compared to the rest of the data. The task of novelty detection is to build a model which identifies novel patterns from a data set. This model has to be built in such a way that if a pattern is distant from the given training data, it should be classified as a novel pattern otherwise it should be classified into any one of the given classes. In this paper, we present two such new models, based on Probabilistic Neural Network for novelty detection. In the first model, we generate negative examples around the target class data and then train the classifier with these negative examples. In the second model, which is an incremental model, we present a new method to find optimal threshold for each class and if output value for a test pattern being assigned to a target class is less than the threshold of the target class, then we classify that pattern as a novel pattern. We show how decision boundaries are created when we add novelty detection mechanism and when we do not add novelty detection to our model. We show a comparative performance of both approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
新颖性检测应用于概率神经网络的分类问题
新模式是一种与其他数据不同的观察结果。新颖性检测的任务是建立一个从数据集中识别新模式的模型。该模型必须以这样一种方式构建:如果模式与给定的训练数据相距甚远,则应将其分类为新模式,否则应将其分类到给定的任何一类中。在本文中,我们提出了两个基于概率神经网络的新颖性检测模型。在第一个模型中,我们围绕目标类数据生成负例,然后用这些负例训练分类器。在第二个模型中,这是一个增量模型,我们提出了一种新的方法来寻找每个类的最佳阈值,如果分配给目标类的测试模式的输出值小于目标类的阈值,那么我们将该模式分类为新模式。我们将展示当我们向模型添加新颖性检测机制和不添加新颖性检测时如何创建决策边界。我们展示了两种方法的比较性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic relevance source determination in human brain tumors using Bayesian NMF Interpolation and extrapolation: Comparison of definitions and survey of algorithms for convex and concave hulls Generalized kernel framework for unsupervised spectral methods of dimensionality reduction Convex multi-task relationship learning using hinge loss Aggregating predictions vs. aggregating features for relational classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1