{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:32:59Z","timestamp":1725485579183},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422983"},{"type":"electronic","value":"9783540477143"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47714-4_9","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T00:41:26Z","timestamp":1180744886000},"page":"91-102","source":"Crossref","is-referenced-by-count":6,"title":["Deriving High Confidence Rules from Spatial Data Using Peano Count Trees"],"prefix":"10.1007","author":[{"given":"William","family":"Perrizo","sequence":"first","affiliation":[]},{"given":"Qin","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Amalendu","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami. Mining Association Rules Between Sets of Items in Large Database. ACM SIGMOD 1993.","DOI":"10.1145\/170035.170072"},{"key":"9_CR2","unstructured":"R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. VLDB 1994."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"R. Srikant, R. Agrawal. Mining Quantitative Association Rules in Large Relational Tables. ACM SIGMOD 1996.","DOI":"10.1145\/233269.233311"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"J. S. Park, M. Chen, P. S. Yu. An effective Hash-Based Algorithm for Mining Association Rules. ACM SIGMOD 1995.","DOI":"10.1145\/223784.223813"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, Y. Yin. Mining Frequent Patterns without Candidate Generation. ACM SIGMOD 2000.","DOI":"10.1145\/342009.335372"},{"key":"9_CR6","unstructured":"R. J. Bayardo. Brute-Force Mining of High-Confidence Classification Rules. KDD 1997."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"E. Cohen, et al. Finding Interesting Associations without Support Pruning. VLDB 2000.","DOI":"10.1109\/ICDE.2000.839448"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"K. Wang, S. Zhou, Y. He. Growing Decision Trees on Support-less Association Rules. KDD 2000.","DOI":"10.1145\/347090.347147"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"V. Gaede, O. Gunther. Multidimensional Access Methods. Computing Surveys, 30(2), 1998.","DOI":"10.1145\/280277.280279"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"H. Samet. The quadtree and related hierarchical data structure. ACM Computing Survey, 16, 2, 1984.","DOI":"10.1145\/356924.356930"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"H. Samet. Applications of Spatial Data Structures. Addison-Wesley, 1990.","DOI":"10.1007\/3-540-52208-5_28"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.","DOI":"10.1007\/3-540-52208-5_28"},{"key":"9_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. A. Finkel","year":"1974","unstructured":"R. A. Finkel, J. L. Bentley. Quad trees: A data structure for retrieval of composite keys. Acta Informatica, 4, 1, 1974.","journal-title":"Acta Informatica"},{"key":"9_CR14","unstructured":"HH-code. Available at http:\/\/www.statkart.no\/nlhdb\/iveher\/hhtext.htm"},{"key":"9_CR15","unstructured":"B. Liu, W. Hsu, Y. Ma. Integrating classification and association rule mining. KDD 1998."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"J. Dong, W. Perrizo, Q. Ding and J. Zhou. The Application of Association Rule Mining on Remotely Sensed Data. ACM Symposium on Applied Computing, 2000.","DOI":"10.1145\/335603.335786"}],"container-title":["Lecture Notes in Computer Science","Advances in Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47714-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:06:37Z","timestamp":1556453197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47714-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422983","9783540477143"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-47714-4_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}