Towards personalized recommendation by two-step modified Apriori data mining algorithm

被引:55
作者
Lazcorreta, Enrique [3 ,4 ]
Botella, Federico [3 ,4 ]
Fernandez-Caballero, Antonio [1 ,2 ]
机构
[1] Univ Castilla La Mancha, Escuela Politecn Super Albacete, Dept Sistemas Informat, Albacete 02071, Spain
[2] Univ Castilla La Mancha, Escuela Politecn Super Albacete, Inst Invest Informat Albacete 13A, Albacete 02071, Spain
[3] Univ Miguel Hernandez Elche, Inst Univ, CIO, Elche 03202, Spain
[4] Univ Miguel Hernandez Elche, Dept Estadist Matemat & Informat, Elche 03202, Spain
关键词
personalization; data mining; Apriori-like algorithm; recommendation;
D O I
10.1016/j.eswa.2007.08.048
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper a new method towards automatic personalized recommendation based on the behavior of a single user in accordance with all other users in web-based information systems is introduced. The proposal applies a modified version of the well-known Apriori data mining algorithm to the log files of a web site (primarily, an e-commerce or an e-learning site) to help the users to the selection of the best user-tailored links. The paper mainly analyzes the process of discovering association rules in this kind of big repositories and of transforming them into user-adapted recommendations by the two-step modified Apriori technique, which may be described as follows. A first pass of the modified Apriori algorithm verifies the existence of association rules in order to obtain a new repository of transactions that reflect the observed rules. A second pass of the proposed Apriori mechanism aims in discovering the rules that are really inter-associated. This way the behavior of a user is not determined by "what he does" but by "how he does". Furthermore, an efficient implementation has been performed to obtain results in real-time. As soon as a user closes his session in the web system, all data are recalculated to take the recent interaction into account for the next recommendations. Early results have shown that it is possible to run this model in web sites of medium size. (C) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1422 / 1429
页数:8
相关论文
共 22 条
  • [1] Agrawal R., 1994, P 20 INT C VER LARG, V1215, P407
  • [2] E-commerce recommendation applications
    Ben Schafer, J
    Konstan, JA
    Riedl, J
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2001, 5 (1-2) : 115 - 153
  • [3] A personalized recommender system based on web usage mining and decision tree induction
    Cho, YH
    Kim, JK
    Kim, SH
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2002, 23 (03) : 329 - 342
  • [4] BitTableFI: An efficient mining frequent itemsets algorithm
    Dong, Jie
    Han, Min
    [J]. KNOWLEDGE-BASED SYSTEMS, 2007, 20 (04) : 329 - 335
  • [5] Han J., 2012, Data Mining, P393, DOI [DOI 10.1016/B978-0-12-381479-1.00009-5, 10.1016/B978-0-12-381479-1.00001-0]
  • [6] A fuzzy AprioriTid mining algorithm with reduced computational time
    Honga, TP
    Kuo, CS
    Wang, SL
    [J]. APPLIED SOFT COMPUTING, 2004, 5 (01) : 1 - 10
  • [7] Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism
    Hu, Ya-Han
    Chen, Yen-Liang
    [J]. DECISION SUPPORT SYSTEMS, 2006, 42 (01) : 1 - 24
  • [8] Personalized mining of web documents using link structures and fuzzy concept networks
    Kim, Kyung-Joong
    Cho, Sung-Bae
    [J]. APPLIED SOFT COMPUTING, 2007, 7 (01) : 398 - 410
  • [9] Using information retrieval techniques for supporting data mining
    Kouris, IN
    Makris, CH
    Tsakalidis, AK
    [J]. DATA & KNOWLEDGE ENGINEERING, 2005, 52 (03) : 353 - 383
  • [10] Mining association rules with multiple minimum supports using maximum constraints
    Lee, YC
    Hong, TP
    Lin, WY
    [J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2005, 40 (1-2) : 44 - 54