BIROn - Birkbeck Institutional Research Online

An average linear time algorithm for web data mining

Borges, J. and Levene, Mark (2004) An average linear time algorithm for web data mining. International Journal of Information Technology and Decision Making 3 (2), pp. 307-320. ISSN 0219-6220.

[img]
Preview
Text
borges_linear_time_hpg.pdf

Download (215Kb) | Preview
Official URL: http://dx.doi.org/10.1142/S0219622004001021

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.

Item Type: Article
Keyword(s) / Subject(s): Web usage mining, Markov chains, analysis of algorithms
School or Research Centre: Birkbeck Schools and Research Centres > School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User: Administrator
Date Deposited: 23 Aug 2005
Last Modified: 30 Aug 2013 09:14
URI: http://eprints.bbk.ac.uk/id/eprint/213

Archive Staff Only (login required)

Edit/View Item Edit/View Item