"Web mining can be broadly defined as the discovery and analysis of useful information from the World Wide Web. This broad definition bifurcates into two branches, the first, describes the automatic search and retrieval of information and resources available from millions of sites and on-line databases, i.e., Web content mining. The second branch explains the discovery and analysis of user access patterns from Web usage data, i.e., Web usage mining. User Clustering analysis allows one to group together clients or data items that have similar characteristics.
In this thesis, a method for the clustering of the Web usage sessions based on access patterns is proposed. Access patterns of the Web users are extracted from Web servers' log files, and then organized into sessions which represent episodes of interaction between Web users and the Web server. Using Attributed-Oriented-Induction, the sessions are then generalized according to a page hierarchy that organizes pages according to their generalities. The generalized sessions are finally clustered using existing hierarchical clustering method, BIRCH (Balanced Iterative Reducing and Clustering using Hierarchies) enhanced with Beam Search. Our experiments on a large real data set show that the method is efficient and practical for Web mining applications"--Abstract, page iii.
Dekock, Arlan R.
Kluczny, Raymond Michael
M.S. in Computer Science
University of Missouri--Rolla
viii, 42 pages
© 2000 Kanwalpreet Singh Sandhu, All rights reserved.
Thesis - Restricted Access
Print OCLC #
Electronic OCLC #
Link to Catalog Record
Electronic access to the full-text of this document is restricted to Missouri S&T users. Otherwise, request this publication directly from Missouri S&T Library or contact your local library.http://merlin.lib.umsystem.edu/record=b4444263~S5
Sandhu, Kanwalpreet Singh, "A clustering method for Web usage mining" (2000). Masters Theses. 4402.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.