Proceedings of the 5th ACM International Workshop on Web Information and Data Management 2003
DOI: 10.1145/956699.956716
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of web usage mining approaches for user's next request prediction

Abstract: Analysis of Web server logs is one of the important challenge to provide Web intelligent services.In this paper, we describe a framework for a recommender system that predicts the user's next requests based on their behaviour discovered from Web Logs data. We compare results from three usage mining approaches: association rules, sequential rules and generalised sequential rules. We use two selection rules criteria: highest confidence and lastsubsequence. Experiments are performed on three collections of real u… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 71 publications
(36 citation statements)
references
References 20 publications
0
36
0
Order By: Relevance
“…A session S is the bag of all pages p i visited by a user u in the same browser tab for a time period of up to 25.5 minutes ( [8,17]), placed in chronological order, from the earliest to the latest one: S = {p 1 , p 2 , . .…”
Section: Propagation Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…A session S is the bag of all pages p i visited by a user u in the same browser tab for a time period of up to 25.5 minutes ( [8,17]), placed in chronological order, from the earliest to the latest one: S = {p 1 , p 2 , . .…”
Section: Propagation Methodsmentioning
confidence: 99%
“…Sequence mining techniques constitute a variation of this approach, in the sense that they do not consider the strict order between items [2,15]. A comparison of these techniques with AR was conducted by Géry and Haddad [8], with the outcomes of their evaluation suggesting that Frequent Sequence Mining has the best performance. Nevertheless, all these methods still suffer from the inability to predict/recommend unseen items (i.e., not included in the training set, typically due to concept drift).…”
Section: Related Workmentioning
confidence: 99%
“…In the typical, item-to-item approach to recommendation based on association rules, ranking lists are created from the entire set of direct rules d i →d j that exceed minimum confidence and minimum support level (Chun et al, 2005;Géry and Haddad, 2003). The pages d j from all rules d i →d j outgoing from d i are considered at the creation of recommendation ranking lists for the page d i .…”
Section: Ranking Lists Based On Complex Rulesmentioning
confidence: 99%
“…In another approach to recommendation, the system retains user profiles or any other kind of historical or recent information related directly to the particular user. Based on these data, we can personalize recommendations according to either past (Adomavicius and Tuzhilin, 2001;Cho et al, 2002) or present user activities Géry and Haddad, 2003). Nevertheless, in this paper we focus only on non-user-sensitive recommendations, which enable us to create a static list of preferred pages individually for each web page.…”
Section: Recommendation Ranking Vs Existing Hyperlinksmentioning
confidence: 99%
See 1 more Smart Citation