基于自适应自配置RBF神经网络的符号对象分类

T. N. Nagabhushan, Hanseok Ko, Junbum Park, S. Padma, Y. S. Nijagunarya
{"title":"基于自适应自配置RBF神经网络的符号对象分类","authors":"T. N. Nagabhushan, Hanseok Ko, Junbum Park, S. Padma, Y. S. Nijagunarya","doi":"10.1109/ISITC.2007.32","DOIUrl":null,"url":null,"abstract":"Symbolic data represents a general form of classical data. There has been a highly focused research on the analysis of symbolic data in recent years. Since most of the future applications involve such general form of data, there is a need to explore novel methods to analyze such data. In this paper we present two simple novel approaches for the classification of symbolic data. In the first step, we show the representation of symbolic data in binary form and then use a simple hamming distance measure to obtain the clusters from binarised symbolic data. This gives the class label and the number of samples in each cluster. In the second part we pick a specific percentage of significant data samples in each cluster and use them to train the adaptive auto-configuring neural network. The training automatically builds an optimal architecture for the shown samples. Complete data has been used to test the generalization property of the RBF network. We demonstrate the proposed approach on the soybean bench mark data set and results are discussed. It is found that the proposed neural network works well for symbolic data opening further investigations for data mining applications.","PeriodicalId":394071,"journal":{"name":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Classification of Symbolic Objects Using Adaptive Auto-Configuring RBF Neural Networks\",\"authors\":\"T. N. Nagabhushan, Hanseok Ko, Junbum Park, S. Padma, Y. S. Nijagunarya\",\"doi\":\"10.1109/ISITC.2007.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Symbolic data represents a general form of classical data. There has been a highly focused research on the analysis of symbolic data in recent years. Since most of the future applications involve such general form of data, there is a need to explore novel methods to analyze such data. In this paper we present two simple novel approaches for the classification of symbolic data. In the first step, we show the representation of symbolic data in binary form and then use a simple hamming distance measure to obtain the clusters from binarised symbolic data. This gives the class label and the number of samples in each cluster. In the second part we pick a specific percentage of significant data samples in each cluster and use them to train the adaptive auto-configuring neural network. The training automatically builds an optimal architecture for the shown samples. Complete data has been used to test the generalization property of the RBF network. We demonstrate the proposed approach on the soybean bench mark data set and results are discussed. It is found that the proposed neural network works well for symbolic data opening further investigations for data mining applications.\",\"PeriodicalId\":394071,\"journal\":{\"name\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Symposium on Information Technology Convergence (ISITC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITC.2007.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Information Technology Convergence (ISITC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITC.2007.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

符号数据表示经典数据的一般形式。符号数据的分析是近年来研究的热点。由于大多数未来的应用都涉及这种一般形式的数据,因此有必要探索分析这种数据的新方法。本文提出了两种简单新颖的符号数据分类方法。在第一步中,我们以二进制形式展示符号数据的表示,然后使用简单的汉明距离度量从二值化的符号数据中获得聚类。这给出了类标签和每个簇中的样本数量。在第二部分中,我们在每个聚类中选择特定百分比的重要数据样本,并使用它们来训练自适应自配置神经网络。训练自动为所示的样本构建最佳架构。用完整的数据验证了RBF网络的泛化性能。我们在大豆基准数据集上验证了所提出的方法,并对结果进行了讨论。结果表明,所提出的神经网络可以很好地处理符号数据,为数据挖掘应用的进一步研究开辟了道路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Classification of Symbolic Objects Using Adaptive Auto-Configuring RBF Neural Networks
Symbolic data represents a general form of classical data. There has been a highly focused research on the analysis of symbolic data in recent years. Since most of the future applications involve such general form of data, there is a need to explore novel methods to analyze such data. In this paper we present two simple novel approaches for the classification of symbolic data. In the first step, we show the representation of symbolic data in binary form and then use a simple hamming distance measure to obtain the clusters from binarised symbolic data. This gives the class label and the number of samples in each cluster. In the second part we pick a specific percentage of significant data samples in each cluster and use them to train the adaptive auto-configuring neural network. The training automatically builds an optimal architecture for the shown samples. Complete data has been used to test the generalization property of the RBF network. We demonstrate the proposed approach on the soybean bench mark data set and results are discussed. It is found that the proposed neural network works well for symbolic data opening further investigations for data mining applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信