Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,052,325 papers from all fields of science
Search
Sign In
Create Free Account
Prediction by partial matching
Known as:
PPM
, PPM compression algorithm
, PPMd
Prediction by partial matching (PPM) is an adaptive statistical data compression technique based on context modeling and prediction. PPM models use a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Adaptive algorithm
Arithmetic coding
Cluster analysis
Dasher
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Web prefetching through efficient prediction by partial matching
A. Gellert
,
A. Florea
World wide web (Bussum)
2015
Corpus ID: 207265547
In this work we propose a prediction by partial matching technique to anticipate and prefetch web pages and files accessed via…
Expand
2012
2012
Transference of Compressed Audio through SMS Using Prediction by Partial Matching Technique
Muhammad Fahad Khan
,
Saira Beg
,
Humayun Rehman
2012
Corpus ID: 16493985
This paper presents a method to transfer voice message through SMS in GSM network with and without using compression technique…
Expand
2012
2012
FPGA-based data compressor based on prediction by partial matching
Joel Ratsaby
,
V. Sirota
IEEE Convention of Electrical and Electronics…
2012
Corpus ID: 12557184
We design and develop a data compression engine on a single FPGA chip that is used as part of a text-classification application…
Expand
2011
2011
KOMPRESI DATA TEKS MENGGUNAKAN ALGORITMAPPM (PREDICTION BY PARTIAL MATCHING)
Himawan Widya Putra Gilang
2011
Corpus ID: 61214565
Abstrak Seiring dengan berkembangnya teknologi saat ini, data memiliki peranan yang sangat penting, data tersebut tidak hanya…
Expand
2009
2009
Evaluating text preprocessing to improve compression on maillogs
Frederick Otten
,
Barry V W Irwin
,
H. Thinyane
Research Conference of the South African…
2009
Corpus ID: 14259453
Maillogs contain important information about mail which has been sent or received. This information can be used for statistical…
Expand
2008
2008
Link Completion using Prediction by Partial Matching
P. Chaiwanarom
,
C. Lursinsap
International Symposium on Communications and…
2008
Corpus ID: 17590239
Prediction by partial matching (PPM) is typically used as a powerful method for data compression. Recently, PPM was applied to…
Expand
2004
2004
Merging prediction by partial matching with structural contexts model
J. Adiego
,
P. Fuente
,
G. Navarro
Data Compression Conference, . Proceedings. DCC
2004
Corpus ID: 33817576
This paper discusses the possibility of considering the text structure in the context of compressed structured documents. This…
Expand
2004
2004
Combining Prediction by Partial Matching and Logistic Regression for Thai Word Segmentation
O. Sornil
,
P. Chaiwanarom
International Conference on Computational…
2004
Corpus ID: 39211191
Word segmentation is an important part of many applications, including information retrieval, information filtering, document…
Expand
2003
2003
Dictionary-based fast transform for text compression
Weifeng Sun
,
Nan Zhang
,
A. Mukherjee
Proceedings ITCC . International Conference on…
2003
Corpus ID: 8339346
In this paper we present StarNT, a dictionary-based fast lossless text transform algorithm. With a static generic dictionary…
Expand
1997
1997
Text compression by context tree weighting
J. Åberg
,
Y. Shtarkov
Proceedings DCC '97. Data Compression Conference
1997
Corpus ID: 28418797
The results of an experimental study of different modifications of the context tree weighting algorithm are described. In…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE