{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:50:51Z","timestamp":1725681051497},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,3,13]]},"DOI":"10.1145\/1066677.1066796","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"529-536","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Distributed approximate mining of frequent patterns"],"prefix":"10.1145","author":[{"given":"Claudio","family":"Silvestri","sequence":"first","affiliation":[{"name":"Universita Ca' Foscari, Via Torino, Venezia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Orlando","sequence":"additional","affiliation":[{"name":"Universita Ca' Foscari, Via Torino, Venezia, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"fimi.cs.helsinki.fi","author":"Workshop","year":"2003","unstructured":"Workshop on frequent itemset mining implementations FIMI'03 in conjunction with ICDM'03. In fimi.cs.helsinki.fi , 2003 .]] Workshop on frequent itemset mining implementations FIMI'03 in conjunction with ICDM'03. In fimi.cs.helsinki.fi, 2003.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1693"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312241"},{"volume-title":"PDIS: International Conference on Parallel and Distributed Information Systems. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD","year":"1996","key":"e_1_3_2_1_8_1","unstructured":"Cheung, Han, Ng, Fu, and Fu. A fast distributed algorithm for mining association rules . In PDIS: International Conference on Parallel and Distributed Information Systems. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD , 1996 .]] Cheung, Han, Ng, Fu, and Fu. A fast distributed algorithm for mining association rules. In PDIS: International Conference on Parallel and Distributed Information Systems. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD, 1996.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. of the International Conference on Data Endineering ICDE","author":"Burdick D.","year":"1999","unstructured":"D. Burdick , M. Calimlim , and J. Gehrke . Mafia: a maximal frequent itemset for transactional databases . In Proc. of the International Conference on Data Endineering ICDE , 1999 .]] D. Burdick, M. Calimlim, and J. Gehrke. Mafia: a maximal frequent itemset for transactional databases. In Proc. of the International Conference on Data Endineering ICDE, 1999.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Fayyad U. M.","year":"1998","unstructured":"U. M. Fayyad , G. Piatetsky-Shapiro , P. Smyth , and R. Uthurusamy , editors . Advances in Knowledge Discovery and Data Mining . AAAI Press , 1998 .]] U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI Press, 1998.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781633"},{"key":"e_1_3_2_1_12_1","first-page":"2003","volume-title":"Proceedings of the 82nd Annual Transportation Research Board, Washington DC. (USA), January 12-16","author":"Geurts Karolien","unstructured":"Karolien Geurts , Geert Wets , Tom Brijs , and Koen Vanhoof . Profiling high frequency accident locations using association rules . In Proceedings of the 82nd Annual Transportation Research Board, Washington DC. (USA), January 12-16 , page 18pp, 2003 .]] Karolien Geurts, Geert Wets, Tom Brijs, and Koen Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, Washington DC. (USA), January 12-16, page 18pp, 2003.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846289"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_15_1","first-page":"341","volume-title":"Data Mining Handbook","author":"Park B.","year":"2002","unstructured":"B. Park and H. Kargupta . Distributed Data Mining: Algorithms, Systems, and Applications . In Data Mining Handbook , pages 341 -- 358 . IEA , 2002 .]] B. Park and H. Kargupta. Distributed Data Mining: Algorithms, Systems, and Applications. In Data Mining Handbook, pages 341--358. IEA, 2002.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223813"},{"key":"e_1_3_2_1_17_1","first-page":"354","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02)","author":"Parthasarathy Srinivasan","unstructured":"Srinivasan Parthasarathy . Efficient progressive sampling for association rules . In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02) , page 354 . IEEE Computer Society, 2002.]] Srinivasan Parthasarathy. Efficient progressive sampling for association rules. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), page 354. IEEE Computer Society, 2002.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.553164"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781632"},{"key":"e_1_3_2_1_20_1","first-page":"432","volume-title":"VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases","author":"Savasere Ashoka","year":"1995","unstructured":"Ashoka Savasere , Edward Omiecinski , and Shamkant B. Navathe . An efficient algorithm for mining association rules in large databases . In VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases , pages 432 -- 444 . Morgan Kaufmann , September 1995 .]] Ashoka Savasere, Edward Omiecinski, and Shamkant B. Navathe. An efficient algorithm for mining association rules in large databases. In VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, pages 432--444. Morgan Kaufmann, September 1995.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375728"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952147"},{"key":"e_1_3_2_1_23_1","volume-title":"PDIS: International Conference on Parallel and Distributed Information Systems. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD","author":"Kitsuregawa Shintani","year":"1996","unstructured":"Shintani and Kitsuregawa . Hash based parallel algorithms for mining association rules . In PDIS: International Conference on Parallel and Distributed Information Systems. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD , 1996 .]] Shintani and Kitsuregawa. Hash based parallel algorithms for mining association rules. In PDIS: International Conference on Parallel and Distributed Information Systems. IEEE Computer Society Technical Committee on Data Engineering, and ACM SIGMOD, 1996.]]"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the workshop on Frequent Itemset Mining Implementations FIMI'03 in conjunction with ICDM'03","author":"Orlando S.","year":"2003","unstructured":"S. Orlando , P. Palmerini , R. Perego , C. Lucchese , and F. Silvestri . kdci: a multi-strategy algorithm for mining frequent sets . In Proceedings of the workshop on Frequent Itemset Mining Implementations FIMI'03 in conjunction with ICDM'03 , 2003 .]] S. Orlando, P. Palmerini, R. Perego, C. Lucchese, and F. Silvestri. kdci: a multi-strategy algorithm for mining frequent sets. In Proceedings of the workshop on Frequent Itemset Mining Implementations FIMI'03 in conjunction with ICDM'03, 2003.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/844380.844714"},{"key":"e_1_3_2_1_26_1","first-page":"197","volume-title":"Proc. of Int. Conf. VECPAR 2002 - LNCS 2565","author":"Orlando S.","year":"2002","unstructured":"S. Orlando , P. Palmerini , R. Perego , and F. Silvestri . An efficient parallel and distributed algorithm for counting frequent sets . In Proc. of Int. Conf. VECPAR 2002 - LNCS 2565 , pages 197 -- 204 . Spinger , 2002 .]] S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. An efficient parallel and distributed algorithm for counting frequent sets. In Proc. of Int. Conf. VECPAR 2002 - LNCS 2565, pages 197--204. Spinger, 2002.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/646418.693190"},{"key":"e_1_3_2_1_28_1","volume-title":"Mining Association Rules in Peer-to-Peer Systems. In The Third IEEE International Conference on Data Mining (ICDM'03)","author":"Wolff R.","year":"2003","unstructured":"R. Wolff and A. Schuster . Mining Association Rules in Peer-to-Peer Systems. In The Third IEEE International Conference on Data Mining (ICDM'03) , Melbourne, FL , November 2003 .]] R. Wolff and A. Schuster. Mining Association Rules in Peer-to-Peer Systems. In The Third IEEE International Conference on Data Mining (ICDM'03), Melbourne, FL, November 2003.]]"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/4434.806975"}],"event":{"name":"SAC05: The 2005 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Santa Fe New Mexico","acronym":"SAC05"},"container-title":["Proceedings of the 2005 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066677.1066796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T14:23:32Z","timestamp":1673101412000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,13]]},"references-count":29,"alternative-id":["10.1145\/1066677.1066796","10.1145\/1066677"],"URL":"https:\/\/doi.org\/10.1145\/1066677.1066796","relation":{},"subject":[],"published":{"date-parts":[[2005,3,13]]},"assertion":[{"value":"2005-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}