Ruddle, R.A. (2006) Using string-matching to analyze hypertext navigation. In: Proceedings of the 17th ACM Conference on Hypertext and Hypermedia. Seventeenth Conference on Hypertext and Hypermedia, August 22 - 25, 2006, Odense, Denmark. ACM , New York, NY , pp. 49-52. ISBN 1-59593-417-0Full text available as:
Available under licence : See the attached licence file.
A method of using string-matching to analyze hypertext navigation was developed, and evaluated using two weeks of website logfile data. The method is divided into phases that use: (i) exact string-matching to calculate subsequences of links that were repeated in different navigation sessions (common trails through the website), and then (ii) inexact matching to find other similar sessions (a community of users with a similar interest). The evaluation showed how subsequences could be used to understand the information pathways users chose to follow within a website, and that exact and inexact matching provided complementary ways of identifying information that may have been of interest to a whole community of users, but which was only found by a minority. This illustrates how string-matching could be used to improve the structure of hypertext collections.
|Item Type:||Proceedings Paper|
|Copyright, Publisher and Additional Information:||Copyright © 2006 by the Association for Computing Machinery, Inc. (ACM). This is an author produced version of a paper published in Proceedings of the 17th ACM Conference on Hypertext and Hypermedia. Uploaded in accordance with the publisher's self-archiving policy.|
|Keywords:||Navigation, String-matching, Analysis.|
|Institution:||The University of Leeds|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)|
|Depositing User:||Mrs Yasmin Aziz|
|Date Deposited:||01 Dec 2008 15:18|
|Last Modified:||08 Feb 2013 17:05|