Abstract
Association Rule Mining, originally proposed for market basket data, has potential applications in many areas. Remote Sensed Imagery (RSI) data is one of the promising application areas. Extracting interesting patterns and rules from datasets composed of images and associated ground data, can be of importance in precision agriculture, community planning, resource discovery and other areas. However, in most cases the image data sizes are too large to be mined in a reasonable amount of time using existing algorithms. In this paper, we propose an approach to derive association rules on RSI data using Peano Count Tree (P-tree) structure. P-tree structure, proposed in our previous work, provides a lossless and compressed representation of image data. Based on P-trees, an efficient association rule mining algorithm P-ARM with fast support calculation and significant pruning techniques are introduced to improve the efficiency of the rule mining process. P-ARM algorithm is implemented and compared with FP-growth and Apriori algorithms. Experimental results showed that our algorithm is superior for association rule mining on RSI spatial data.
Patents are pending on the P-tree technology. This work is partially supported by GSA Grant ACT#: K96130308, NSF Grant OSR-9553368 and DARPA Grant DAAH04-96-1-0329.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Database”, SIGMOD 93.
R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” VLDB 94.
R. Srikant and R. Agrawal, “Mining Quantitative Association Rules in Large Relational Tables”, SIGMOD 96.
Jong Soo Park, Ming-Syan Chen and Philip S. Yu, “An effective Hash-Based Algorithm for Mining Association Rules,” SIGMOD 95.
V. Gaede and O. Gunther, “Multidimensional Access Methods”, Computing Surveys, 30(2), 1998.
H. Samet, “The quadtree and related hierarchical data structure”. ACM Computing Survey, 16,2, 1984.
R. A. Finkel and J. L. Bentley, “Quad trees: A data structure for retrieval of composite keys”, Acta Informatica, 4,1, 1974.
O. R. Zaiane, J. Han and H. Zhu, “Mining Recurrent Items in Multimedia with Progressive Resolution Refinement”, ICDE’2000.
TIFF image data sets. Available at http://midas-10.cs.ndsu.nodak.edu/data/images/
HH-codes. Available at http://www.statkart.no/nlhdb/iveher/hhtext.htm
J. Han and Y. Fu, “Discovery of Multiple-level Association Rules from Large Databases”, VLDB 95.
J. Han, J. Pei and Y. Yin, “Mining Frequent Patterns without Candidate Generation”, SIGMOD 2000.
M. Ester, H. P. Kriegel, J. Sander, “Spatial Data Mining: A Database Approach”, SSD 1997.
K. Koperski, J. Adhikary, J. Han, “Spatial Data Mining: Progress and Challenges”, DMKD 1996.
William Perrizo, Qin Ding, Qiang Ding and Amalendu Roy, “Deriving High Confidence Rules from Spatial Data using Peano Count Trees”, Springer-Verlag, LNCS 2118, July 2001.
K. Koperski, J. Han, “Discovery of Spatial Association Rules in Geographic Information Database”, SSD 1995.
C. Ordonez and E. Omiecinski, “Discovering Association Rules based on Image Content”, Proceedings of the IEEE Advances in Digital Libraries Conference 99.
Remote Sensing Tutorial. Available at http://rst.gsfc.nasa.gov/Front/tofc.html
S. Brin et al, “Dynamic Itemset Counting and Implication Rules for Market Basket Data”, SIGMOD 97.
A. Moore, M. Soon Lee, “Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets”, Journal of Artificial Intelligence Research, 8 (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, Q., Ding, Q., Perrizo, W. (2002). Association Rule Mining on Remotely Sensed Images Using P-trees. In: Chen, MS., Yu, P.S., Liu, B. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2002. Lecture Notes in Computer Science(), vol 2336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47887-6_7
Download citation
DOI: https://doi.org/10.1007/3-540-47887-6_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43704-8
Online ISBN: 978-3-540-47887-4
eBook Packages: Springer Book Archive