machine learning - algorithmic complexity of classification algorithms/artificial neural networks -
the algorithmic complexity of binary trees o(n), n being height of tree. there resources listing complexity of methods selecting best tree? e.g. boosted regression trees, cart or c4.5 (even mars)
also, not familiar artificial neural networks, references seem point specific ann implementations being np-complete: http://people.csail.mit.edu/rivest/pubs/br93.pdf, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.8997.
does know extent general result?
Comments
Post a Comment