{"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}
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.