Sequence clustering approach for clustering web user session
by Pradeep Kumar
International Journal of Business Information Systems (IJBIS), Vol. 28, No. 1, 2018

Abstract: Clustering web usage data is useful to discover interesting patterns pertaining to user traversals, behaviour and their usage characteristics. It is also useful for trend discovery as well as for building personalisation and recommendation engines. Since web is dynamic, clustering web user transactions results in arbitrary shapes. Moreover, users accesses web pages in an order in which they are interested and hence incorporating sequence nature of their usage is crucial for clustering web transactions. In this paper, we present an approach to cluster web usage sequence data and removing noise using DBSCAN algorithm. We also study the impact of clustering process when both sequence and content information is incorporated while computing similarity measure. We use sequence and set similarity (S3M) measure to capture both the order of occurrence of page visits and the page information itself, and compared the results with Euclidean distance and Jaccard similarity measures. The inter-cluster and intra-cluster distances are computed using average Levensthein distance (ALD) to demonstrate the usefulness of the proposed approach in the context of web usage mining.

Online publication date: Fri, 13-Apr-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Information Systems (IJBIS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email