An efficient hierarchical clustering model for grouping web transactions
by Darenna Syahida Suib, Mustafa Mat Deris
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 3, No. 2, 2008

Abstract: Clustering is one of the techniques used to obtain useful information from web log file for better understanding of customer behaviour. Two clustering techniques that commonly used are Greedy Hierarchical Item Set-Based Clustering (GHIC) algorithm and Hierarchical Clustering Algorithm (HCA). The algorithms, however, have its weaknesses in terms of processing times and time complexity. This paper proposes a new approach called Hierarchical Pattern-Based Clustering (HPBC) algorithm to improve the processing times based on the difference of mean support values of each cluster. The simulation revealed that the proposed algorithm outperformed the HCA and GHIC up to 100% and 50% respectively, with less time complexity.

Online publication date: Sun, 28-Sep-2008

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 Intelligence and Data Mining (IJBIDM):
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 subs@inderscience.com