Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/20833
Title: Proposed Clustering Model Based On Sequential Rules In The Web Mining
Authors: HADJ-TAYEB, Karima
BELBACHIR, Hafida
Keywords: Web Usage Mining
Clustering Technique
Sequential patterns Technique
k-medoids algorithm
Sequential rules
Evaluation measures of clusters quality
Issue Date: 4-Mar-2019
Publisher: Université Kasdi Merbah Ouargla
Series/Report no.: 2019;
Abstract: The important growth of the pages contained in the website as well as the number of users navigating requires research tools that allow studying the behaviour of users in the Web Usage Mining. Among these tools, clusters analysis is considered as the most important technique in this area. Based on this technique, several methods have been developed; the most popular is the partitioning method. However, its principle, as it appears to be unsuitable for web data, represents a sequential data stream where the similarity notion must be taken into account when calculating the distance between objects. This paper attempts to overcome the limitations of this method and proposes a new user clustering model. The proposed approach is based on the extraction of sequential patterns along with the generated sequential rules. The experimental realization has been carried out by implementing the proposed algorithm and the k-medoids partitioning algorithm. This study is carried out with the aim of comparing the performance relative for each of them through a set of measures that help evaluate the quality of the generated clusters.
Description: Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019
URI: http://dspace.univ-ouargla.dz/jspui/handle/123456789/20833
Appears in Collections:2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:
File Description SizeFormat 
HADJ-TAYEB Karima.pdf337,11 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.