Efficient Relationship Pattern Mining Using Multi-Relational Iceberg-Cubes

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Dawit Yimam Seid Articles by Sharad Mehrotra

Fourth IEEE International Conference on Data Mining (ICDM'04)

Brighton, United Kingdom

November 01-November 04

ISBN: 0-7695-2142-8

	ASCII Text	x
	Dawit Yimam Seid, Sharad Mehrotra, "Efficient Relationship Pattern Mining Using Multi-Relational Iceberg-Cubes," Data Mining, IEEE International Conference on, pp. 515-518, Fourth IEEE International Conference on Data Mining (ICDM'04), 2004.

	BibTex	x
	@article{ 10.1109/ICDM.2004.10059, author = {Dawit Yimam Seid and Sharad Mehrotra}, title = {Efficient Relationship Pattern Mining Using Multi-Relational Iceberg-Cubes}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2004}, isbn = {0-7695-2142-8}, pages = {515-518}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2004.10059}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - Efficient Relationship Pattern Mining Using Multi-Relational Iceberg-Cubes SN - 0-7695-2142-8 SP515 EP518 A1 - Dawit Yimam Seid, A1 - Sharad Mehrotra, PY - 2004 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER -

Dawit Yimam Seid, University of California, Irvine

Sharad Mehrotra, University of California, Irvine

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2004.10059

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.