Machine-translated by Google. Questions are authored in English.
Top

Discussion

How does a discrimination network reduce matching cost?

  • A.It converts the rules into an equivalent decision tree
  • B.It stores partial matches so only changes are reprocessed
  • C.It orders the rules so the most likely are tried first
  • D.It compresses the whole rule base into fewer equivalent rules

Answer: B

A network such as Rete keeps the partial matches computed so far and updates them incrementally as facts are added or removed, so the work is proportional to the change rather than to the size of the base. The price is considerable memory. Rule ordering, compression and decision trees are different techniques. Trading memory for incremental rather than complete recomputation is a pattern that recurs wherever a system responds to a stream of small changes.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.