{"title":"非统一PPM和上下文树模型","authors":"J. Åberg, Y. Shtarkov, B. Smeets","doi":"10.1109/DCC.1998.672156","DOIUrl":null,"url":null,"abstract":"The problem of optimizing PPM with the help of different choices of estimators and their parameters for different subsets of nodes in the context tree is considered. Methods of such optimization for Markov chain and context tree models for individual files and over given sets of files are presented, and it is demonstrated that the extension from Markov chain models to context tree models is necessary to receive significant improvements of the compression ratio.","PeriodicalId":191890,"journal":{"name":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Non-uniform PPM and context tree models\",\"authors\":\"J. Åberg, Y. Shtarkov, B. Smeets\",\"doi\":\"10.1109/DCC.1998.672156\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of optimizing PPM with the help of different choices of estimators and their parameters for different subsets of nodes in the context tree is considered. Methods of such optimization for Markov chain and context tree models for individual files and over given sets of files are presented, and it is demonstrated that the extension from Markov chain models to context tree models is necessary to receive significant improvements of the compression ratio.\",\"PeriodicalId\":191890,\"journal\":{\"name\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1998.672156\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1998.672156","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The problem of optimizing PPM with the help of different choices of estimators and their parameters for different subsets of nodes in the context tree is considered. Methods of such optimization for Markov chain and context tree models for individual files and over given sets of files are presented, and it is demonstrated that the extension from Markov chain models to context tree models is necessary to receive significant improvements of the compression ratio.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
