Skip to main content

Constructing X-of-N attributes with a genetic algorithm

Larsen, O., Freitas, Alex A., Nievola, Julio C. (2002) Constructing X-of-N attributes with a genetic algorithm. In: Lofti, A. and Garibaldi, J. and John, R., eds. Proc. 4th Int. Conf. on Recent Advances in Soft Computing (RASC-2002). . pp. 326-331. Nottingham Trent University (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:13696)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)

Abstract

The predictive accuracy obtained by a classification

attributes of the data being mined. When the attributes are

predictive accuracy will tend to be low. To combat this

attributes out of the original attributes. Many attribute

conjunctions and/or disjunctions of attribute-value pairs.

power to represent attribute interactions. A more

N condition consists of a set of N attribute-value pairs.

(record) is the number of attribute-value pairs of the

condition. For instance, consider the following X-of-N

high”}. Suppose that a given example has the following

= high”}. This example has 2 out of the 3 attribute-value

N condition for this example is 2.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: genetic algorithms, constructive induction, data mining
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 17:59 UTC
Last Modified: 16 Feb 2021 12:24 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/13696 (The current URI for this page, for reference purposes)
Freitas, Alex A.: https://orcid.org/0000-0001-9825-4700
  • Depositors only (login required):