{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:42:49Z","timestamp":1736314969712,"version":"3.32.0"},"publisher-location":"New York","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387283188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-29295-0_31","type":"book-chapter","created":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T10:25:06Z","timestamp":1141986306000},"page":"291-300","source":"Crossref","is-referenced-by-count":1,"title":["An Algorithm for Mining Association Rules with Weighted Minimum Supports"],"prefix":"10.1007","author":[{"given":"Yuchiang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chinchen","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiehshan","family":"Yeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"31_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R. C. Agarwal","year":"2000","unstructured":"R. C. Agarwal, et al. A tree projection algorithm for generation of frequent itemsets. Journal of Parallel and Distributed Computing, 2000, 61(3): 350\u2013361","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"31_CR2","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1109\/69.971183","volume":"13","author":"C. C. Aggarwal","year":"2001","unstructured":"C. C. Aggarwal and P. S. Yu, Mining associations with the collective strength approach. IEEE Trans. Knowledge and Data Engineering, 2001, 13(6): 863\u2013873","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"R. Agrawal, et al. Mining association rules between sets of items in large databases. 1993 ACM SIGMOD Intl. Conf. on Management of Data, Washington: 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"31_CR4","unstructured":"R. Agrawal and R. Srikant, Fast algorithms for mining association rules. 20th Intl. Conf on Very Large Data Bases, 1994, Santiago: 487\u2013499."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"C. H. Cai, et al. Mining association rules with weighted items. 1998 Intl. Database Engineering and Applications Symposium, Cardiff: 68\u201377","DOI":"10.1109\/IDEAS.1998.694360"},{"issue":"6","key":"31_CR6","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/69.553155","volume":"8","author":"M. S. Chen","year":"1996","unstructured":"M. S. Chen, et al. Data mining: An overview from a database perspective. IEEE Trans. Knowledge Data Engineering, 1996, 8(6): 866\u2013883","journal-title":"IEEE Trans. Knowledge Data Engineering"},{"key":"31_CR7","unstructured":"F. L. Chung and C. L. Lui, A post-analysis framework for mining generalized association rules with multiple minimum supports. 6th ACM SIGKDD Intl. Conf on Knowledge Discovery and Data Mining Workshop on Post-Processing in Machine Learning and Data Mining, 2000, Boston: 9\u201314"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"J. Han, et al. Mining frequent patterns without candidate generation. 2000 ACM-SIGMOD Intl. Conf. on Management of Data, Dallas: 1\u201312","DOI":"10.1145\/335191.335372"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1109\/TKDE.2003.1209015","volume":"15","author":"C. H. Lee","year":"2003","unstructured":"C. H. Lee, et al. Progressive partition miner: An efficient algorithm for mining general temporal association rules. IEEE Trans. Knowledge Data Engineering, 2003, 15(4):1004\u20131017","journal-title":"IEEE Trans. Knowledge Data Engineering"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"C. L. Liu and F. L. Chung, Discovery of generalized association rules with multiple minimum supports. 4th European Conf. on Principles of Data Mining and Knowledge Discovery, 2000, Lyon: 510\u2013515","DOI":"10.1007\/3-540-45372-5_59"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"B. Liu, et al. Mining association rules with multiple minimum support. 1999 ACM SIGKDD Intl. Conf on Knowledge Discovery and Data Mining, San Diego: 337\u2013341","DOI":"10.1145\/312129.312274"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"J. S. Park et al. An effective hash-based algorithm for mining association rules. 1995 ACM-SIGMOD Intl. Conf. on Management of Data, San Jose: 175\u2013186","DOI":"10.1145\/568271.223813"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"M. Seno and Karypis, LPMiner: An algorithm for finding frequent itemsets using length-decreasing support constraint. 2001 IEEE Intl. Conf on Data Mining, San Jose: 505\u2013512","DOI":"10.21236\/ADA438931"},{"key":"31_CR14","unstructured":"M. C. Tseng, et al. Maintenance of generalized association rules with multiple minimum support. Joint 9th IFSA World Congress and 20th NAFIPS Intl. Conf, 2001, Vancouver: 1294\u20131299"},{"issue":"3","key":"31_CR15","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1109\/TKDE.2003.1198396","volume":"15","author":"K. Wang","year":"2003","unstructured":"K. Wang, et al. Pushing support constraints into association rules mining. IEEE Trans. Knowledge Data Engineering, 2003, 15(3): 642\u2013658","journal-title":"IEEE Trans. Knowledge Data Engineering"}],"container-title":["IFIP \u2014 The International Federation for Information Processing","Artificial Intelligence Applications and Innovations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-29295-0_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T23:49:06Z","timestamp":1736293746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-29295-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387283188"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/0-387-29295-0_31","relation":{},"subject":[]}}