{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T06:34:52Z","timestamp":1717482892396},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,25]],"date-time":"2016-01-25T00:00:00Z","timestamp":1453680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10044-016-0535-1","type":"journal-article","created":{"date-parts":[[2016,1,25]],"date-time":"2016-01-25T12:13:49Z","timestamp":1453724029000},"page":"797-808","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The design of absorbing Bayesian pursuit algorithms and the formal analyses of their \u03b5-optimality"],"prefix":"10.1007","volume":"20","author":[{"given":"Xuan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"B. John","family":"Oommen","sequence":"additional","affiliation":[]},{"given":"Ole-Christoffer","family":"Granmo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,25]]},"reference":[{"key":"535_CR1","doi-asserted-by":"crossref","unstructured":"Zhang X, Granmo OC, Oommen BJ (2011) The Bayesian pursuit algorithm: a new family of estimator learning automata. In: Proceedings of IEA-AIE 2011. Springer, New York, June 2011, pp 608\u2013620","DOI":"10.1007\/978-3-642-21827-9_53"},{"key":"535_CR2","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1007\/s10489-013-0424-x","volume":"39","author":"X Zhang","year":"2013","unstructured":"Zhang X, Granmo O-C, Oommen BJ (2013) On incorporating the paradigms of discretization and Bayesian estimation to create a new family of pursuit learning automata. Appl Intell 39:782\u2013792","journal-title":"Appl Intell"},{"key":"535_CR3","doi-asserted-by":"crossref","unstructured":"Zhang X, Granmo OC, Oommen BJ (2012) Discretized Bayesian pursuit\u2014a new scheme for reinforcement learning. In: Proceedings of IEA-AIE 2012, Dalian, June 2012, pp 784\u2013793","DOI":"10.1007\/978-3-642-31087-4_79"},{"key":"535_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TSMC.1974.5408453","volume":"4","author":"KS Narendra","year":"1974","unstructured":"Narendra KS, Thathachar MAL (1974) Learning automata\u2014a survey. IEEE Trans Syst Man Cybern 4:323\u2013334","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"535_CR5","unstructured":"Narendra KS, Thathachar MAL (1989) Learning automata: an introduction. Prentice Hall, New Jersey, USA"},{"issue":"3","key":"535_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/3477.931507","volume":"31","author":"BJ Oommen","year":"2001","unstructured":"Oommen BJ, Agache M (2001) Continuous and discretized pursuit learning schemes: various algorithms and their comparison. IEEE Trans Syst Man Cybern Part B Cybern 31(3):277\u2013287","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"535_CR7","doi-asserted-by":"crossref","unstructured":"Oommen BJ, Granmo OC, Pedersen A (2007) Using stochastic AI techniques to achieve unbounded resolution in finite player Goore games and its applications. In: Proceedings of IEEE symposium on computational intelligence and games, Honolulu, April 2007, pp 161\u2013167","DOI":"10.1109\/CIG.2007.368093"},{"key":"535_CR8","doi-asserted-by":"crossref","unstructured":"Beigy H, Meybodi MR (2000) Adaptation of parameters of BP algorithm using learning automata. In: Proceedings of sixth Brazilian symposium on neural networks, Brazil, November 2000, pp 24\u201331","DOI":"10.1109\/SBRN.2000.889708"},{"key":"535_CR9","unstructured":"Zhang X, Jiao L, Granmo OC, Oommen BJ (2013) Channel selection in cognitive radio networks: a switchable Bayesian learning automata approach. In: Proceedings of PIMRC, London, September 2013, pp 2362\u20132367"},{"key":"535_CR10","doi-asserted-by":"crossref","unstructured":"Jiao L, Zhang X, Granmo OC, Oommen BJ (2014) A Bayesian learning automata-based distributed channel selection scheme for cognitive radio networks. In: Proceedings of IEA-AIE, Kaohsiung, June 2014, pp 48\u201357","DOI":"10.1007\/978-3-319-07467-2_6"},{"issue":"1","key":"535_CR11","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TSMCB.2006.879012","volume":"37","author":"O-C Granmo","year":"2007","unstructured":"Granmo O-C, Oommen BJ, Myrer S-A, Olsen MG (2007) Learning automata-based solutions to the nonlinear fractional knapsack problem with applications to optimal resource allocation. IEEE Trans Syst Man Cybern Part B 37(1):166\u2013175","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"535_CR12","doi-asserted-by":"crossref","unstructured":"Granmo OC, Oommen BJ, Myrer SA, Olsen MG (2006) Determining optimal polling frequency using a learning automata-based solution to the fractional knapsack problem. In: Proceedings of the 2006 IEEE international conferences on cybernetics and intelligent systems (CIS) and robotics, automation and mechatronics (RAM), Bangkok, June 2006, pp 1\u20137","DOI":"10.1109\/ICCIS.2006.252228"},{"issue":"7","key":"535_CR13","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1016\/j.engappai.2011.05.018","volume":"24","author":"O-C Granmo","year":"2011","unstructured":"Granmo O-C, Oommen BJ (2011) Learning automata-based solutions to the optimal web polling problem modeled as a nonlinear fractional knapsack problem. Eng Appl Artif Intell 24(7):1238\u20131251","journal-title":"Eng Appl Artif Intell"},{"key":"535_CR14","doi-asserted-by":"crossref","unstructured":"Granmo OC, Oommen BJ (2006) On allocating limited sampling resources using a learning automata-based solution to the fractional knapsack problem. In: Proceedings of the 2006 international intelligent information processing and web mining conference, advances in soft computing, vol 35, Ustron, June 2006, pp 263\u2013272","DOI":"10.1007\/3-540-33521-8_26"},{"issue":"1","key":"535_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10489-010-0228-1","volume":"33","author":"O-C Granmo","year":"2010","unstructured":"Granmo O-C, Oommen BJ (2010) Optimal sampling for estimation with constrained resources using a learning automaton-based solution for the nonlinear fractional knapsack problem. Appl Intell 33(1):3\u201320","journal-title":"Appl Intell"},{"key":"535_CR16","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10489-011-0280-5","volume":"36","author":"A Yazidi","year":"2012","unstructured":"Yazidi A, Granmo O-C, Oommen BJ (2012) Service selection in stochastic environments: a learning-automaton based solution. Appl Intell 36:617\u2013637","journal-title":"Appl Intell"},{"key":"535_CR17","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/3468.736368","volume":"29","author":"C Unsal","year":"1999","unstructured":"Unsal C, Kachroo P, Bay JS (1999) Multiple stochastic learning automata for vehicle path control in an automated highway system. IEEE Trans Syst Man Cybern Part A 29:120\u2013128","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"key":"535_CR18","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/12.862220","volume":"49","author":"BJ Oommen","year":"2000","unstructured":"Oommen BJ, Roberts TD (2000) Continuous learning automata solutions to the capacity assignment problem. IEEE Trans Comput 49:608\u2013620","journal-title":"IEEE Trans Comput"},{"key":"535_CR19","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/3477.558849","volume":"27","author":"BJ Oommen","year":"1997","unstructured":"Oommen BJ, Croix TDS (1997) String taxonomy using learning automata. IEEE Trans Syst Man Cybern 27:354\u2013365","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"535_CR20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1109\/12.485372","volume":"45","author":"BJ Oommen","year":"1996","unstructured":"Oommen BJ, Croix TDS (1996) Graph partitioning using learning automata. IEEE Trans Comput 45:195\u2013208","journal-title":"IEEE Trans Comput"},{"key":"535_CR21","first-page":"81","volume":"18","author":"T Dean","year":"1995","unstructured":"Dean T, Angluin D, Basye K, Engelson S, Aelbling L, Maron O (1995) Inferring finite automata with stochastic output functions and an application to map learning. Mach Learn 18:81\u2013108","journal-title":"Mach Learn"},{"key":"535_CR22","unstructured":"Thathachar MAL, Sastry PS (1986) Estimator algorithms for learning automata. In: Proceedings of the platinum jubilee conference on systems and signal processing, Bangalore, December 1986, pp 29\u201332"},{"key":"535_CR23","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1109\/21.105092","volume":"20","author":"BJ Oommen","year":"1990","unstructured":"Oommen BJ, Lanct\u00f4t JK (1990) Discretized pursuit learning automata. IEEE Trans Syst Man Cybern 20:931\u2013938","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"6","key":"535_CR24","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1109\/21.199471","volume":"22","author":"JK Lanct\u00f4t","year":"1992","unstructured":"Lanct\u00f4t JK, Oommen BJ (1992) Discretized estimator learning automata. IEEE Trans Syst Man Cybern Part B Cybern 22(6):1473\u20131483","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"535_CR25","first-page":"1417","volume":"2","author":"JK Lanct\u00f4t","year":"1991","unstructured":"Lanct\u00f4t JK, Oommen BJ (1991) On discretizing estimator-based learning algorithms. IEEE Trans Syst Man Cybern Part B Cybern 2:1417\u20131422","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"535_CR26","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/3477.517033","volume":"26","author":"K Rajaraman","year":"1996","unstructured":"Rajaraman K, Sastry PS (1996) Finite time analysis of the pursuit algorithm for learning automata. IEEE Trans Syst Man Cybern Part B Cybern 26:590\u2013598","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"3","key":"535_CR27","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1017\/S0021900200009542","volume":"49","author":"R Martin","year":"2012","unstructured":"Martin R, Omkar T (2012) On $$\\epsilon$$ \u03f5 -optimality of the pursuit learning algorithm. J Appl Probab 49(3):795\u2013805","journal-title":"J Appl Probab"},{"key":"535_CR28","unstructured":"Zhang X, Granmo OC, Oommen BJ, Jiao L (2013) On using the theory of regular functions to prove the $$\\epsilon$$ \u03f5 -optimality of the continuous pursuit learning automaton. In: Proceedings of IEA-AIE 2013. Springer, Amsterdan, June 2013, pp 262\u2013271"},{"key":"535_CR29","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1007\/s10489-014-0541-1","volume":"41","author":"X Zhang","year":"2014","unstructured":"Zhang X, Granmo O-C, Oommen BJ, Jiao L (2014) A formal proof of the $$\\epsilon$$ \u03f5 -optimality of absorbing continuous pursuit algorithms using the theory of regular functions. Appl Intell 41:974\u2013985","journal-title":"Appl Intell"},{"key":"535_CR30","unstructured":"Zhang X, Oommen BJ, Granmo OC, Jiao L (2014) Using the theory of regular functions to formally prove the $$\\epsilon$$ \u03f5 -optimality of discretized pursuit learning algorithms. In: Proceedings of IEA-AIE. Kaohsiung. Springer, June 2014, pp 379\u2013388"},{"key":"535_CR31","doi-asserted-by":"crossref","unstructured":"Zhang X, Oommen BJ, Granmo OC, Jiao L (2014) A formal proof of the $$\\epsilon$$ \u03f5 -optimality of discretized pursuit algorithms. Appl Intell","DOI":"10.1007\/s10489-015-0670-1"},{"key":"535_CR32","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1109\/TSMC.1986.289265","volume":"16","author":"BJ Oommen","year":"1986","unstructured":"Oommen BJ (1986) Absorbing and ergodic discretized two-action learning automata. IEEE Trans Syst Man Cybern 16:282\u2013296","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"6","key":"535_CR33","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1109\/21.199471","volume":"22","author":"JK Lanct\u00f4t","year":"1992","unstructured":"Lanct\u00f4t JK, Oommen BJ (1992) Discretized estimator learning automata. IEEE Trans Syst Man Cybern 22(6):1473\u20131483","journal-title":"IEEE Trans Syst Man Cybern"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-016-0535-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-016-0535-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-016-0535-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-016-0535-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T00:10:20Z","timestamp":1567555820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-016-0535-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,25]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["535"],"URL":"https:\/\/doi.org\/10.1007\/s10044-016-0535-1","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,25]]}}}