DiscretePath

macOS / Productivité

'DiscretePath' is software for drawing, visualizing and analyzing medium-sized graphs (networks). Graphs of up to 20,000 edges (links) can be drawn in a reasonable amount of time. Larger graphs can also be imported and drawn, but this takes longer. Most analyzes can be performed on medium sized graphs, except when non-polynomial algorithms or very complex matrices need to be constructed.
An 'Artificial Intelligence' module has been added. This module covers A.I. algorithms that use graphs in some form. The first supervised learning A.I. algorithms that are covered are: "Decision Trees". The decision tree algorithms can handle both categorical and numerical data and can be used for both classification and regression tasks.
At https://www.intrinsic-code.eu you will find the 'User's Guide' which visually explains how to use the software, as well as additional information and background on the many software functions and algorithms used in the analyses.

Quoi de neuf dans la dernière version ?

Improvements:
- The matrices constructed in the hitting time and nearest neighbor clustering algorithms can be reused when only the value of the slider that determines stronger or weaker clustering has been changed. This results in significant time savings for re-clustering (especially for hitting time clustering).
- After clustering, each of the clusters can be saved as a separate graph that can be used for further analysis (further clustering, centrality, ...).
- The 'Nearest Neighbor' clustering algorithm has been significantly improved, especially the part that takes into account the weights of the edges.
- Memory managing has been further optimized.
- The help function has been further expanded.

Bug fixes:
- A rare bug in the 'Save'-procedure has been fixed.