Toolbox iaOPF - Optimum Path Forest classifier in Python

Functions and demonstrations using graphs, IFT and OPF

Machine Learning

Data Sets

Visualization

  • iaincmxtcreate -- Graph representation of an incidence Image using Graphviz
  • iaadjmxtcreate -- Graph representation of an adjacent Image using Graphviz
  • iaadjmxtcreate2 -- Graph representation of an adjacent Image using Graphviz
  • Lesson iaadjmxtcreat -- Lesson of graph representation of an adjacent Image using Graphviz
  • iafeatspace -- Visualization of 2D feature space from 2D prototypes and 2D samples
  • iagraphPlot -- This function plots a non-oriented graph in the eucidean space.
  • iaplotDecisionBoundaries -- This function returns an image with a plot of the decision boundary found by OPF, SVM, DT or k-NN in a 2-class bidimensional

Random Graph Generation

  • iarandGraph_and - (Not yet) Random graph/digraph generation.
  • iarandGraph -- This function generates a random oriented or non-oriented graph and returns its adjacency matrix. Non connected edges are represented by 'inf'.

Connected Components

  • Performance and Test Page - Page to compare the functions
  • iacc_rod - Connected Components using breadth first search
  • iacc_fra - Connected Components using recursive depth first search
  • iacc_and - Connected Components using union-find (set merging)
  • iacc_wes - Connected Components using recursive depth first search
  • iacc_rob - Connected Components using recursive depth first search
  • iacc_fer - Connected Components using recursive breadth first search
  • iacc_thi - Connected Components using recursive breadth first search
  • iacc_tia - Connected Components using recursive depth first search

Minimum Spanning Tree

Optimum Path - Dijkstra

OPF Fit Predict

Classification Metrics

  • iaconfmtx -- Compute confusion matrix to evaluate the accuracy of a classification

Graph Functions

  • iaprim -- MST calculation by Prim's algorithm
  • iaprim2 -- MST calculation by Prim's algorithm (implementation 1)
  • iaprim3 -- MST calculation by Prim's algorithm (implementation 2)
  • iamstseeds -- Search an MST graph for the seeds for an SPF-Max
  • iadijkstra -- SPF-Max calculation by Dijkstra's algorithm
  • iadijkstratz -- TZ-SPF-Max calculation by Dijkstra's algorithm
  • iaincspfnonopt -- Non-optimal Incremental SPF-Max
  • iaminedge2node -- Transformation of edge values into node values by minimum
  • iaminreg -- Finds the regional minimum given a graph with weighted nodes

Accessory Functions

Lessons

Development

Recently modified pages
More
Recently commented pages
More