Interpretations of Association Rules by Granular Computing

I
ICDM
2003
Third IEEE International Conference on Data Mining (ICDM'03)
Abstract - Interpretations of Association Rules by Granular Computing

	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
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Yuefeng Li Articles by Ning Zhong

Third IEEE International Conference on Data Mining (ICDM'03)

Melbourne, Florida

November 19-November 22

ISBN: 0-7695-1978-4

	ASCII Text	x
	Yuefeng Li, Ning Zhong, "Interpretations of Association Rules by Granular Computing," Data Mining, IEEE International Conference on, pp. 593, Third IEEE International Conference on Data Mining (ICDM'03), 2003.

	BibTex	x
	@article{ 10.1109/ICDM.2003.1250985, author = {Yuefeng Li and Ning Zhong}, title = {Interpretations of Association Rules by Granular Computing}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1978-4}, pages = {593}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1250985}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - Interpretations of Association Rules by Granular Computing SN - 0-7695-1978-4 SP EP A1 - Yuefeng Li, A1 - Ning Zhong, PY - 2003 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER -

Yuefeng Li, Queensland University of Technology, Brisbane, Australia

Ning Zhong, Maebashi Institute of Technology, Japan

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

This paper presents interpretations for association rules. It first introduces Pawlak's method, and the corresponding algorithm of finding decision rules (a kind of association rules). It then uses extended random sets to present a new algorithm of finding interesting rules. It proves that the new algorithm is faster than Pawlak's algorithm. The extended random sets are easily to include more than one criterion for determining interesting rules. They also provide two measures for dealing with uncertainties in association rules.

Citation:

Yuefeng Li, Ning Zhong, "Interpretations of Association Rules by Granular Computing," icdm, pp.593, Third IEEE International Conference on Data Mining (ICDM'03), 2003

Peer Review Notice | Give Us Feedback

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