Skip to main content
Kent Academic Repository

Constructing X-of-N Attributes with a Genetic Algorithm

Larsen, Otavio and Freitas, Alex A. and Nievola, Julio C. (2002) Constructing X-of-N Attributes with a Genetic Algorithm. In: Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation. Morgan Kaufmann, San Francisco, California, USA. ISBN 1-55860-878-8. (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:13772)

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.


The predictive accuracy obtained by a classification algorithm is strongly dependent on the quality of the attributes of the data being mined. When the attributes are little relevant for predicting the class of a record, the predictive accuracy will tend to be low. To combat this problem, a natural approach consists of constructing new attributes out of the original attributes. Many attribute construction algorithms work by simply constructing conjunctions and/or disjunctions of attribute-value pairs. This kind of representation has a limited expressiveness power to represent attribute interactions. A more expressive representation is X-of-N [Zheng 1995]. An X-of-N condition consists of a set of N attribute-value pairs. The value of an X-of-N condition for a given example (record) is the number of attribute-value pairs of the example that match with the N attribute-value pairs of the condition. For instance, consider the following X-of-N condition: X-of-{"Sex = male", "Age < 21", "Salary = high"}. Suppose that a given example has the following attribute-value pairs: {"Sex = male", "Age = 51", "Salary = high"}. This example has 2 out of the 3 attribute-value pairs of the X-of-N condition, so that the value of the X-of-N condition for this example is 2.

Item Type: Book section
Additional information: oint meeting of the 7th Annual genetic programming conference (GP-2002) and the 11th International conference on genetic algorithms (ICGA-2002); See also same s/m for papers on CD-ROM
Uncontrolled keywords: GECCO ; genetic computation ; evolutionary computation ; genetic programming ; genetic algorithms ; ISGEC
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 18:00 UTC
Last Modified: 16 Nov 2021 09:51 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.