IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i10d10.1057_palgrave.jors.2601174.html
   My bibliography  Save this article

Optimal techniques for class-dependent attribute discretization

Author

Listed:
  • N Bryson

    (Virginia Commonwealth University)

  • A Joseph

    (University of Miami)

Abstract

Preprocessing of raw data has been shown to improve performance of knowledge discovery processes. Discretization of quantitative attributes is a key component of preprocessing and has the potential to greatly impact the efficiency of the process and the quality of its outcomes. In attribute discretization, the value domain of an attribute is partitioned into a finite set of intervals so that the attribute can be described using a small number of discrete representations. Discretization therefore involves two decisions, on the number of intervals and the placement of interval boundaries. Previous approaches for quantitative attribute discretization have used heuristic algorithms to identify partitions of the attribute value domain. Therefore, these approaches cannot be guaranteed to provide the optimal solution for the given discretization criterion and number of intervals. In this paper, we use linear programming (LP) methods to formulate the attribute discretization problem. The LP formulation allows the discretization criterion and the number of intervals to be integral considerations of the problem. We conduct experiments and identify optimal solutions for various discretization criteria and numbers of intervals.

Suggested Citation

  • N Bryson & A Joseph, 2001. "Optimal techniques for class-dependent attribute discretization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(10), pages 1130-1143, October.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:10:d:10.1057_palgrave.jors.2601174
    DOI: 10.1057/palgrave.jors.2601174
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601174
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601174?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. K-M Osei-Bryson & K Giles & B Kositanurit, 2003. "Exploration of a hybrid feature selection algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(7), pages 790-797, July.
    2. R Fildes & K Nikolopoulos & S F Crone & A A Syntetos, 2008. "Forecasting and operational research: a review," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1150-1172, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:52:y:2001:i:10:d:10.1057_palgrave.jors.2601174. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.