Class ComplexityMetrics

java.lang.Object
org.drip.graph.decisiontree.ComplexityMetrics

public class ComplexityMetrics
extends java.lang.Object
ComplexityMetrics implements the Asymptotic Size Complexity O (n) for Decision Tree Validation. The References are:

  • Bader, D. A., and G. Cong (2006): Fast Shared Memory Algorithms for computing the Minimum Spanning Forests of Sparse Graphs Journal of Parallel and Distributed Computing 66 (11) 1366-1378
  • Chazelle, B. (2000): A Minimum Spanning Tree ALgorithm with Inverse-Ackerman Type Complexity Journal of the Association for Computing Machinery 47 (6) 1028-1047
  • Karger, D. R., P. N. Klein, and R. E. Tarjan (1995): A Randomized Linear-Time Algorithm to find Minimum Spanning Trees Journal of the Association for Computing Machinery 42 (2) 321-328
  • Pettie, S., and V. Ramachandran (2002): An Optimal Minimum Spanning Tree Algorithm Journal of the ACM 49 (1) 16-34
  • Wikipedia (2020): Minimum Spanning Tree https://en.wikipedia.org/wiki/Minimum_spanning_tree




Author:
Lakshmi Krishnamurthy
  • Constructor Details

    • ComplexityMetrics

      public ComplexityMetrics​(GenerationComplexity generation, ValidationComplexity validation) throws java.lang.Exception
      ComplexityMetrics Constructor
      Parameters:
      generation - Generation Complexity Metrics
      validation - Validation Complexity Metrics
      Throws:
      java.lang.Exception - Thrown if the Inputs are Invalid
  • Method Details

    • generation

      public GenerationComplexity generation()
      Retrieve the Generation Complexity Metrics
      Returns:
      Generation Complexity Metrics
    • validation

      public ValidationComplexity validation()
      Retrieve the Validation Complexity Metrics
      Returns:
      Validation Complexity Metrics