An Output-Polynomial Time Algorithm for Mining Frequent Closed Attribute Trees.
Hiroki ArimuraTakeaki UnoPublished in: ILP (2005)
Keyphrases
- computational complexity
- learning algorithm
- np hard
- dynamic programming
- worst case
- computational cost
- k means
- preprocessing
- experimental evaluation
- detection algorithm
- input data
- high accuracy
- theoretical analysis
- optimal solution
- decision trees
- binary tree
- recognition algorithm
- simulated annealing
- times faster
- optimization algorithm
- particle swarm optimization
- probabilistic model
- cost function
- significant improvement
- expectation maximization
- segmentation algorithm
- data sets
- attribute values
- tree structure
- convergence rate
- approximation ratio
- compact representations