{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:10:54Z","timestamp":1725487854313},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540140405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-39205-x_111","type":"book-chapter","created":{"date-parts":[[2007,7,21]],"date-time":"2007-07-21T18:23:13Z","timestamp":1185042193000},"page":"660-663","source":"Crossref","is-referenced-by-count":3,"title":["A New Association Rules Mining Algorithms Based on Directed Itemsets Graph"],"prefix":"10.1007","author":[{"given":"Lei","family":"Wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"111_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R., Imielinski T., Swami A., \u201cMining association rules between sets of items in very large databases.\u201d Proceedings of the ACM SIGMOD Conference on Management of data, washington, USA, (1993) 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"111_CR2","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules. In Proc. of the 20th Int\u2019l Conference on Very Large Databases, Santiago, Chile, (1994)"},{"key":"111_CR3","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. Proc. 1995 Int. Conf. Very Large Data Bases (VLDB\u201995), Zurich, Switzerland, (1995) 432\u2013443"},{"key":"111_CR4","doi-asserted-by":"crossref","unstructured":"J. S. Park, M. S. Chen, and P. S. Yu. An efficient hash-based algorithm for mining association rules. Proc. 1995 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD\u201995), San Jose, CA, (1995)175\u2013186","DOI":"10.1145\/223784.223813"},{"key":"111_CR5","doi-asserted-by":"crossref","unstructured":"Brin S., Motwani R. Ullman J. D. and Tsur S. Dynamic Itemset Counting and implication rules for Market Basket Data. Proceedings of the ACM SIGMOD, (1997)255\u2013264","DOI":"10.1145\/253262.253325"},{"key":"111_CR6","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei and Y. Yin. Mining Frequent Patterns without Candidate Generation. Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD00), Dallas, TX, USA, (2000) 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"111_CR7","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R. C. Agarwal","year":"2001","unstructured":"Agarwal R. C., Aggarwal C. C., Prasad V. V. V., Crestana V., A Tree Projection Algorithm for Generation of Large Itemsets For Association Rules. Journal of Parallel and Distributed Computing, Special Issue on High Performance Data Mining, 61(3), (2001)350\u2013371","journal-title":"Journal of Parallel and Distributed Computing, Special Issue on High Performance Data Mining"},{"key":"111_CR8","doi-asserted-by":"crossref","unstructured":"R. C. Agarwal, C. C. Aggarwal, and V.V.V. Prasad. Depth first generation of long patterns. In Proc. of the 6th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, USA, (2000)108\u2013118","DOI":"10.1145\/347090.347114"},{"key":"111_CR9","doi-asserted-by":"crossref","unstructured":"Roberto J. Bayardo. Efficiently mining long patterns from databases. In Proceedings of ACM-SIGMOD International Conference on Management of Data, (1998) 85\u201393","DOI":"10.1145\/276305.276313"},{"key":"111_CR10","doi-asserted-by":"crossref","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Proc. 7th Int. Conf. Database Theory (ICDT99), Jerusalem, Israel, (1999) 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"}],"container-title":["Lecture Notes in Computer Science","Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-39205-X_111.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:20:47Z","timestamp":1619572847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39205-X_111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540140405"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-39205-x_111","relation":{},"subject":[]}}