CATMS: an ATMS which avoids label explosions

Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), Los Angeles, CA, July 1991
CATMS: an ATMS which avoids label explosions
J. Collins, Dennis DeCoste

Assumption-based truth maintenance systems have developed into powerful and popular means for considering multiple contexts simultaneously during problem solving. Unfortunately, increasing problem complexity can lead to explosive growth of node labels.

In this paper, we present a new ATMS algorithm (CATMS) which avoids the problem of label explosions, while preserving most of the query time efficiencies resulting from label compilations. CATMS generalizes the standard ATMS subsumption relation, allowing it to compress an entire label into a single assumption.

This compression of labels is balanced by an expansion of environments to include any implied assumptions. The result is a new dimension of flexibility, allowing CATMS to trade-off the query-time efficiency of uncompressed labels against the costs of computing them. To demonstrate the significant computational gains of CATMS over de Kleer’s ATMS,we compare the performance of the ATMS-based QPE [9] problem-solver using each.

Another publication from the same category: Machine Learning and Data Science

WWW '17 Perth Australia April 2017

Drawing Sound Conclusions from Noisy Judgments

David Goldberg, Andrew Trotman, Xiao Wang, Wei Min, Zongru Wan

The quality of a search engine is typically evaluated using hand-labeled data sets, where the labels indicate the relevance of documents to queries. Often the number of labels needed is too large to be created by the best annotators, and so less accurate labels (e.g. from crowdsourcing) must be used. This introduces errors in the labels, and thus errors in standard precision metrics (such as P@k and DCG); the lower the quality of the judge, the more errorful the labels, consequently the more inaccurate the metric. We introduce equations and algorithms that can adjust the metrics to the values they would have had if there were no annotation errors.

This is especially important when two search engines are compared by comparing their metrics. We give examples where one engine appeared to be statistically significantly better than the other, but the effect disappeared after the metrics were corrected for annotation error. In other words the evidence supporting a statistical difference was illusory, and caused by a failure to account for annotation error.