BGRT : une nouvelle base générique de règles d’association triadiques. Application à l’autocomplétion de requêtes dans les folksonomies

Trabelsi, Chiraz; Jelassi, Nader; Yahia, Sadok Ben

doi:10.3166/dn.15.1.101-124

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In what follows, we present our approach of triadic association rules mining based on formal definitions and illustrative examples. Several approaches for researching and analysing triadic concepts have emerged in the literature (Trabelsi et al, 2012), (Nguyen, 2012) and (Cerf et al, 2013) for n = 3. (Missaoui & Kwuida, 2011), propose an effective approach based on the triadic concept analysis for the extraction of triadic association rules.…”

Section: Our Proposed Approachmentioning

confidence: 99%

“…The work of (Missaoui & Kwuida, 2011) offers not only an approach to triadic association rules production but also procedures to extract triadic concepts and generators from dyadic ones. In (Trabelsi, Jelassi, & Yahia, 2012), the authors deal with the calculation of generators and triadic association rules. However, they provided a new definition of the latter which is different from that of (Missaoui & Kwuida, 2011), which, in turn, is based on the definition of Biedermann.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Towards Collaborative Multidimensional Query Recommendation with Triadic Association Rules

Selmane

Boussaïd

Bentayeb

2015

International Journal of Decision Support System Technology

View full text Add to dashboard Cite

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.

show abstract

Section: Our Proposed Approachmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Towards Collaborative Multidimensional Query Recommendation with Triadic Association Rules

Selmane

Boussaïd

Bentayeb

2015

International Journal of Decision Support System Technology

View full text Add to dashboard Cite

show abstract

P-TRIAR: Personalization Based on TRIadic Association Rules

Ali

Boussaïd

Bentayeb

2014

Advances in Databases and Information Systems

View full text Add to dashboard Cite

International audienceThis article describes a new personalization process on decisional queries through a new approach of triadic association rules mining. This process uses the query log files of users and models them in new way by taking into account their triadic aspect. To validate our approach, we developed a personalization software prototype P-TRIAR (Personalization based on TRIadic Association Rules) which extracts two types of rules from query log files. The first one will serve to query recommendation by taking into account the collaborative aspect of users during their decisional analysis. The second type of rules will enrich user queries. The approach is tested on a real data warehouse to show the compactness of triadic association rules and the refined personalization which we propose

show abstract

Approche interdisciplinaire des pratiques numériques d’appropriation musicale

Gaulie

Szmidt

Francfort

2017

Interfaces Numériques

View full text Add to dashboard Cite

Face au danger d’une perte définitive du corpus musical accessible en ligne, les auteurs proposent une méthode de recherche qui tienne compte du caractère inconstant du classement et du stockage pratiqués par l’usage des nouveaux supports numériques sonores. Le geste du nouveau collectionneur qui échange, transmet ou met en ligne de la musique est ici considéré comme source à part entière. En d’autres termes, il s’agit d’un changement de paradigme dans la pratique de la recherche qui tend à se déplacer vers le questionnement de départ défini par un/des expert/s et qui rend la source heuristique. L’objectif principal est de revenir à l’étude des représentations, non seulement comme des reflets plus ou moins fidèles d’un réel social (à l’état de traces ou du réel matériel), mais aussi comme des figures construites qui rendent le monde intelligible et qui apportent une jouissance esthétique.

show abstract

BGRT : une nouvelle base générique de règles d’association triadiques. Application à l’autocomplétion de requêtes dans les folksonomies

Cited by 3 publications

References 18 publications

Towards Collaborative Multidimensional Query Recommendation with Triadic Association Rules

Towards Collaborative Multidimensional Query Recommendation with Triadic Association Rules

P-TRIAR: Personalization Based on TRIadic Association Rules

Approche interdisciplinaire des pratiques numériques d’appropriation musicale

Contact Info

Product

Resources

About