{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:33Z","timestamp":1725493413400},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673828"},{"type":"electronic","value":"9783540455714"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45571-x_32","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:37:57Z","timestamp":1184589477000},"page":"257-268","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Density-Based Mining of Quantitative Association Rules"],"prefix":"10.1007","author":[{"given":"David W.","family":"Cheung","sequence":"first","affiliation":[]},{"given":"Lian","family":"Wang","sequence":"additional","affiliation":[]},{"given":"S. M.","family":"Yiu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,24]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proc. 4th Conf. on Foundations of Data organization and Algorithms, October 1993.","DOI":"10.1007\/3-540-57301-1_5"},{"key":"32_CR2","unstructured":"R. Agrawal, S. Ghosh, T. Imielinski, B. Iyer, and A. Swami. An interval classifier for database mining applications. In Proc. of the 18th Conf. VLDB, Vancouver, Canada, August 1992."},{"key":"32_CR3","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. Of the 20th Conf. on VLDB, Santiago, Chile, September 1994"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"D. W. Cheung, V. T. NG, A. W. Fu, and Y.J. Fu. Efficient mining of association rules in distributed databases. IEEE Transactions on Knowledge and Data Engineering, 8(6)1996","DOI":"10.1109\/69.553158"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"D.W. Cheung and Y. Xiao. Effect of Data Skewness in Parallel Mining of Association Rules. In Proc. The 2th PAKDD-98 Conf.. Melbourne, Australia, April, 1998.","DOI":"10.1007\/3-540-64383-4_5"},{"key":"32_CR6","unstructured":"David W. Cheung et al. Towards the Building of a Dense-Region-Based OLAP System. Manuscript, 1999."},{"key":"32_CR7","unstructured":"J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In Proc. Of the 21st Conf. on VLDB, Zurich, Switzerland, September 1995."},{"key":"32_CR8","unstructured":"B. Lent. A. Swami, and J. Widom. Clustering Association Rules. In Proceedings of ICDE97, Birmingham, UK, April 1997."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Jong Soo Park, Ming-Syan Chen, and Philip S. Yu. An effective hash-based algorithm for mining association rules. In Proc. ACM SIGMOD International Conference on management of Data, San Jose, California, May 1995.","DOI":"10.1145\/223784.223813"},{"key":"32_CR10","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21th conf. VLDB, Zurich, Switzerland, September. 1995"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proc. Of the ACM SIGMOD Conference on Management of Data, Montreal, Canada, June 1996","DOI":"10.1145\/233269.233311"},{"key":"32_CR12","unstructured":"H. Toivonen. Sampling large databases for association rules. In Proc. Of the 22th Conf. on VLDB, Mumbai, India, September 1996"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"B. Zhou, D.W. Cheung and B. Kao. A Fast Algorithm for Density-Based Clustering in Large Database. In Proc. The 3rd (PAKDD-99) Conf., Beijing, China, April 1999.","DOI":"10.1007\/3-540-48912-6_45"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery and Data Mining. Current Issues and New Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45571-X_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T19:40:23Z","timestamp":1558467623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45571-X_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673828","9783540455714"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45571-x_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}