IDEAS home Printed from https://ideas.repec.org/a/igg/jissc0/v3y2012i1p56-74.html
   My bibliography  Save this article

Maximal Pattern Mining Using Fast CP-Tree for Knowledge Discovery

Author

Listed:
  • R. Vishnu Priya

    (National Institute of Technology, Tiruchirappalli, India)

  • A.Vadivel

    (National Institute of Technology, Tiruchirappalli, India)

  • R. S. Thakur

    (Maulana Azad National Institute of Technology, Bhopal, India)

Abstract

The knowledge discovery from large database is useful for decision making in industry real-time problems. Given a large voluminous transaction database, the knowledge is discovered by extracting maximal pattern after some analysis. Various methods have been proposed for extracting maximal pattern including FP and CP trees. It has been noticed that time taken by these methods for mining is found to be large. This paper modifies tree construction strategy of CP-tree for mining maximal pattern and the strategy takes less time for mining. The proposed modified CP-tree is constructed in two phases. The first phase constructs the tree based on user given item order along with its corresponding item list. In the second phase, each node in the branch of the constructed tree is dynamically rearranged based on item sorted list. The maximal patterns are retrieved from the proposed tree using the FPmax algorithm. The proposed tree has been built to support both interactive and incremental mining. The performance is evaluated using both dense and sparse bench mark data sets such as CHESS, MUSHROOM, CONNECT-4, PUMSB, and RETAIL respectively. The performance of the modified CP-tree is encouraging compared to some of the recently proposed approaches.

Suggested Citation

  • R. Vishnu Priya & A.Vadivel & R. S. Thakur, 2012. "Maximal Pattern Mining Using Fast CP-Tree for Knowledge Discovery," International Journal of Information Systems and Social Change (IJISSC), IGI Global, vol. 3(1), pages 56-74, January.
  • Handle: RePEc:igg:jissc0:v:3:y:2012:i:1:p:56-74
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jissc.2012010106
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jissc0:v:3:y:2012:i:1:p:56-74. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.