Efficient Algorithm for Generating Maximal L-Reflexive Trees.
Milica AndelicDejan ZivkovicPublished in: Symmetry (2020)
Keyphrases
- single pass
- experimental evaluation
- computationally efficient
- learning algorithm
- detection algorithm
- objective function
- computational complexity
- search space
- k means
- tree construction
- np hard
- binary tree
- pruning strategy
- space complexity
- improved algorithm
- recognition algorithm
- times faster
- decision trees
- worst case
- significant improvement
- optimal solution
- theoretical analysis
- optimization algorithm
- expectation maximization
- classification algorithm
- path planning
- simulated annealing
- high accuracy
- highly efficient
- cost function
- data structure
- similarity measure