.png){kind=icon}
Return
NP-miner: A real-time recommendation algorithm by using web usage mining
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2006.04.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Web usage mining is widely applied in various areas, and dynamic recommendation is one web usage mining application. However, most of the current recommendation mechanisms need to generate all association rules before recommendations. This takes lots of time in offline computation, and cannot provide real-time recommendations for online users. This study proposes a Navigational Pattern Tree structure for storing the web accessing information. Besides, the Navigational Pattern Tree supports incremental growth for immediately modeling web usage behavior. To provide real-time recommendations efficiently, we develop a Navigational Pattern mining (NP-miner) algorithm for discovering frequent sequential patterns on the proposed Navigational Pattern Tree. According to historical patterns, the NP-miner scans relevant sub-trees of the Navigational Pattern Tree repeatedly for generating candidate recommendations. The experiments study the performance of the NP-miner algorithm through synthetic datasets from real applications. The results show that the NP-miner algorithm can efficiently perform online dynamic recommendation in a stable manner. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
incremental mining
real-time recommendations
sequential mining
web usage mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
ShareSaveShareSave
ShareSaveShareSaveMining skewed and sparse transaction data for personalized shopping recommendation.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAIShareSave
View more