{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:30:26Z","timestamp":1760707826742},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437048"},{"type":"electronic","value":"9783540478874"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47887-6_7","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T11:21:04Z","timestamp":1179573664000},"page":"66-79","source":"Crossref","is-referenced-by-count":19,"title":["Association Rule Mining on Remotely Sensed Images Using P-trees"],"prefix":"10.1007","author":[{"given":"Qin","family":"Ding","sequence":"first","affiliation":[]},{"given":"Qiang","family":"Ding","sequence":"additional","affiliation":[]},{"given":"William","family":"Perrizo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,29]]},"reference":[{"key":"7_CR1","unstructured":"R. Agrawal, T. Imielinski, and A. Swami, \u201cMining Association Rules Between Sets of Items in Large Database\u201d, SIGMOD 93."},{"key":"7_CR2","unstructured":"R. Agrawal and R. Srikant, \u201cFast Algorithms for Mining Association Rules,\u201d VLDB 94."},{"key":"7_CR3","unstructured":"R. Srikant and R. Agrawal, \u201cMining Quantitative Association Rules in Large Relational Tables\u201d, SIGMOD 96."},{"key":"7_CR4","unstructured":"Jong Soo Park, Ming-Syan Chen and Philip S. Yu, \u201cAn effective Hash-Based Algorithm for Mining Association Rules,\u201d SIGMOD 95."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"V. Gaede and O. Gunther, \u201cMultidimensional Access Methods\u201d, Computing Surveys, 30(2), 1998.","DOI":"10.1145\/280277.280279"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"H. Samet, \u201cThe quadtree and related hierarchical data structure\u201d. ACM Computing Survey, 16,2, 1984.","DOI":"10.1145\/356924.356930"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"R. A. Finkel and J. L. Bentley, \u201cQuad trees: A data structure for retrieval of composite keys\u201d, Acta Informatica, 4,1, 1974.","DOI":"10.1007\/BF00288933"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"O. R. Zaiane, J. Han and H. Zhu, \u201cMining Recurrent Items in Multimedia with Progressive Resolution Refinement\u201d, ICDE\u20192000.","DOI":"10.1109\/ICDE.2000.839445"},{"key":"7_CR9","unstructured":"TIFF image data sets. Available at http:\/\/midas-10.cs.ndsu.nodak.edu\/data\/images\/"},{"key":"7_CR10","unstructured":"HH-codes. Available at http:\/\/www.statkart.no\/nlhdb\/iveher\/hhtext.htm"},{"key":"7_CR11","unstructured":"J. Han and Y. Fu, \u201cDiscovery of Multiple-level Association Rules from Large Databases\u201d, VLDB 95."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei and Y. Yin, \u201cMining Frequent Patterns without Candidate Generation\u201d, SIGMOD 2000.","DOI":"10.1145\/342009.335372"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"M. Ester, H. P. Kriegel, J. Sander, \u201cSpatial Data Mining: A Database Approach\u201d, SSD 1997.","DOI":"10.1007\/3-540-63238-7_24"},{"key":"7_CR14","unstructured":"K. Koperski, J. Adhikary, J. Han, \u201cSpatial Data Mining: Progress and Challenges\u201d, DMKD 1996."},{"key":"7_CR15","series-title":"Lect Notes Comput Sci","volume-title":"Deriving High Confidence Rules from Spatial Data using Peano Count Trees","author":"W. Perrizo","year":"2001","unstructured":"William Perrizo, Qin Ding, Qiang Ding and Amalendu Roy, \u201cDeriving High Confidence Rules from Spatial Data using Peano Count Trees\u201d, Springer-Verlag, LNCS 2118, July 2001."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"K. Koperski, J. Han, \u201cDiscovery of Spatial Association Rules in Geographic Information Database\u201d, SSD 1995.","DOI":"10.1007\/3-540-60159-7_4"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"C. Ordonez and E. Omiecinski, \u201cDiscovering Association Rules based on Image Content\u201d, Proceedings of the IEEE Advances in Digital Libraries Conference 99.","DOI":"10.1109\/ADL.1999.777689"},{"key":"7_CR18","unstructured":"Remote Sensing Tutorial. Available at http:\/\/rst.gsfc.nasa.gov\/Front\/tofc.html"},{"key":"7_CR19","unstructured":"S. Brin et al, \u201cDynamic Itemset Counting and Implication Rules for Market Basket Data\u201d, SIGMOD 97."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"A. Moore, M. Soon Lee, \u201cCached Sufficient Statistics for Efficient Machine Learning with Large Datasets\u201d, Journal of Artificial Intelligence Research, 8 (1998).","DOI":"10.1613\/jair.453"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47887-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T01:21:31Z","timestamp":1556414491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47887-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437048","9783540478874"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-47887-6_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}