Search Results for "trees"

ProM is the comprehensive, extensible framework for process mining. Process Mining deals with the a-posteriori analysis of (business) processes using enactment logs.

Plinko was originally an experiment with Prefix Trees and log parsing. The general concept is to have a single end point you can send any data to, in a "fire and forget" fashion. Plinko should identify and parse the data completely without the sending system caring what it sent. The latest version supports named fields in the STL files for tagging data parsed in the Prefix Tree and anonymous functions for parsing dynamic message payloads.

representation by relations vs data storage. pile unifies the contradicted qualities of tables/trees (databases) and complex networks, order and flexibility. dynamical data generation on call. fast. natively compressing similarities. search across scopes.

AlViz is a research prototype for visual ontology alignment implemented as multiple-view plug-in for Protege using J-Trees and Graphs. Based on similarity measures of an ontology matching algorithm AlViz helps to assess and optimize the alignment results

The package implements a variety of tools for categorization of multivariate data such as boosted decision trees, bagging and random forest, bump hunting (PRIM), a multi-class learner and others.

A Java-based tool for creating, designing and distributing graphical trees that represent syntactic construction of sentences. Useful for drawing trees under X-bar generative theory or any other correlated application.

x2svg is software to graphically lay out files like XML Schema, DTDs and Java property files as scalable vector graphics (SVG). Diagrams can be converted into PDF, PNG, TIF and EPS files directly from within x2svg. A simple GUI and ant integration exist.

This is a Python package designed to process Penn Treebank Release II-style combined trees (.mrg files) into useful objects for tree traversal, feature extraction, and statistical analysis. For more information, go to http://mrgutils.sourceforge.net

baobab is an implementation of FPTrees or Frequent Pattern Trees, a pattern recognition/data mining technique. it has innumerable applications in language processing, clickstream analysis, etc.

JMiner is a (not yet!) complete data mining and artificial intelligence solution written in Java. Support for neural networks, genetic algorithms/programming, decision trees, clustering, market basket analysis, link analysis, data cleansing, and others.

DTreeJungle provides educational applets to teach the concepts of decision trees for regular pattern recognition.