The World-Wide Web: quagmire or gold mine?
Communications of the ACM
On-line hierarchical clustering
Pattern Recognition Letters
Towards adaptive Web sites: conceptual framework and case study
Artificial Intelligence - Special issue on Intelligent internet systems
Data Mining: Introductory and Advanced Topics
Data Mining: Introductory and Advanced Topics
Clustering by pattern similarity in large data sets
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
E-Commerce Recommendation Applications
Data Mining and Knowledge Discovery
COMPSAC '00 24th International Computer Software and Applications Conference
A hierarchical clustering algorithm for categorical sequence data
Information Processing Letters
Intelligent web traffic mining and analysis
Journal of Network and Computer Applications - Special issue on computational intelligence on the internet
Mining interesting knowledge from weblogs: a survey
Data & Knowledge Engineering
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
GHIC: A Hierarchical Pattern-Based Clustering Algorithm for Grouping Web Transactions
IEEE Transactions on Knowledge and Data Engineering
Mining web browsing patterns for E-commerce
Computers in Industry
Personalised online sales using web usage data mining
Computers in Industry
Constrained co-clustering with non-negative matrix factorisation
International Journal of Business Intelligence and Data Mining
Hi-index | 0.00 |
Clustering is one of the techniques used to obtain usefulinformation from web log file for better understanding of customerbehaviour. Two clustering techniques that commonly used are GreedyHierarchical Item Set-Based Clustering (GHIC) algorithm andHierarchical Clustering Algorithm (HCA). The algorithms, however,have its weaknesses in terms of processing times and timecomplexity. This paper proposes a new approach called HierarchicalPattern-Based Clustering (HPBC) algorithm to improve the processingtimes based on the difference of mean support values of eachcluster. The simulation revealed that the proposed algorithmoutperformed the HCA and GHIC up to 100% and 50% respectively, withless time complexity.