{"title":"Mean Stopping Time of a Pairing Markov Chain with the VKF Method on a Linear Order","authors":"D. V. Vinogradov","doi":"10.3103/S0005105522060103","DOIUrl":null,"url":null,"abstract":"<div><div><p><b>Abstract</b>—This paper shows that the stopping time for a pairing Markov chain in the VKF method on a minimal training sample generating a linearly ordered set of <i>n</i> candidates is limited to the number 4.</p></div></div>","PeriodicalId":42995,"journal":{"name":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.3103/S0005105522060103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1
Abstract—This paper shows that the stopping time for a pairing Markov chain in the VKF method on a minimal training sample generating a linearly ordered set of n candidates is limited to the number 4.
期刊介绍:
Automatic Documentation and Mathematical Linguistics is an international peer reviewed journal that covers all aspects of automation of information processes and systems, as well as algorithms and methods for automatic language analysis. Emphasis is on the practical applications of new technologies and techniques for information analysis and processing.