{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:59:57Z","timestamp":1744163997695},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283317"},{"type":"electronic","value":"9783540318286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11540007_65","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T22:26:32Z","timestamp":1294871192000},"page":"536-545","source":"Crossref","is-referenced-by-count":2,"title":["A Sampling-Based Method for Mining Frequent Patterns from Databases"],"prefix":"10.1007","author":[{"given":"Yen-Liang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Chin-Yuan","family":"Ho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference, pp. 478\u2013499 (1994)"},{"key":"65_CR2","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1109\/69.634757","volume":"9","author":"J.S. Park","year":"1997","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering\u00a09, 813\u2013825 (1997)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"65_CR3","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: Proceedings of the 1997 ACM-SIGMOD Conf. on Management of Data, pp. 255\u2013264 (1997)","DOI":"10.1145\/253260.253325"},{"key":"65_CR4","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: An efficient algorithm for mining association rules in large databases. In: Proceedings of Int\u2019l Conf. Very Large Data Bases, pp. 432\u2013444 (1995)"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"65_CR6","doi-asserted-by":"crossref","unstructured":"Relue, R., Wu, X., Huang, H.: Efficient runtime generation of association rules. In: Proceedings of the Tenth International Conference on Information and Knowledge Management, pp. 466\u2013473 (2001)","DOI":"10.1145\/502585.502664"},{"key":"65_CR7","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by opportunistic projection. In: Proceedings of 2002 Int. Conf. on Knowledge Discovery in Databases, pp. 229\u2013238 (2002)","DOI":"10.1145\/775047.775081"},{"key":"65_CR8","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-mine: hyper-structure mining of frequent patterns in large databases. In: Proceedings of IEEE International Conference on Data Mining, pp. 441\u2013448 (2001)"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"Agrawal, R.C., Aggarwal, C.C., Prasad, V.V.V.: Depth first generation of long patterns. In: Proceedings of SIGKDD Conference, pp. 108\u2013118 (2000)","DOI":"10.1145\/347090.347114"},{"key":"65_CR10","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: a maximal frequent itemset algorithm for transactional databases. In: Proceedings of 17th Int. Conf. Data Engineering, pp. 443\u2013452 (2001)","DOI":"10.1109\/ICDE.2001.914857"},{"key":"65_CR11","unstructured":"Toivonen, H.: Sampling large databases for association rules. In: Proceedings of the 22th International Conference on Very Large Databases, pp. 134\u2013145 (1996)"},{"key":"65_CR12","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R. Agarwal","year":"2001","unstructured":"Agarwal, R., Aggarwal, C., Prasad, V.V.V.: A tree projection algorithm for generation of frequent itemsets. Journal of Parallel and Distributed Computing\u00a061, 350\u2013371 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"65_CR13","doi-asserted-by":"crossref","unstructured":"Bayardo Jr., R.J.: Efficiently mining long patterns from databases. In: Proceedings of the ACM-SIGMOD Int\u2019l Conf. on Management of Data, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"}],"container-title":["Lecture Notes in Computer Science","Fuzzy Systems and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11540007_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:08Z","timestamp":1619506568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11540007_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283317","9783540318286"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11540007_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}