RegPFA | Process mining algorithm that learns the structure

by DominicBreuker Java Version: Current License: No License

X-Ray Key Features Code Snippets Community Discussions Vulnerabilities Install Support

kandi X-RAY | RegPFA Summary

RegPFA is a Java library. RegPFA has no bugs, it has no vulnerabilities, it has build file available and it has low support. You can download it from GitHub.

This is an implementation of an EM algorithm for probabilistic finite automata. Dependencies for file input and output functionality: - Apache Commons IO (for file input and output. Dependencies for visualizations of automata (optional) - dk.brics.automaton (for minimizing visualizations of automata - Petrify (for generating Petri nets from automata visualizations - GraphViz (for rendering visualizations (dot) - Some PDF viewer.

Support

Quality

Security

License

Reuse

Support

RegPFA has a low active ecosystem.

It has 7 star(s) with 4 fork(s). There are 2 watchers for this library.

It had no major release in the last 6 months.

RegPFA has no issues reported. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of RegPFA is current.

Quality

RegPFA has 0 bugs and 0 code smells.

Security

RegPFA has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

RegPFA code analysis shows 0 unresolved vulnerabilities.

There are 0 security hotspots that need review.

License

RegPFA does not have a standard license declared.

Check the repository for any license declaration and review the terms closely.

Without a license, all rights are reserved, and you cannot use the library in your applications.

Reuse

RegPFA releases are not available. You will need to build from source code and install.

Build file is available. You can build the component from source.

RegPFA saves you 3964 person hours of effort in developing the same functionality from scratch.

It has 8436 lines of code, 562 functions and 69 files.

It has high code complexity. Code complexity directly impacts maintainability of the code.

Top functions reviewed by kandi - BETA

kandi has reviewed RegPFA and discovered the below as its top functions. This is intended to give you an instant insight into RegPFA implemented functionality, and help decide if they suit your requirements.

Run the algorithm .
Read a PetriNet from a PNML file .
Gets the core content .
Returns a map with the best solution for the given distribution .
Get a transition system
creates a mapping for the termination symbol
Parses a file into a list of Xes objects
Runs petrify .
Creates the numerical form of the log .
Replace the occurrences of occurrences in the log with a specific frequency .

Get all kandi verified functions for this library.

RegPFA Key Features

No Key Features are available at this moment for RegPFA.

RegPFA Examples and Code Snippets

No Code Snippets are available at this moment for RegPFA.

Community Discussions

No Community Discussions are available at this moment for RegPFA.Refer to stack overflow page for discussions.

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install RegPFA

You can download it from GitHub.
You can use RegPFA like any standard Java library. Please include the the jar files in your classpath. You can also use any IDE and you can run and debug the RegPFA component as you would do with any other Java program. Best practice is to use a build tool that supports dependency management such as Maven or Gradle. For Maven installation, please refer maven.apache.org. For Gradle installation, please refer gradle.org .

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: