The University of Edinburgh -
Division of Informatics
Forrest Hill & 80 South Bridge

Research Paper #578

Title:Hcv: a Heuristic Covering Algorithm for Extension Matrix Approach
Date: 1992
Presented:Submitted to Machine Learning, 1992
Abstract:HCV is a heuristic attribute-based induction algorithm based on the extension matrix approach. By dividing the positive examples (PE) in a given example set into intersecting groups and adopting a set of strategies to find a heuristic conjunctive formula in each group which covers all the positive examples in the group and none of the negative examples (NE), it can find a covering formula in form of variable-value logic for PE against NE in low-order polynomial time. This paper presents the algorithm in detail and provides a comparison of it with ID3, a representative of the decision tree method based family of inductive algorithms.

[Search These Pages] [DAI Home Page] [Comment]