Affiliation:
1. Laboratoire ERIC, Université Lyon 2, Lyon, France
Abstract
This paper describes a new personalization process for decisional queries through a new approach based on triadic association rules mining. This process exploits the decision query log files of end users and follows these five steps: (1) generation of a triadic context from the multidimensional query logs of OLAP1 query analysis server; (2) mapping the triadic context into the dyadic one; (3) computation of (conventional) dyadic association rules; (4) generation of triadic association rules through a factorization process of dyadic ones and convey a richer semantics. The aim of the personalization approach which is based on triadic rules is to recommend new decision queries to OLAP end users sharing some common properties. This paper aims at helping this class of users by recommending them personalized OLAP queries that they might use in their future OLAP sessions. To validate the approach, the authors developed a software prototype called P-TRIAR (Personalization based on TRIadic Association Rules) which extracts two types of triadic association rules from decision query log files. The first type of triadic rules will serve to the recommending queries by taking the collaborative aspect of OLAP users into account. The second type of triadic rules will enrich user queries. Preliminary experiments were conducted on both real and synthetic datasets to assess the quality of the recommendations in term of precision and recall measures, as well as the performance of their on-line computation.
Subject
Modeling and Simulation,General Computer Science
Reference27 articles.
1. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. Knowledge and Data Engineering;G.Adomavicius;IEEE Transactions on,2005
2. Fast algorithms for mining association rules.;R.Agrawal;Proc. 20th int. conf. very large data bases, vldb,1994
3. Closed and noise-tolerant patterns in n-ary relations
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献