A scalable association rule learning and recommendation algorithm for large-scale microarray datasets

5Citations
Citations of this article
33Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Association rule learning algorithms have been applied to microarray datasets to find association rules among genes. With the development of microarray technology, larger datasets have been generated recently that challenge the current association rule learning algorithms. Specifically, the large number of items per transaction significantly increases the running time and memory consumption of such tasks. In this paper, we propose the Scalable Association Rule Learning (SARL) heuristic that efficiently learns gene-disease association rules and gene–gene association rules from large-scale microarray datasets. The rules are ranked based on their importance. Our experiments show the SARL algorithm outperforms the Apriori algorithm by one to three orders of magnitude.

References Powered by Scopus

Mining frequent patterns without candidate generation

5574Citations
385Readers
Get full text
3782Citations
688Readers
Get full text
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Li, H., & Sheu, P. C. Y. (2022). A scalable association rule learning and recommendation algorithm for large-scale microarray datasets. Journal of Big Data, 9(1). https://doi.org/10.1186/s40537-022-00577-4

Readers over time

‘22‘23‘24‘2505101520

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 6

86%

Lecturer / Post doc 1

14%

Readers' Discipline

Tooltip

Computer Science 6

60%

Agricultural and Biological Sciences 2

20%

Economics, Econometrics and Finance 1

10%

Engineering 1

10%

Article Metrics

Tooltip
Mentions
References: 1
Social Media
Shares, Likes & Comments: 1

Save time finding and organizing research with Mendeley

Sign up for free
0