On the computational complexity of the probabilistic label tree algorithms.
Róbert Busa-FeketeKrzysztof DembczynskiAlexander GolovnevKalina JasinskaMikhail KuznetsovMaxim SviridenkoChao XuPublished in: CoRR (2019)
Keyphrases
- computational complexity
- computational cost
- computationally efficient
- high computational complexity
- times faster
- computational efficiency
- theoretical analysis
- learning algorithm
- memory requirements
- orders of magnitude
- index structure
- np complete
- multi dimensional
- special case
- machine learning
- optimization problems
- probabilistic model
- np hard
- search algorithm
- conditional probabilities
- graph theory
- maximal cliques