MRAR : mining multi-relation association rules

Ramezani, R, Saraee, MH ORCID: and Nematbakhsh, MA 2014, 'MRAR : mining multi-relation association rules' , Journal of Computing and Security, 1 (2) , pp. 133-158.

PDF - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0.

Download (2MB) | Preview


In this paper, we introduce a new class of association rules (ARs) named “Multi-Relation Association Rules” which in contrast to primitive ARs (that are usually extracted from multi-relational databases), each rule item consists of one entity and several relations. These relations indicate indirect relationship between entities. Consider the following Multi-Relation Association Rule where the first item consists of three relations live in, nearby and humid: “Those who live in a place which is near by a city with humid climate type and also are younger than 20 their health condition is good”. A new algorithm called MRAR is proposed to extract such rules from directed graphs with labeled edges which are constructed from RDBMSs or semantic web data. Also, the question “how to convert RDBMS data or semantic web data to a directed graph with labeled edges?” is answered. In order to evaluate the proposed algorithm, some experiments are performed on a sample dataset and also a real-world drug semantic web dataset. Obtained results confirm the ability of the proposed algorithm in mining Multi-Relation Association Rules.

Item Type: Article
Schools: Schools > School of Computing, Science and Engineering > Salford Innovation Research Centre
Journal or Publication Title: Journal of Computing and Security
Publisher: University of Isfahan and Iranian Society of Cryptology
ISSN: 2322-4460
Related URLs:
Depositing User: Prof. Mo Saraee
Date Deposited: 05 Jun 2017 13:00
Last Modified: 15 Feb 2022 22:05

Actions (login required)

Edit record (repository staff only) Edit record (repository staff only)


Downloads per month over past year