{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:33:58Z","timestamp":1743154438304,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403005"},{"type":"electronic","value":"9783540448860"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/3-540-44886-1_17","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T20:09:42Z","timestamp":1184962182000},"page":"206-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Efficient Mining of Indirect Associations Using HI-Mine"],"prefix":"10.1007","author":[{"given":"Qian","family":"Wan","sequence":"first","affiliation":[]},{"given":"Aijun","family":"An","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"17_CR1","unstructured":"R. Agarwal, C. Aggarwal, and V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. In J. of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2000."},{"key":"17_CR2","unstructured":"C. Aggarwal and P. Yu. A new framework for itemset generation. In Proc. of the Fourth Int\u2019l Conference on Knowledge Discovery and Data Mining, pages 129\u2013133, New York, NY, 1996."},{"key":"17_CR3","unstructured":"R. Agrawal and R. Srikant. Fast Algorithms for mining association rules. Proceedings of the 20th Int\u2019l Conference on Very Large Data Bases, 487\u2013499, Santiago, Chile 1994."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD int\u2019l Conference on Management of Data, pp 207\u2013216, Washington D.C., USA 1993.","DOI":"10.1145\/170036.170072"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules to correlations. In Proc. ACM SIGMOD intl. Conf. Management of Data, pages 265\u2013276, Tucson, AZ, 1997.","DOI":"10.1145\/253262.253327"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation, In SIGMOD\u201900, pages 1\u201312.","DOI":"10.1145\/335191.335372"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/568271.223813","volume":"25","author":"J. S. Park","year":"1995","unstructured":"J. S. Park, M. S. Chen, and P. S. Yu. An efficient hash-based algorithm for mining association rules. SIGMOD Record, 25(2):175\u2013186, 1995.","journal-title":"SIGMOD Record"},{"key":"17_CR8","unstructured":"J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang. H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Database."},{"key":"17_CR9","unstructured":"J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proc. 2000 ACM-SIGMOD Int. Workshop Data Mining and Knowledge Discovery (DMKD\u201900), pages 11\u201320."},{"key":"17_CR10","unstructured":"P. Tan and V. Kumar. Interestingness measures for association patterns: A perspective. In KDD 2000 Workshop on Postprocessing in Machine Learning and Data Mining, Boston, MA, August 2000."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"P. N. Tan, and V. Kumar. Mining Indirect Associations in Web Data. In Proc of WebKDD 2001: Mining Log Data Across All Customer TouchPoints, August 2001","DOI":"10.1007\/3-540-45640-6_7"},{"key":"17_CR12","unstructured":"P. N. Tan, V Kumar, H Kuno. Using SAS for Mining Indirect Associations in Data, In Proc of the Western Users of SAS Software Conference 2001."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"P. N. Tan, V. Kumar, and J. Srivastava. Indirect Association: Mining Higher Order Dependences in Data. Proceedings of the 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, 632\u2013637, Lyon, France 2000.","DOI":"10.1007\/3-540-45372-5_77"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Savasere, E. Omiecinski, and S. Navathe. Mining for strong negative associations in a large database of customer transactions. In Proc. of the 14th International Conference on Data Engineering, pages 494\u2013502, Orlando, Florida, February 1998.","DOI":"10.1109\/ICDE.1998.655812"},{"key":"17_CR15","unstructured":"Savaswre, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st Int. Conf. on Very Large Databases (VLDB\u201995), Zurich, Switzerland, Sept., 1995."},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1109\/69.929898","volume":"13","author":"a. Wong","year":"2001","unstructured":"Wong and C. J. Butz. Constructing the Dependency Structure of a Multi-Agent Probability Network. IEEE Transactions on Knowledge and Data Engineering, Vol. 13, No. 3, 395\u2013415, May 2001.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44886-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T20:54:17Z","timestamp":1737320057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44886-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403005","9783540448860"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44886-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"27 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}