An algorithm for determining minimal reduced-coverings of acyclic database schemes.
Tieying LiuXinming YePublished in: J. Comput. Sci. Technol. (1996)
Keyphrases
- objective function
- theoretical analysis
- learning algorithm
- times faster
- recognition algorithm
- np hard
- data sets
- detection algorithm
- optimization algorithm
- cost function
- expectation maximization
- high accuracy
- improved algorithm
- matching algorithm
- computationally efficient
- linear programming
- experimental evaluation
- dynamic programming
- k means
- relational databases
- databases
- worst case
- computational cost
- markov random field
- simulated annealing
- search space
- segmentation algorithm
- preprocessing
- classification algorithm
- search algorithm
- optimal solution
- database