{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T23:27:30Z","timestamp":1720049250983},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"am","delay-in-days":328,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1016\/j.patrec.2022.05.019","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T17:26:26Z","timestamp":1652981186000},"page":"181-188","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["On the choice of number of superstates in the aggregation of Markov chains"],"prefix":"10.1016","volume":"159","author":[{"given":"Amber","family":"Srivastava","sequence":"first","affiliation":[]},{"given":"Raj K.","family":"Velicheti","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3259-6027","authenticated-orcid":false,"given":"Srinivasa M.","family":"Salapaka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.patrec.2022.05.019_bib0001","series-title":"Markov chains: from theory to implementation and experimentation","author":"Gagniuc","year":"2017"},{"key":"10.1016\/j.patrec.2022.05.019_bib0002","series-title":"The mathematics of internet congestion control","author":"Srikant","year":"2004"},{"key":"10.1016\/j.patrec.2022.05.019_bib0003","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.patrec.2019.09.022","article-title":"Human behaviour modelling for welfare technology using hidden markov models","volume":"137","author":"S\u00e1nchez","year":"2020","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patrec.2022.05.019_bib0004","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.patrec.2016.05.025","article-title":"Markov chains for unsupervised segmentation of degraded nir iris images for person recognition","volume":"82","author":"Yahiaoui","year":"2016","journal-title":"Pattern Recognit. Lett."},{"key":"10.1016\/j.patrec.2022.05.019_bib0005","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.patrec.2016.12.022","article-title":"Object recognition under severe occlusions with a hidden markov model approach","volume":"86","author":"Guerrero-Pena","year":"2017","journal-title":"Pattern Recognit. Lett."},{"issue":"10","key":"10.1016\/j.patrec.2022.05.019_bib0006","doi-asserted-by":"crossref","first-page":"2464","DOI":"10.1109\/TAC.2012.2188423","article-title":"A metric between probability distributions on finite sets of different cardinalities and applications to order reduction","volume":"57","author":"Vidyasagar","year":"2012","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"10","key":"10.1016\/j.patrec.2022.05.019_bib0007","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1109\/TAC.2014.2319473","article-title":"Aggregation of graph models and markov chains by deterministic annealing","volume":"59","author":"Xu","year":"2014","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"12","key":"10.1016\/j.patrec.2022.05.019_bib0008","doi-asserted-by":"crossref","first-page":"2793","DOI":"10.1109\/TAC.2011.2141350","article-title":"Optimal kullback-leibler aggregation via spectral theory of markov chains","volume":"56","author":"Deng","year":"2011","journal-title":"IEEE Trans. Automat. Contr."},{"key":"10.1016\/j.patrec.2022.05.019_bib0009","first-page":"45","article-title":"Markov state space aggregation via the information bottleneck method","volume":"23","author":"Geiger","year":"2014","journal-title":"Schedae Informaticae"},{"key":"10.1016\/j.patrec.2022.05.019_bib0010","series-title":"ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","first-page":"3612","article-title":"An information-theoretic approach for automatically determining the number of state groups when aggregating markov chains","author":"Sledge","year":"2019"},{"issue":"2","key":"10.1016\/j.patrec.2022.05.019_bib0011","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1111\/1467-9868.00293","article-title":"Estimating the number of clusters in a data set via the gap statistic","volume":"63","author":"Tibshirani","year":"2001","journal-title":"J. R. Stat. Soc."},{"key":"10.1016\/j.patrec.2022.05.019_bib0012","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","first-page":"5000","article-title":"On the persistence of clustering solutions and true number of clusters in a dataset","volume":"33","author":"Srivastava","year":"2019"},{"issue":"11","key":"10.1016\/j.patrec.2022.05.019_bib0013","doi-asserted-by":"crossref","first-page":"2210","DOI":"10.1109\/5.726788","article-title":"Deterministic annealing for clustering, compression, classification, regression, and related optimization problems","volume":"86","author":"Rose","year":"1998","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.patrec.2022.05.019_bib0014","series-title":"Advances in neural information processing systems","first-page":"281","article-title":"Learning the k in k-means","author":"Hamerly","year":"2004"},{"key":"10.1016\/j.patrec.2022.05.019_bib0015","series-title":"Probability theory: The logic of science","author":"Jaynes","year":"2003"},{"key":"10.1016\/j.patrec.2022.05.019_bib0016","article-title":"Numerical solution of markov chains","author":"Elsayad","year":"2002","journal-title":"Theses Digitization Project. 2056. https:\/\/scholarworks.lib.csusb.edu\/etd-project\/2056"},{"key":"10.1016\/j.patrec.2022.05.019_bib0017","article-title":"Data clustering by markovian relaxation and the information bottleneck method","volume":"13","author":"Tishby","year":"2000","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"23","key":"10.1016\/j.patrec.2022.05.019_bib0018","doi-asserted-by":"crossref","first-page":"5982","DOI":"10.1073\/pnas.1616056114","article-title":"Mental models accurately predict emotion transitions","volume":"114","author":"Thornton","year":"2017","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.patrec.2022.05.019_bib0019","article-title":"English letter frequency counts: mayzner revisited or etaoin srhldcu","author":"Norvig","year":"2013","journal-title":"Dostopno na http:\/\/www. norvig. com\/mayzner. html.[obiskano 2016-08-07]"},{"issue":"7","key":"10.1016\/j.patrec.2022.05.019_bib0020","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1093\/nar\/30.7.1575","article-title":"An efficient algorithm for large-scale detection of protein families","volume":"30","author":"Enright","year":"2002","journal-title":"Nucleic Acids Res."},{"issue":"6","key":"10.1016\/j.patrec.2022.05.019_bib0021","doi-asserted-by":"crossref","first-page":"2520","DOI":"10.1109\/TKDE.2019.2956532","article-title":"Hm-modularity: a harmonic motif modularity approach for multi-layer network community detection","volume":"33","author":"Huang","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"10.1016\/j.patrec.2022.05.019_bib0022","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","article-title":"Reality mining: sensing complex social systems","volume":"10","author":"Eagle","year":"2006","journal-title":"Pers. Ubiquitous Comput."},{"issue":"4","key":"10.1016\/j.patrec.2022.05.019_bib0023","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."},{"key":"10.1016\/j.patrec.2022.05.019_bib0024","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.ijepes.2019.02.025","article-title":"Clustering and supervisory voltage control in power systems","volume":"109","author":"Baranwal","year":"2019","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"9","key":"10.1016\/j.patrec.2022.05.019_bib0025","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/TPAMI.2002.1033218","article-title":"A maximum variance cluster algorithm","volume":"24","author":"Veenman","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patrec.2022.05.019_bib0026","unstructured":"D. Dua, C. Graff, UCI machine learning repository, 2017, (????). http:\/\/archive.ics.uci.edu\/ml."},{"key":"10.1016\/j.patrec.2022.05.019_bib0027","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.patrec.2016.09.002","article-title":"A new micro-objects-based evaluation measure for co-clustering algorithms","volume":"84","author":"Rosales-M\u00e9ndez","year":"2016","journal-title":"Pattern Recognit. Lett."},{"issue":"7","key":"10.1016\/j.patrec.2022.05.019_bib0028","doi-asserted-by":"crossref","first-page":"3068","DOI":"10.1109\/TAC.2019.2945891","article-title":"A generalized framework for kullback-leibler markov aggregation","volume":"65","author":"Amjad","year":"2020","journal-title":"IEEE Trans. Automat. Contr."},{"key":"10.1016\/j.patrec.2022.05.019_bib0029","series-title":"Matrix analysis for scientists and engineers","volume":"91","author":"Laub","year":"2005"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865522001799?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865522001799?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T18:01:38Z","timestamp":1673287298000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865522001799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":29,"alternative-id":["S0167865522001799"],"URL":"https:\/\/doi.org\/10.1016\/j.patrec.2022.05.019","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the choice of number of superstates in the aggregation of Markov chains","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patrec.2022.05.019","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}