MRAR: MINING MULTI-RELATION ASSOCIATION RULES

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

RAMEZANI REZA; SARAEE MOHAMAD; NEMATBAKHSH MOHAMMAD ALI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTING AND SECURITY Year:2014 | Volume:1 | Issue:2 Page(s): 133-158

Download Full-Text

View:

271

Download:

Cites:

Information Journal Paper

Title

MRAR: MINING MULTI-RELATION ASSOCIATION RULES

Author(s)

RAMEZANI REZA | SARAEE MOHAMAD | NEMATBAKHSH MOHAMMAD ALI | Issue Writer Certificate

Keywords

DATA MINING

KNOWLEDGE DISCOVERY

ASSOCIATION RULES

MULTI-RELATION ASSOCIATION RULES

MRAR

COPULATIVE ENTITY

ENDPOINT ENTITY

ITEMCHAIN

Abstract

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 than20®their health condition is good". A new algorithm called MRARis 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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

RAMEZANI, REZA, SARAEE, MOHAMAD, & NEMATBAKHSH, MOHAMMAD ALI. (2014). MRAR: MINING MULTI-RELATION ASSOCIATION RULES. JOURNAL OF COMPUTING AND SECURITY, 1(2), 133-158. SID. https://sid.ir/paper/341646/en

Vancouver: Copy

RAMEZANI REZA, SARAEE MOHAMAD, NEMATBAKHSH MOHAMMAD ALI. MRAR: MINING MULTI-RELATION ASSOCIATION RULES. JOURNAL OF COMPUTING AND SECURITY[Internet]. 2014;1(2):133-158. Available from: https://sid.ir/paper/341646/en

IEEE: Copy

REZA RAMEZANI, MOHAMAD SARAEE, and MOHAMMAD ALI NEMATBAKHSH, “MRAR: MINING MULTI-RELATION ASSOCIATION RULES,” JOURNAL OF COMPUTING AND SECURITY, vol. 1, no. 2, pp. 133–158, 2014, [Online]. Available: https://sid.ir/paper/341646/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops