Query flocks: a generalization of association-rule mining

Get BibTex-formatted data

Download

PDF

Author

Christopher Clifton

Tech report number

CERIAS TR 2001-89

Entry type

conference

Abstract

Association-rule mining has proved a highly successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the objectives, but to the fact that a number of new query-optimization ideas, such as the â€œa-prioriâ€ trick, make association-rule mining run much faster than might be expected. In this paper we see that the same tricks can be extended to a much more general context, allowing efficient mining of very large databases for many different kinds of patterns. The general idea, called â€œquery flocks,â€ is a generate-and-test model for data-mining problems. We show how the idea can be used either in a general-purpose mining system or in a next generation of conventional query optimizers.

Download

PDF

Date

1998 – 06

URL

http://portal.acm.org/citation.cfm?doid=276304.276306

Key alpha

Clifton

Note

Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data June 1-4, 1998 in Seattle, WA Also in SIGMOD eproceedings (postscript)

Publication Date

2001-06-01

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Conference{ Clifton,
	title = "Query flocks: a generalization of association-rule mining",
	author = "Christopher Clifton",
	year = "1998",
	month = "06",
	note = "Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data
June 1-4, 1998 in Seattle, WA
Also in SIGMOD eproceedings (postscript)",
	abstract = "Association-rule mining has proved a highly successful technique for extracting useful information from very large databases. This success is attributed not only to the appropriateness of the objectives, but to the fact that a number of new query-optimization ideas, such as the â€œa-prioriâ€ trick, make association-rule mining run much faster than might be expected. In this paper we see that the same tricks can be extended to a much more general context, allowing efficient mining of very large databases for many different kinds of patterns. The general idea, called â€œquery flocks,â€ is a generate-and-test model for data-mining problems. We show how the idea can be used either in a general-purpose mining system or in a next generation of conventional query optimizers.",
	url = "http://portal.acm.org/citation.cfm?doid=276304.276306",
}