Skip to main content
Article thumbnail
Location of Repository

An average linear time algorithm for web data mining

By J. Borges and Mark Levene

Abstract

In this paper, we study the complexity of a data mining algorithm for extracting patterns from user web navigation data that was proposed in previous work.3 The user web navigation sessions are inferred from log data and modeled as a Markov chain. The chain's higher probability trails correspond to the preferred trails on the web site. The algorithm implements a depth-first search that scans the Markov chain for the high probability trails. We show that the average behaviour of the algorithm is linear time in the number of web pages accessed

Topics: csis
Publisher: World Scientific Publishing
Year: 2004
OAI identifier: oai:eprints.bbk.ac.uk.oai2:213
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://eprints.bbk.ac.uk/213/1... (external link)
  • http://dx.doi.org/10.1142/S021... (external link)
  • Suggested articles

    Citations

    1. (2000). A Data Mining Model to Capture User Web Navigation. doi
    2. (2000). A fine grained heuristic to capture web navigation patterns. doi
    3. (2000). A heuristic to capture longer user web navigation patterns. doi
    4. (2002). A new markov model for web access prediction. doi
    5. (2003). Computing the entropy of user navigation in the web. doi
    6. (2001). Data mining for measuring and improving the success of web sites. doi
    7. (2000). Data mining of user navigation patterns. doi
    8. (1972). Depth-¯rst search and linear graph algorithms. doi
    9. (1972). Depth-first search and linear graph algorithms. doi
    10. (1960). Finite Markov Chains. doi
    11. (2000). Link prediction and path analysis using markov chains. doi
    12. (2001). Measuring the accuracy of sessionizers for web usage analysis.
    13. (1999). Mining longest repeating subsequences to predict world wide web sur¯ng. doi
    14. (1999). Mining longest repeating subsequences to predict world wide web surfing. doi
    15. (2001). Selective markov models for predicting web-page accesses. doi
    16. (2002). Using sequential and non-sequential patterns for predictive web usage mining 21tasks. doi
    17. (2002). Using sequential and non-sequential patterns for predictive web usage mining tasks. doi
    18. (2000). Visualization of navigation patterns on a web site using model based clustering. doi
    19. (2000). Web usage mining: Discovery and applications of usage patterns from web data. doi

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.