Probabilistic Suffix Trees: Project Home – R-Forge

The PST library allows to fit and visualize Probabilistic Suffix Trees (PST), the construction that stores Variable Length Markov Chains (VLMC). Fitted PSTs can be used to predict, generate or impute categorical sequences.

• Development Status : 4 - Beta
• Intended Audience : End Users/Desktop
• License : OSI Approved : GNU General Public License (GPL)
• Natural Language : English
• Operating System : OS Independent
• Programming Language : R
• Topic : Graphics
• Topic : Machine Learning
• Topic : Social Sciences : Analysis of Categorical and Count Data

Registered: 2012-01-04 10:50
Activity Ranking: 0
View project Statistics
View list of RSS feeds available for this project.

Project Admins

View the 1 Member(s)

Request to join