loading...
Efficient Relationship Pattern Mining Using Multi-Relational Iceberg-Cubes
Brighton, United Kingdom November 01-November 04
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2004.10059Fourth IEEE International Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dawit Yimam Seid, University of California, Irvine
Sharad Mehrotra, University of California, Irvine
Multi-relational data mining(MRDM) is concerned with data that contains heterogeneous and semantically rich relationships among various entity types. In this paper, we introduce multi-relational iceberg-cubes (MRI-Cubes) as a scalable approach to efficiently compute data cubes (aggregations) over multiple database relations and, in particular, as mechanisms to compute frequent multi-relational patterns ("itemsets"). We also present a summary of performance results of our algorithm.
Citation:
Dawit Yimam Seid, Sharad Mehrotra, "Efficient Relationship Pattern Mining Using Multi-Relational Iceberg-Cubes," icdm, pp.515-518, Fourth IEEE International Conference on Data Mining (ICDM'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.