Publications
- Milenko Drinic, Darko Kirovski and Miodrag Potkonjak, PPM Model Cleaning, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 163-172, 2003.
[http://www.cs.ucla.edu/~miodrag/papers/Drinic_DCC_03.pdf]
- Dmitry Shkarin, PPM: one step to practicality, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 202-211, 2002.
[http://www.compression.ru/download/articles/ppm/shkarin_2002dcc_ppmii_pdf.rar]
[http://www.compression.ru/download/articles/ppm/shkarin_2002dcc_ppmii_ps.rar]
[http://datacompression.info/Miscellaneous/PPMII_DCC02.pdf]
- James Cheney, Compressing XML with Multiplexed Hierarchical PPM Models, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 163-172, 2001.
[http://citeseer.ist.psu.edu/cheney01compressing.html]
[http://homepages.inf.ed.ac.uk/jcheney/publications/cheney-dcc2001.pdf]
[http://xmlppm.sourceforge.net/papers/cheney-dcc2001.ps]
[http://xmlppm.sourceforge.net/paper/paper.html]
- Arturo Campos, Implementing ppmc with hash tables, 2000.
[http://www.arturocampos.com/ac_ppmc.html]
[http://www.arturocampos.com/ac_ppmc_html.zip]
- Charles Bloom, Solving the Problems of Context Modeling, 1998.
[http://www.cbloom.com/papers/ppmz.zip]
- Suzanne Bunton, Semantically Motivated Improvements for PPM Variants, The Computer Journal, 40(2-3), pp. 76-93, 1997.
[http://citeseer.ist.psu.edu/bunton97semantically.html]
- Suzanne Bunton, A Percolating State Selector for Suffix-Tree Context Models, Technical report UW-CSE-97-02-06, Department of Computer Science and Engineering, University of Washington, 1997.
[http://citeseer.ist.psu.edu/bunton97percolating.html]
[ftp://ftp.cs.washington.edu/tr/1997/02/UW-CSE-97-02-06.PS.Z]
- Suzanne Bunton, An Executable Taxonomy of On-Line Modeling Algorithms, Technical report UW-CSE-97-02-05, Department of Computer Science and Engineering, University of Washington, 1997.
[http://citeseer.ist.psu.edu/bunton97executable.html]
[ftp://ftp.cs.washington.edu/tr/1997/02/UW-CSE-97-02-05.PS.Z]
- Suzanne Bunton, A Generalization and Improvement to PPM's "Blending", Technical report UW-CSE-97-01-10, Department of Computer Science and Engineering, University of Washington, 1997.
[http://citeseer.ist.psu.edu/bunton97generalization.html]
[ftp://ftp.cs.washington.edu/tr/1997/01/UW-CSE-97-01-10.PS.Z]
- John Cleary, William Teahan and Ian Witten, Unbounded Length Contexts for PPM, The Computer Journal, 40(2/3), pp. 67-75, 1997.
[http://www.informatics.bangor.ac.uk/~wjt/papers/CJ97.ps.gz]
- Suzanne Bunton, On-Line Stochastic Processes in Data Compression, PhD thesis, University of Washington, 1996.
[http://citeseer.ist.psu.edu/bunton96line.html]
[ftp://ftp.cs.washington.edu/tr/1997/03/UW-CSE-97-03-02.PS.Z]
- John Cleary, William Teahan and Ian Witten, Unbounded Length Contexts for PPM, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 52-61, 1995.
[http://citeseer.ist.psu.edu/9791.html]
[http://www.informatics.bangor.ac.uk/~wjt/papers/DCC95a.ps.gz]
[http://www.cs.waikato.ac.nz/~ihw/papers/95JC-WT-IHW-Unbound.pdf]
[http://www.cs.waikato.ac.nz/~ml/publications/1995/Cleary-Teahan-Witten-ppm.pdf]
- John Cleary and William Teahan, Experiments on the Zero Frequency Problem, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 480-, 1995.
[http://citeseer.ist.psu.edu/cleary95experiments.html]
[http://www.informatics.bangor.ac.uk/~wjt/papers/DCC95a.ps.gz]
- William Teahan, Probability estimation for PPM, Proceedings of the New Zealand Computer Science Research Students' Conference., University of Waikato, Hamilton, New Zealand, 1995.
[http://citeseer.ist.psu.edu/teahan95probability.html]
[http://www.informatics.bangor.ac.uk/~wjt/papers/teahan95probability.ps.gz]
- Paul Howard and Jeffrey Vitter, Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding, Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, pp. 98-107, 1993.
[http://citeseer.ist.psu.edu/59865.html]
[http://www.cs.duke.edu/~jsv/Papers/HoV93.qtfull.ps.gz]
[http://www.cs.duke.edu/~jsv/Papers/HoV93.qtfull.pdf]
- Paul Howard, The Design and Analysis of Efficient Lossless Data Compression Systems, PhD thesis, Department of Computer Science, Brown University, Providence, Rhode Island, pp. 7-34, 1993.
[http://citeseer.ist.psu.edu/howard93design.html]
[ftp://ftp.cs.brown.edu/pub/techreports/93/cs93-28.ps.Z]
- Daniel Hirschberg and Debra Lelewer, Context modeling for text compression, Image and Text Compression, Norwell, MA, pp. 113-144, 1992.
[http://citeseer.ist.psu.edu/hirschberg92context.html]
[http://www.ics.uci.edu/~dan/pubs/ContextModel.ps.gz]
- Mark Nelson, Arithmetic Coding + Statistical Modeling = Data Compression, Dr. Dobb's Journal, 1991.
[http://www.dogma.net/markn/articles/arith/part1.htm]
- Debra Lelewer and Daniel Hirschberg, An order-2 context model for data compression with reduced time and space requirements, Technical report 90-33, Department of Information and Computer Science, University of California, Irvine, 1990.
[http://citeseer.ist.psu.edu/lelewer90order.html]
[http://www.ics.uci.edu/~dan/pubs/TR90-33.ps.gz]
- John Cleary and Ian Witten, Data Compression Using Adaptive Coding and Partial String Matching, IEEE Transactions on Communications, 32(4), pp. 396-402, 1984.
[http://citeseer.ist.psu.edu/cleary84data.html]
- Wikipedia, PPM compression algorithm.
[http://en.wikipedia.org/wiki/PPM_compression_algorithm]
Source Code
日本語の資料