Scalable Multi-Relational Association Mining

Authors:
Amanda Clare;Hugh E. Williams;Nicholas Lester
Affiliations:
University of Wales Aberystwyth, UK;RMIT University, Melbourne, Australia;RMIT University, Melbourne, Australia
Venue:
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Year:
2004

Citing 0
Cited 3

Mining Chains of Relations

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Estudo de caso de mineração de dados multi-relacional: aplicação do algoritmo connetionblock em um problema da agroindústria

SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets

Intelligent Data Analysis - Ubiquitous Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose the new RADAR technique for multi-relational data mining. This permits the mining of very large collections and provides a new technique for discovering multi-relational associations. Results show that RADAR is reliable and scalable for mining a large yeast homology collection, and that it does not have the main-memory scalability constraints of the Farmer and Warmr tools.