{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T23:52:42Z","timestamp":1774050762437,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T00:00:00Z","timestamp":1675641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T00:00:00Z","timestamp":1675641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10044-023-01131-5","type":"journal-article","created":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T18:02:45Z","timestamp":1675706565000},"page":"751-772","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Learning automata-based partitioning algorithms for stochastic grouping problems with non-equal partition sizes"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5105-1575","authenticated-orcid":false,"given":"B. John","family":"Oommen","sequence":"first","affiliation":[]},{"given":"Rebekka Olsson","family":"Omslandseter","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Jiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,6]]},"reference":[{"issue":"2","key":"1131_CR1","first-page":"185","volume":"30","author":"D Berend","year":"2010","unstructured":"Berend D, Tassa T (2010) Improved bounds on bell numbers and on moments of sums of random variables. Probab Math Stat 30(2):185\u2013205","journal-title":"Probab Math Stat"},{"key":"1131_CR2","first-page":"227","volume":"583","author":"O Ekaba Bisong","year":"2020","unstructured":"Ekaba Bisong O, John Oommen B (2020) Optimizing self-organizing lists-on-lists using transitivity and pursuit-enhanced object partitioning. Artif Intell Appl Innov 583:227\u2013240","journal-title":"Artif Intell Appl Innov"},{"key":"1131_CR3","doi-asserted-by":"crossref","unstructured":"Fayyoumi E, Oommen B (2009) \u201cAchieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning automata,\u201d IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics: a publication of the IEEE Systems, Man and Cybernetics Society, 39:1192\u2013205","DOI":"10.1109\/TSMCB.2009.2013723"},{"issue":"5","key":"1131_CR4","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1109\/12.53585","volume":"39","author":"W Gale","year":"1990","unstructured":"Gale W, Das S, Yu CT (1990) Improvements to an algorithm for equipartitioning. IEEE Trans Comput 39(5):706\u2013710","journal-title":"IEEE Trans Comput"},{"key":"1131_CR5","doi-asserted-by":"crossref","unstructured":"Glimsdal S, Granmo O-C (2014) \u201cA novel bayesian network based scheme for finding the optimal solution to stochastic online equi-partitioning problems,\u201d In: 2014 13th international conference on machine learning and applications,pp 594\u2013599","DOI":"10.1109\/ICMLA.2014.102"},{"key":"1131_CR6","doi-asserted-by":"crossref","unstructured":"Hacibeyoglu M, Tongur V, Alaykiran K (2014) \u201cSolving the bi-dimensional two-way number partitioning problem with heuristic algorithms,\u201d In: 2014 IEEE 8th international conference on application of information and communication technologies (AICT),pp 1\u20135","DOI":"10.1109\/ICAICT.2014.7035916"},{"key":"1131_CR7","doi-asserted-by":"crossref","unstructured":"Jobava A (2015) \u201cIntelligent traffic-aware consolidation of virtual machines in a data center\u201d, master\u2019s thesis, university of oslo, department of informatics, Oslo","DOI":"10.1109\/NTMS.2016.7792430"},{"key":"1131_CR8","unstructured":"Karmarker N, Karp RM (1983) \u201cThe differencing method of set partitioning,\u201d EECS Department, University of California, Berkeley, Tech. Rep. UCB\/CSD-83-113. [Online]. Available: http:\/\/www2.eecs.berkeley.edu\/Pubs\/TechRpts\/1983\/6353.html"},{"key":"1131_CR9","unstructured":"Korf RE (1995) \u201cFrom approximate to optimal solutions: a case study of number partitioning,\u201d in IJCAI"},{"issue":"2","key":"1131_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(98)00086-1","volume":"106","author":"RE Korf","year":"1998","unstructured":"Korf RE (1998) A complete anytime algorithm for number partitioning. Artif Intell 106(2):181\u2013203","journal-title":"Artif Intell"},{"key":"1131_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cor.2014.01.003","volume":"46","author":"J Kratica","year":"2014","unstructured":"Kratica J, Kojic J, Savic A (2014) Two metaheuristic approaches for solving multidimensional two-way number partitioning problem. Comput Oper Res 46:59\u201368","journal-title":"Comput Oper Res"},{"key":"1131_CR12","unstructured":"Omslandseter RO (2020) Learning automata-based object partitioning with pre-specified cardinalities. Master\u2019s thesis, University of Agder, Department of Information and Communication Technology, Grimstad, Norway"},{"key":"1131_CR13","doi-asserted-by":"crossref","unstructured":"Omslandseter RO, Jiao L, Oommen BJ (2021) \u201cA learning-automata based solution for non-equal partitioning: partitions with common GCD Sizes,\u201d in advances and trends in artificial intelligence. from theory to practice, ser. Lecture Notes in Computer Science, H.\u00a0Fujita, A.\u00a0Selamat, J.\u00a0C.-W. Lin, and M.\u00a0Ali, Eds. Springer International Publishing, pp 227\u2013239","DOI":"10.1007\/978-3-030-79463-7_19"},{"key":"1131_CR14","doi-asserted-by":"crossref","unstructured":"Omslandseter RO, Jiao L, Oommen BJ (2021) \u201cObject migration automata for non-equal partitioning problems with known partition sizes,\u201d in artificial intelligence applications and innovations, ser. ifip advances in information and communication technology, I.\u00a0Maglogiannis, J.\u00a0Macintyre, and L.\u00a0Iliadis, Eds. Springer International Publishing, pp 129\u2013142","DOI":"10.1007\/978-3-030-79150-6_11"},{"key":"1131_CR15","first-page":"1","volume-title":"User Grouping and Power Allocation in NOMA Systems: A Novel Semi-supervised Reinforcement Learning-based Solution,\u201d in Pattern Analysis and Applications","author":"RO Omslandseter","year":"2022","unstructured":"Omslandseter RO, Jiao L, Liu Y, Oommen BJ (2022) User Grouping and Power Allocation in NOMA Systems: A Novel Semi-supervised Reinforcement Learning-based Solution,\u2019\u2019 in Pattern Analysis and Applications. Springer, London, pp 1\u201317"},{"key":"1131_CR16","first-page":"A105","volume":"35","author":"B John Oommen","year":"1992","unstructured":"John Oommen B, Ma DCY (1992) Stochastic automata solutions to the object partitioning problem. Comput J 35:A105\u2013A120","journal-title":"Comput J"},{"key":"1131_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/34.192492","volume":"15","author":"B John Oommen","year":"1993","unstructured":"John Oommen B, Zgierski J (1993) A learning automaton solution to breaking substitution ciphers. IEEE Trans Pattern Anal Mach Intell 15:185\u2013192","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"1131_CR18","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1093\/comjnl\/36.6.542","volume":"36","author":"B John Oommen","year":"1993","unstructured":"John Oommen B, Fothergill C (1993) Fast learning automaton-based image examination and retrieval. Comput J 36(6):542\u2013553","journal-title":"Comput J"},{"key":"1131_CR19","doi-asserted-by":"crossref","unstructured":"Pop PC, Matei O (2013) A genetic algorithm approach for the multidimensional two-way number partitioning problem, in Learning and Intelligent Optimization, ser. Lecture Notes in Computer Science, G.\u00a0Nicosia and P.\u00a0Pardalos, Eds Berlin, Heidelberg, Springer, pp 81\u201386","DOI":"10.1007\/978-3-642-44973-4_10"},{"key":"1131_CR20","unstructured":"Shirvani A (2018) Novel solutions and applications of the object partitioning problem, Ph.D. thesis Carleton University, School of Computer Science, Ottawa, Canada"},{"issue":"2","key":"1131_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0166-218X(94)00032-9","volume":"63","author":"L-H Tasi","year":"1995","unstructured":"Tasi L-H (1995) The modified differencing method for the set partitioning problem with cardinality constraints. Dis Appl Math 63(2):175\u2013180","journal-title":"Dis Appl Math"},{"key":"1131_CR22","unstructured":"(1974) Tsetlin, Automation theory and modeling of biological systems. Academic Press, google-Books-ID: 3wLEDm__bnsC"},{"key":"1131_CR23","unstructured":"Ung FM (2015) Towards efficient and cost-effective live migrations of virtual machines,Master\u2019s thesis, Carleton University, Ottawa"},{"issue":"3","key":"1131_CR24","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10489-011-0280-5","volume":"36","author":"A Yazidi","year":"2012","unstructured":"Yazidi A, Granmo O-C, John Oommen B (2012) Service selection in stochastic environments: a learning-automaton based solution. Appl Intell 36(3):617\u2013637","journal-title":"Appl Intell"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-023-01131-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-023-01131-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-023-01131-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T04:40:22Z","timestamp":1681533622000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-023-01131-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,6]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1131"],"URL":"https:\/\/doi.org\/10.1007\/s10044-023-01131-5","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,6]]},"assertion":[{"value":"9 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose. The data utilized in simulations can be made available on reasonable request.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}