{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:07:13Z","timestamp":1774951633035,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540362975","type":"print"},{"value":"9783540362999","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795131_72","type":"book-chapter","created":{"date-parts":[[2006,9,26]],"date-time":"2006-09-26T15:48:02Z","timestamp":1159285682000},"page":"496-501","source":"Crossref","is-referenced-by-count":5,"title":["The Research of Sampling for Mining Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Xuegang","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"72_CR1","unstructured":"Partjasaratjy, S.: Efficient Progressive Sampling for Association Rules, http:\/\/www.cse.ohio-state.edu\/~srini\/papers\/ICDM02-sampling.pdf"},{"key":"72_CR2","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in knowledge discovery and data mining, AAAI\/MIT Press (1996)"},{"key":"72_CR3","unstructured":"Toivonen, H.: Sampling Large Databases for Association Rules. In: Proceedings of the 22th International Conference on Very Large Data Bases table of contents, San Jose, pp. 134\u2013145 (1996)"},{"key":"72_CR4","unstructured":"Wang, C.H., Huang, H.K.: Distributed mining adjustable accuracy association rules using sampling. Journal of computer research and development, China, 1101\u20131106 (2000)"},{"key":"72_CR5","doi-asserted-by":"crossref","unstructured":"Gu, B.H.: Efficiently Determine the Starting Sample Size for Progressive Sampling, http:\/\/www.cs.cornell.edu\/johannes\/papers\/dmkd2001-papers\/baohua.pdf","DOI":"10.1007\/3-540-44795-4_17"},{"key":"72_CR6","unstructured":"Kullback, S.: Information Theory and Statistics. JHohn Wilcy & Sons, Inc., New York"},{"key":"72_CR7","unstructured":"Zaki, M.J., Parthasarathy, S.: Evaluation of Sampling for Data Mining of Association Rules.Ther University of Rochester Computer Science Department Technical Report. NewYork, pp. 617\u2013618 (1996)"},{"key":"72_CR8","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Set of Items in Large Databases. In: Proceedings of ACM SIGMOD, Los Angeles, pp. 207\u2013216 (2000)","DOI":"10.1145\/170036.170072"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795131_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:39Z","timestamp":1605643839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795131_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540362975","9783540362999"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11795131_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}