一种同时确定字符串标识符的隶属关系和类别的神经算法

H. Ma, Ying-Chih Tseng
{"title":"一种同时确定字符串标识符的隶属关系和类别的神经算法","authors":"H. Ma, Ying-Chih Tseng","doi":"10.1109/TAAI.2012.43","DOIUrl":null,"url":null,"abstract":"Membership determination of text strings has been an important procedure for analyzing textual data of a tremendous amount, for which the Bloom filter has been a well-known approach because of its succinct structure. As membership with classification determination is becoming increasingly desirable, parallel Bloom filters are often implemented for coping with the additional classification requirement. The parallel Bloom filters, however, tends to produce more false-positive errors since membership checking must be performed on each of the parallel layers. We propose a scheme based on a neural network mapping, which only requires a single-layer operation to simultaneously obtain both the membership and classification information. Simulation results show that the proposed scheme committed less false-positive errors than the parallel Bloom filters using the same computational parameters.","PeriodicalId":385063,"journal":{"name":"2012 Conference on Technologies and Applications of Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Neural-Based Scheme for Simultaneously Determining Membership and Class of String Identifiers\",\"authors\":\"H. Ma, Ying-Chih Tseng\",\"doi\":\"10.1109/TAAI.2012.43\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Membership determination of text strings has been an important procedure for analyzing textual data of a tremendous amount, for which the Bloom filter has been a well-known approach because of its succinct structure. As membership with classification determination is becoming increasingly desirable, parallel Bloom filters are often implemented for coping with the additional classification requirement. The parallel Bloom filters, however, tends to produce more false-positive errors since membership checking must be performed on each of the parallel layers. We propose a scheme based on a neural network mapping, which only requires a single-layer operation to simultaneously obtain both the membership and classification information. Simulation results show that the proposed scheme committed less false-positive errors than the parallel Bloom filters using the same computational parameters.\",\"PeriodicalId\":385063,\"journal\":{\"name\":\"2012 Conference on Technologies and Applications of Artificial Intelligence\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Conference on Technologies and Applications of Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAAI.2012.43\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Conference on Technologies and Applications of Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAAI.2012.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

文本字符串的隶属关系确定是分析大量文本数据的一个重要步骤,其中Bloom过滤器因其简洁的结构而成为一种众所周知的方法。随着具有分类决定的隶属关系越来越受欢迎,并行布隆过滤器经常被实现来处理额外的分类需求。然而,并行Bloom过滤器往往产生更多的假阳性错误,因为必须在每个并行层上执行成员检查。我们提出了一种基于神经网络映射的方案,该方案只需要单层操作即可同时获得隶属度和分类信息。仿真结果表明,在相同的计算参数下,该方案比并行布隆滤波器产生的假阳性误差更小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Neural-Based Scheme for Simultaneously Determining Membership and Class of String Identifiers
Membership determination of text strings has been an important procedure for analyzing textual data of a tremendous amount, for which the Bloom filter has been a well-known approach because of its succinct structure. As membership with classification determination is becoming increasingly desirable, parallel Bloom filters are often implemented for coping with the additional classification requirement. The parallel Bloom filters, however, tends to produce more false-positive errors since membership checking must be performed on each of the parallel layers. We propose a scheme based on a neural network mapping, which only requires a single-layer operation to simultaneously obtain both the membership and classification information. Simulation results show that the proposed scheme committed less false-positive errors than the parallel Bloom filters using the same computational parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信