ebooks logo journals logo reference works logo abstract databases logo
bullet  SIGN IN Register | Why Register? | Got a Voucher? alerts   marked lists   shopping cart 

informaworld

HOME   |   SEARCH   |   BROWSE
    Issues List       Latest Issue       Forthcoming Articles       Volume 22 Issue 6       Subscribe       Article       References       Related articles      
<< firstfirst   < prevprev   Table of contentstoc   next >next   last >>last
Publisher Logo Publication Cover
Search within this journal

Relation rule mining 

Authors: Mehdi Adda a;  Rokia Missaoui - b; Petko Valtchev - a
Affiliations:   a DIRO Universiteacute de Montreacuteal, Montreacuteal, Canada
b Deacutepartement d'informatique et d'ingeacutenierie, Outaouais, UQO, Canada
DOI: 10.1080/17445760701207850
Publication Frequency: 6 issues per year
Published in: journal International Journal of Parallel, Emergent and Distributed Systems, Volume 22, Issue 6 January 2007 , pages 439 - 449
Formats available: HTML (English) : PDF (English)
Previously published as: Parallel Algorithms and Applications (1063-7192) until 2005
Article Requests: Order Reprints : Request Permissions


Abstract

Relationships between objects constitute an important component of domain knowledge and represent an added value to data and knowledge discovery and management. Some existing studies in data mining (including association rule mining) exploit domain knowledge to better conduct tasks in applications such as e-learning and e-commerce. However, general semantic links between objects are either not exploited in the mining process or limited to is-a relations.

In this paper we present the basis of a new approach where direct and indirect domain relations between items (basket market analysis) are used to reveal hidden knowledge in item transactions. First, we define the notion of relation association rule as an association that holds between sequences of relations. Such a type of rules is produced from item transactions and existing links among items in a given domain ontology. Then, we define an a priori-based algorithm for relation association rule mining. Finally, we illustrate the potential of our approach for recommendation purposes.
Keywords: Data mining; Association rules; Ontology; Relationships
view references (22)
Bookmark with:
  • CiteULike
  • Del.icio.us
  • BibSonomy
  • Connotea
  • More bookmarks
Privacy Policy | Terms & Conditions | Accessibility | RSS
FAQs in: English . Français . Español . 中文(简体和繁體)
© 2009 Informa plc