A Generic Querying Algorithm for Greedy Sets of Existential Rules.
Michaël ThomazoJean-François BagetMarie-Laure MugnierSebastian RudolphPublished in: KR (2012)
Keyphrases
- dynamic programming
- cost function
- experimental evaluation
- recognition algorithm
- matching algorithm
- computationally efficient
- preprocessing
- times faster
- computational cost
- np hard
- detection algorithm
- lower bound
- learning algorithm
- optimal solution
- clustering method
- segmentation algorithm
- theoretical analysis
- particle swarm optimization
- high accuracy
- worst case
- significant improvement
- optimization algorithm
- probabilistic model
- k means
- greedy algorithm
- computational complexity
- heuristic rules
- greedy search
- locally optimal