Scalable Multi-Relational Association Mining
| Contribuinte(s) |
Department of Computer Science Bioinformatics and Computational Biology Group |
|---|---|
| Data(s) |
24/04/2006
24/04/2006
2004
|
| Resumo |
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. 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. Non peer reviewed |
| Identificador |
Clare , A , Williams , H E & Lester , N 2004 , ' Scalable Multi-Relational Association Mining ' . PURE: 68027 PURE UUID: 0b407b95-e69c-407f-9675-a60d9c76cdfc dspace: 2160/127 |
| Idioma(s) |
eng |
| Tipo |
/dk/atira/pure/researchoutput/researchoutputtypes/contributiontoconference/paper Conference paper |
| Direitos |
