Local attribute value grouping for lazy rule induction

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present an extension of the lazy rule induction algorithm from [1]. We extended it to deal with real-value attributes and generalised its conditions for symbolic non-ordered attributes. The conditions for symbolic attributes are defined by means of a metric over attribute domain. We show that commonly used rules are a special case of the proposed rules with a specific metric. We also relate the proposed algorithm to the discretisation problem. We illustrate that lazy approach can omit the discretisation time complexity.

Cite

CITATION STYLE

APA

Góra, G., & Wojna, A. (2002). Local attribute value grouping for lazy rule induction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2475, pp. 405–412). Springer Verlag. https://doi.org/10.1007/3-540-45813-1_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free