Discovery of Association Rules in Tabular Data

G. Richards; V. J Rayward-Smith

doi:10.1109/ICDM.2001.989553

I
ICDM
2001
First IEEE International Conference on Data Mining (ICDM'01)
Abstract - Discovery of Association Rules in Tabular Data

	This Article
	Subscribers, please Login Purchase article: $19 PDF 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 G. Richards Articles by V. J Rayward-Smith

First IEEE International Conference on Data Mining (ICDM'01)

Discovery of Association Rules in Tabular Data

San Jose, California

November 29-December 02

ISBN: 0-7695-1119-8

	ASCII Text	x
	G. Richards, V. J Rayward-Smith, "Discovery of Association Rules in Tabular Data," Data Mining, IEEE International Conference on, pp. 465, First IEEE International Conference on Data Mining (ICDM'01), 2001.

	BibTex	x
	@article{ 10.1109/ICDM.2001.989553, author = {G. Richards and V. J Rayward-Smith}, title = {Discovery of Association Rules in Tabular Data}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2001}, isbn = {0-7695-1119-8}, pages = {465}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2001.989553}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - Discovery of Association Rules in Tabular Data SN - 0-7695-1119-8 SP EP A1 - G. Richards, A1 - V. J Rayward-Smith, PY - 2001 VL - 0 JA - Data Mining, IEEE International Conference on ER -

G. Richards

V. J Rayward-Smith

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

In this paper we address the problem of finding all association rules in tabular data. An Algorithm, ARA, for finding rules, that satisfy clearly specified constraints, in tabular data is presented. ARA is based on the Dense Miner algorithm but includes an additional constraint and an improved method of calculating support. ARA is tested and compared with our implementation of Dense Miner ;it is conclude that ARA is usually more efficient than Dense Miner and is often considerably more so.

We also consider the potential for modifying the constraints used in ARA in order to find more general rules.

Citation:

G. Richards, V. J Rayward-Smith, "Discovery of Association Rules in Tabular Data," icdm, pp.465, First IEEE International Conference on Data Mining (ICDM'01), 2001

Peer Review Notice | Give Us Feedback

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