Towards Elimination of Well Known Geographic Patterns in Spatial Association Rule Mining

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 n...

Full description

Saved in:
Bibliographic Details
Published in:2006 3rd International IEEE Conference Intelligent Systems 2006-09, p.532-537
Main Authors: Bogorny, V., Camargo, Sd.S., Engel, P.M., Alvares, L.O.
Format: Article
Language:English
Subjects:
Association rules
Computer science
Data mining
Geographic databases
geographic domain knowledge
Intelligent systems
Relational databases
Shape
spatial association rules
spatial data mining
Spatial databases
Telephony
Transaction databases
Water resources
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 (a priori 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
ISSN:1541-1672
1941-1294
DOI:10.1109/IS.2006.348476