Towards elimination of well known geographic patterns in spatial association rule mining

6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many spatial association rule mining algorithms have been developed to extract interesting patterns from large geographic databases. However, a large amount of knowledge explicitly represented in geographic database schemas has not been used to reduce the number of association rules. A significant number of well known dependences, explicitly represented by the database designer, are unnecessarily extracted by association rule mining algorithms. The result is the generation of hundreds or thousands of well known spatial association rules. This paper presents an approach for mining spatial association rules where both database and schema are considered. We propose the APRIORI-KC (Apriori Knowledge Constraints) algorithm to eliminate all associations explicitly represented in geographic database schemas. Experiments show a very significant reduction of the number of rules and the elimination of well known rules. © 2006 IEEE.

Cite

CITATION STYLE

APA

Bogorny, V., Da Silva Camargo, S., Engel, P. M., & Alvares, L. O. (2006). Towards elimination of well known geographic patterns in spatial association rule mining. In IEEE Intelligent Systems (pp. 532–537). https://doi.org/10.1109/IS.2006.348476

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free