The HCV induction algorithm

Authors:
Xindong Wu
Affiliations:
Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, Edinburgh EH1 1HN, UK
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 5
Cited 2

A theory of the learnable

Communications of the ACM
C4.5: programs for machine learning

C4.5: programs for machine learning
Incremental Induction of Decision Trees

Machine Learning
The CN2 Induction Algorithm

Machine Learning
Induction of Decision Trees

Machine Learning

Induction as Pre-processing

PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Web Usage Mining as a Tool for Personalization: A Survey

User Modeling and User-Adapted Interaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

HCV is a heuristic attribute-based induction algorithm based on the newly-developed extension matrix approach. By dividing the positive examples (PE) of a specific class 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 group's positive examples and none of the negative examples (NE), it can find a covering formula in form of variable-valued logic for PE against NE in low-order polynomial time. This paper presents the HCV algorithm in detail and provides a performance comparison of HCV with other inductive algorithms such as ID3 and AQ11.