Prediction Suffix Tree
It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it. This message has remained in place for seven days, so the article may be deleted without further notice. Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|Prediction Suffix Tree|concern=Might or might not be a notable concept, but it has been an orphaned substub for 14 years. TNT applies.}} ~~~~Timestamp: 20220929111027 11:10, 29 September 2022 (UTC) Administrators: delete |
A Prediction Suffix Tree is a mathematical technique for modelling sequences.
External links
- Karampatziakis, Nikos. "Learning Prediction Suffix Trees with Winnow". http://www.cs.cornell.edu/~kozen/papers/pst.pdf.
- Largeron - Leténo, Christine. "Prediction suffix trees for supervised classification of sequences". http://perso.univ-st-etienne.fr/largeron/PATREC.pdf.
- Dekel, Ofer; Shalev-Shwartz, Shai; Singer, Yoram. "The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees". http://research.microsoft.com/en-us/um/people/oferd/papers/DekelShSi05a.pdf.
 |
