IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

An Efficient Approach for Candidate Set Generation

Listed author(s):
  • 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)

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by World Scientific Publishing Co. Pte. Ltd. in its journal Journal of Information & Knowledge Management.

    Volume (Year): 04 (2005)
    Issue (Month): 04 ()
    Pages: 287-291

    in new window

    Handle: RePEc:wsi:jikmxx:v:04:y:2005:i:04:p:287-291
    Contact details of provider: Web page:

    Order Information: Email:

    No references listed on IDEAS
    You can help add them by filling out this form.

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:wsi:jikmxx:v:04:y:2005:i:04:p:287-291. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.