{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T21:08:31Z","timestamp":1778533711726,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T00:00:00Z","timestamp":1436486400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00521-015-1989-6","type":"journal-article","created":{"date-parts":[[2015,7,9]],"date-time":"2015-07-09T02:05:11Z","timestamp":1436407511000},"page":"1959-1967","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A CMAC-based scheme for determining membership with classification of text strings"],"prefix":"10.1007","volume":"27","author":[{"given":"Heng","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying-Chih","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu-I.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,10]]},"reference":[{"issue":"1","key":"1989_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1132462.1132464","volume":"3","author":"L Tan","year":"2006","unstructured":"Tan L, Brotherton B, Sherwood T (2006) Bit-split string-matching engines for intrusion detection and prevention. ACM Trans Archit Code Optim 3(1):3\u201334","journal-title":"ACM Trans Archit Code Optim"},{"key":"1989_CR2","unstructured":"Bentley J, Sedgewick R (1997) Fast algorithms for sorting and searching strings. In: Proceedings of ACM-SIAM symposium on discrete algorithms, pp 360\u2013369"},{"key":"1989_CR3","doi-asserted-by":"crossref","unstructured":"Matias Y, Muthukrishnan S, Sahinalp S, Ziv J (1998) Augmenting suffix trees, with applications. In: Proceedings of European symposium on algorithms, pp 67\u201378","DOI":"10.1007\/3-540-68530-8_6"},{"issue":"7","key":"1989_CR4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"issue":"13","key":"1989_CR5","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.1093\/bioinformatics\/btq230","volume":"26","author":"H Stranneheim","year":"2010","unstructured":"Stranneheim H, Kaller M, Allander T, Andersson B, Arvestad L, Lundeberg J (2010) Classification of DNA sequences using Bloom filters. Bioinformatics 26(13):1595\u20131600","journal-title":"Bioinformatics"},{"key":"1989_CR6","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/j.comcom.2010.03.009","volume":"33","author":"AG AlaguPriya","year":"2010","unstructured":"AlaguPriya AG, Lim H (2010) Hierarchical packet classification using a Bloom filter and rule-priority tries. Comput Commun 33:1215\u20131226","journal-title":"Comput Commun"},{"key":"1989_CR7","doi-asserted-by":"crossref","unstructured":"Hao F, Kodialam M, Lakshman TV (2008) Incremental Bloom filters. In: Proceedings of INFOCOM, pp 1741\u20131749","DOI":"10.1109\/INFOCOM.2008.161"},{"key":"1989_CR8","doi-asserted-by":"crossref","unstructured":"Donnet B, Baynat B, Friedman T (2006) Retouched Bloom filters: allowing networked applications to trade off selected false positives against false negatives. In: Proceedings of ACM CoNEXT, pp 149\u2013160","DOI":"10.1145\/1368436.1368454"},{"issue":"1","key":"1989_CR9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MM.2004.1268997","volume":"24","author":"S Dharmapurikar","year":"2004","unstructured":"Dharmapurikar S, Krishnamurthy P, Sproull TS, Lockwood JW (2004) Deep packet inspection using parallel Bloom filters. IEEE Micro 24(1):52\u201361","journal-title":"IEEE Micro"},{"issue":"2","key":"1989_CR10","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/TPDS.2009.39","volume":"21","author":"B Xiao","year":"2010","unstructured":"Xiao B, Hua Y (2010) Using parallel Bloom filters for multiattribute representation on network services. IEEE Trans Parallel Distrib Syst 21(2):20\u201332","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1989_CR11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P Bose","year":"2008","unstructured":"Bose P, Guo H, Kranakis E, Macheswari A, Morrison J, Smid M, Tang Y (2008) On the false-positive rate of Bloom filters. Inf Process Lett 108:210\u2013213","journal-title":"Inf Process Lett"},{"key":"1989_CR12","doi-asserted-by":"crossref","unstructured":"Shanmugasundaram K, Bronnimann H, Memon N (2004) Payload attribution via hierarchical Bloom filters. In: Proceedings of the 11th ACM conference on computer and communications security, pp 31\u201341","DOI":"10.1145\/1030083.1030089"},{"key":"1989_CR13","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1115\/1.3426922","volume":"97","author":"JS Albus","year":"1975","unstructured":"Albus JS (1975) A new approach to manipulator control: the cerebellar model articulation controller (CMAC). J Dyn Syst Meas Control 97:220\u2013227","journal-title":"J Dyn Syst Meas Control"},{"key":"1989_CR14","doi-asserted-by":"crossref","first-page":"1711","DOI":"10.1016\/j.eswa.2007.08.086","volume":"35","author":"CJ Lin","year":"2008","unstructured":"Lin CJ, Lee JH, Lee CY (2008) A novel hybrid learning algorithm for parametric fuzzy CMAC networks and its classification applications. Expert Syst Appl 35:1711\u20131720","journal-title":"Expert Syst Appl"},{"key":"1989_CR15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1177\/027836499101000404","volume":"10","author":"D Ellison","year":"1991","unstructured":"Ellison D (1991) On the convergence of the multidimensional Albus perceptron. Int J Robot Res 10:338\u2013357","journal-title":"Int J Robot Res"},{"key":"1989_CR16","doi-asserted-by":"crossref","unstructured":"Bonomi F, Mitzenmacher M, Panigrahy R, Singh S, Varghese G (2006) Beyond bloom filters: from approximate membership checks to approximate state machines. In: Proceedings of the ACM SIGCOMM, pp 315\u2013326","DOI":"10.1145\/1151659.1159950"},{"issue":"8","key":"1989_CR17","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1109\/TC.2010.213","volume":"60","author":"H Yu","year":"2011","unstructured":"Yu H, Mahapatra RN (2011) A power and throughput-efficient packet classifier with n Bloom filters. IEEE Trans Comput 60(8):1182\u20131193","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"1989_CR18","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1109\/TC.2011.108","volume":"61","author":"Y Hua","year":"2012","unstructured":"Hua Y, Xiao B, Veeravalli B, Feng D (2012) Locality-sensitive Bloom filter for approximate membership query. IEEE Trans Comput 61(6):817\u2013830","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"1989_CR19","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/TNET.2011.2173351","volume":"20","author":"F Hao","year":"2012","unstructured":"Hao F, Kodialam M, Lakshman TV, Song H (2012) Fast dynamic multiple-set membership testing using combinatorial Bloom filters. IEEE\/ACM Trans Netw 20(1):295\u2013304","journal-title":"IEEE\/ACM Trans Netw"},{"key":"1989_CR20","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.jnca.2012.12.031","volume":"36","author":"K Huang","year":"2013","unstructured":"Huang K, Xie G, Li R, Xiong S (2013) Fast and deterministic hash table lookup using discriminative Bloom filters. J Netw Comput Appl 36:657\u2013666","journal-title":"J Netw Comput Appl"},{"issue":"1","key":"1989_CR21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TPDS.2013.46","volume":"25","author":"Y Qiao","year":"2014","unstructured":"Qiao Y, Li T, Chen S (2014) Fast Bloom filters and their generalization. IEEE Trans Parallel Distrib Syst 25(1):93\u2013103","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"1989_CR22","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.12785\/amis\/080445","volume":"8","author":"H Lim","year":"2014","unstructured":"Lim H, Lee N, Lee J, Yim C (2014) Reducing false positives of a Bloom filter using cross-checking Bloom filters. Appl Math Inf Sci 8(4):1865\u20131877","journal-title":"Appl Math Inf Sci"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-1989-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-015-1989-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-1989-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T18:51:52Z","timestamp":1553626312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-015-1989-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,10]]},"references-count":22,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["1989"],"URL":"https:\/\/doi.org\/10.1007\/s00521-015-1989-6","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,10]]}}}