Mining frequent geographic patterns with knowledge constraints

DMCA

Mining frequent geographic patterns with knowledge constraints (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Vania Bogorny , Sandro Camargo , Paulo Martins Engel , Luis Otavio Alvares

Venue:	In ACM-GIS
Citations:	8 - 5 self

BibTeX

@INPROCEEDINGS{Bogorny06miningfrequent,
    author = {Vania Bogorny and Sandro Camargo and Paulo Martins Engel and Luis Otavio Alvares},
    title = {Mining frequent geographic patterns with knowledge constraints},
    booktitle = {In ACM-GIS},
    year = {2006},
    pages = {139--146},
    publisher = {ACM}
}

OpenURL

Abstract

The large amount of patterns generated by frequent pattern mining algorithms has been extensively addressed in the last few years. In geographic pattern mining, besides the large amount of patterns, many are well known geographic domain associations. Existing algorithms do not warrant the elimination of all well known geographic dependences since no prior knowledge is used for this purpose. This paper presents a two step method for mining frequent geographic patterns without associations that are previously known as non-interesting. In the first step the input space is reduced as much as possible. This is as far as we know still the most efficient method to reduce frequent patterns. In the second step, all remaining geographic dependences that can only be eliminated during the frequent set generation are removed in an efficient way. Experiments show an elimination of more than

Keyphrases

frequent geographic pattern knowledge constraint geographic dependence large amount step method efficient way frequent pattern mining algorithm input space prior knowledge first step geographic domain association geographic pattern mining second step efficient method last year frequent set generation frequent pattern

DMCA