Towards Collaborative Multidimensional Query Recommendation with Triadic Association Rules

Author:

Selmane Sid Ali1,Boussaid Omar1,Bentayeb Fadila1

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.

Publisher

IGI Global

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篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Research on MOOC Teaching Mode in Higher Education Based on Deep Learning;Computational Intelligence and Neuroscience;2022-01-29

2. Approach of Modelization and Management on Software Components;Technological Innovations in Knowledge Management and Decision Support;2019

3. Research on Personalized Recommendation of Smart Phones Applications Based on Association Rules and Collaborative Filtering Algorithms;Proceedings of the Twelfth International Conference on Management Science and Engineering Management;2018-06-26

4. OLAP4R: A Top-K Recommendation System for OLAP Sessions;KSII Transactions on Internet and Information Systems;2017-06-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3