CI learning-challenge
  • Introduction
    • Resources
    • Requirements
  • Algorithms
    • Decision Trees - (dtree)
    • k-Nearest Neighbors - (kNN)
  • Distance-Measures
    • chebyshev - (chebyshev)
    • euclidean - (euclidean)
    • hamming - (hamming)
    • manhattan - (manhattan)
    • minkowski - (minkowski)
    • seuclidean - (seuclidean)
    • sqeuclidean - (sqeuclidean)
    • weuclidean - (weuclidean)
    • wminkowski - (wminkowski)
  • Configuration
  • Web-Frontend
    • Models
    • Views
    • Processors
  • Backend
    • Backend - Helpers
  • Python - API
 
CI learning-challenge
  • Docs »
  • Welcome to CI learning-challenge’s documentation!
  • Edit on Bitbucket

Welcome to CI learning-challenge’s documentation!¶

Contents:

  • Introduction
    • Resources
    • Requirements
  • Algorithms
    • Decision Trees - (dtree)
    • k-Nearest Neighbors - (kNN)
  • Distance-Measures
    • chebyshev - (chebyshev)
    • euclidean - (euclidean)
    • hamming - (hamming)
    • manhattan - (manhattan)
    • minkowski - (minkowski)
    • seuclidean - (seuclidean)
    • sqeuclidean - (sqeuclidean)
    • weuclidean - (weuclidean)
    • wminkowski - (wminkowski)
  • Configuration
  • Web-Frontend
    • Models
    • Views
    • Processors
  • Backend
    • Backend - Helpers
  • Python - API

Indices and tables¶

  • Index
  • Module Index
  • Search Page
Next

© Copyright 2014, Pascal Held, Christian Braune.

Built with Sphinx using a theme provided by Read the Docs.