IDEAS home Printed from https://ideas.repec.org/a/ids/ijdmmm/v2y2010i2p176-193.html
   My bibliography  Save this article

eWAP-mine: enhanced mining algorithm to mine web access pattern from WAP-tree

Author

Listed:
  • Ratnesh K. Jain
  • Ramveer S. Kasana
  • Deepak Kumar Sahu
  • Suresh Jain

Abstract

As the information available on the World Wide Web is increasing day-by-day, access to the websites is also increasing which results in huge amount of web log data (also called web usage data). Discovery and analysis of useful information from these web logs become a practical necessity. Frequent access pattern, which is the sequence of accesses pursued by users frequently, is one of the interesting and useful knowledge in practice. Web access pattern tree (WAP-tree) mining is a frequent pattern mining technique for web log access sequences, which first stores the original web access sequence database on a prefix tree for storing non-sequential data. WAP-tree algorithm then, mines the frequent sequences from the WAP-tree by recursively reconstructing intermediate trees, starting with suffix sequences and ending with prefix sequences. In this paper, we propose a more efficient algorithm named eWAP-mine (enhanced web access pattern mining algorithm), which is based directly on the initial conditional web access sequence base (1-CWASD) of each frequent event and eliminates the need for reconstructing intermediate conditional WAP-trees.

Suggested Citation

  • Ratnesh K. Jain & Ramveer S. Kasana & Deepak Kumar Sahu & Suresh Jain, 2010. "eWAP-mine: enhanced mining algorithm to mine web access pattern from WAP-tree," International Journal of Data Mining, Modelling and Management, Inderscience Enterprises Ltd, vol. 2(2), pages 176-193.
  • Handle: RePEc:ids:ijdmmm:v:2:y:2010:i:2:p:176-193
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=32147
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijdmmm:v:2:y:2010:i:2:p:176-193. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=342 .

    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.