Show simple item record Clare, Amanda Williams, Hugh E. Lester, Nicholas 2006-04-24T15:16:38Z 2006-04-24T15:16:38Z 2004
dc.identifier.citation Clare , A , Williams , H E & Lester , N 2004 , ' Scalable Multi-Relational Association Mining ' . en
dc.identifier.other PURE: 68027
dc.identifier.other PURE UUID: 0b407b95-e69c-407f-9675-a60d9c76cdfc
dc.identifier.other dspace: 2160/127
dc.identifier.other DSpace_20121128.csv: row: 102
dc.identifier.other Scopus: 19544393715
dc.description Clare, A., Williams, H. E. and Lester, N. M. (2004) Scalable Multi-Relational Association Mining. In proceedings of the 4th International Conference on Data Mining ICDM '04. en
dc.description.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. en
dc.language.iso eng
dc.rights en
dc.title Scalable Multi-Relational Association Mining en
dc.type /dk/atira/pure/researchoutput/researchoutputtypes/contributiontoconference/paper en
dc.contributor.institution Department of Computer Science en
dc.contributor.institution Bioinformatics and Computational Biology Group en
dc.description.status Non peer reviewed en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Cadair

Advanced Search