IDEAS home Printed from https://ideas.repec.org/a/wsi/jikmxx/v04y2005i04ns0219649205001249.html
   My bibliography  Save this article

An Efficient Approach for Candidate Set Generation

Author

Listed:
  • Nawar Malhis

    (Department of Computer Science, Kent State University, Kent, OH 44240, USA)

  • Arden Ruttan

    (Department of Computer Science, Kent State University, Kent, OH 44240, USA)

  • Hazem H. Refai

    (Department of Electrical and Computer Engineering, University of Oklahoma, Tulsa, OK 74135, USA)

Abstract

When Apriori was first introduced as an algorithm for discovering association rules in a database of market basket data, the problem of generating the candidate set of the large set was a bottleneck in Apriori's performance, both in space and computational requirements. At first, many unsuccessful attempts were made to improve the generation of a candidate set. Later, other algorithms that out performed Apriori were developed that generate association rules without using a candidate set. They used the counting property of association rules instead of generating the candidate set as Apriori does. However, the Apriori concept has been used in many different areas other than counting market basket items, and the candidate generation problem remains a bottleneck issue. The approach described here improves the overall time and space requirements by eliminating the need for a hash table/tree of formation for the candidate set.

Suggested Citation

  • Nawar Malhis & Arden Ruttan & Hazem H. Refai, 2005. "An Efficient Approach for Candidate Set Generation," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 4(04), pages 287-291.
    • Handle: RePEc:wsi:jikmxx:v:04:y:2005:i:04:n:s0219649205001249
    DOI: 10.1142/S0219649205001249
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219649205001249
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219649205001249?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.

    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:wsi:jikmxx:v:04:y:2005:i:04:n:s0219649205001249. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/jikm/jikm.shtml .

    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.