Scalable multi-relational association mining

Clare, A, Williams, H and Lester, N 2004, 'Scalable multi-relational association mining', in Proceedings of the Fourth IEEE International Conference on Data Mining, Brighton, United Kingdom, 1-4 November 2004, pp. 355-358.


Document type: Conference Paper
Collection: Conference Papers

Title Scalable multi-relational association mining
Author(s) Clare, A
Williams, H
Lester, N
Year 2004
Conference name International Conference on Data Mining
Conference location Brighton, United Kingdom
Conference dates 1-4 November 2004
Proceedings title Proceedings of the Fourth IEEE International Conference on Data Mining
Publisher IEEE
Place of publication California, America
Start page 355
End page 358
Abstract We propose the new RADAR technique for multirelational 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.
Subjects Information and Computing Sciences not elsewhere classified
Keyword(s) Multi-relational data mining
Association mining algorithms
Scalability
Efficiency
DOI - identifier 10.1109/ICDM.2004.10035
Copyright notice ©2004 IEEE Computer Society
Versions
Version Filter Type
Altmetric details:
Access Statistics: 197 Abstract Views  -  Detailed Statistics
Created: Tue, 17 Aug 2010, 08:50:52 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us