---
title: "Improving the Design of Induction Methods by Analyzing Algorithm Functionality and Data-Based Concept Complexity"
authors:
  - "Larry A. Rendell"
  - "Harish Ragavan"
doi: ""
url: "https://ijcai.org/proceedings/1993/131"
pdf: "https://ijcai.org/proceedings/1993/0131.pdf"
venue: "Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence"
year: 1993
pages: "952-958"
track: "Machine Learning"
keywords:
---

# Improving the Design of Induction Methods by Analyzing Algorithm Functionality and Data-Based Concept Complexity

Larry A. Rendell, Harish Ragavan

*Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence*, pages 952-958.

## Abstract

Although empirical machine learning has seen many algorithms, one of its most important goals has been neglected. Important real-world problems often have just a primitive representation, to which the target concept bears only a remote, obscure relationship. This consideration leads to a class of measures that may be applied to data to estimate difficulty for standard algorithms. As the concept becomes harder, current decision tree and decision list methods give increasingly poor accuracy, though backpropagation does better . A new system for feature construction scales up best. The fundamental limitation of standard algorithms is caused by two problems: greedy search and representational inadequacy. Critical analysis and empirical results show that lookahead alleviates the greedy hill-climbing problem at high cost, but even this is insufficient. Combining lookahead with feature construction alleviates the "complex global replication" problem with hard concepts. For principled algorithm development and good progress, researchers need to study hard concepts and system behavior using them.