{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:23Z","timestamp":1725566123741},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152108"},{"type":"electronic","value":"9783642152115"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15211-5_12","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T11:38:15Z","timestamp":1284982695000},"page":"109-118","source":"Crossref","is-referenced-by-count":0,"title":["A Distributed Associative Classification Algorithm"],"prefix":"10.1007","author":[{"given":"Djamila","family":"Mokeddem","sequence":"first","affiliation":[]},{"given":"Hafida","family":"Belbachir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R. Agrawal","year":"1996","unstructured":"Agrawal, R., Sharfer, J.: Parallel Mining of Association Rules. IEEE Transaction on Knowledge and Data Engineering\u00a08(6), 962\u2013969 (1996)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"12_CR2","first-page":"487","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rule. In: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann, Santiago (1994)"},{"key":"12_CR3","series-title":"Lecture Notes in Artificial Intelligence","first-page":"137","volume-title":"Discovery Science","author":"M.J. Alipio","year":"2005","unstructured":"Alipio, M.J., Paulo, J.A.: An experiment with association rules and classification: Post-bagging and conviction. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds.) DS 2005. LNCS (LNAI), vol.\u00a03735, pp. 137\u2013149. Springer, Heidelberg (2005)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Parthasarathy, S., Tatikonda, S., Kurc, T., Saltz, J.: Toward terabyte pattern mining: An architecture-conscious solution. In: Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 2\u201312 (2007)","DOI":"10.1145\/1229428.1229432"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chawla, N., Eschrich, S., Hall, L.O.: Creating Ensembles of Classifiers. In: IEEE International Conference on Data Mining, pp. 580\u2013581 (2001)","DOI":"10.1109\/ICDM.2001.989568"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chen, D., Lai, C., Hu, W., Chen, W.G., Zhang, Y., Zheng, W.: Tree partition based parallel frequent pattern mining on shared memory systems. IEEE Parallel and Distributed Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639620"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, O.R.: Incremental Mining of Frequent Patterns without Candidate Generation or Support Constraint. In: Seventh International Database Engineering and Applications Symposium (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/342009.335372","volume-title":"Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data","author":"J. Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp. 1\u201312. ACM Press, Dallas (2000)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Javed, A., Khokhar, A.: Frequent Pattern Mining on Message Passing Multiprocessor Systems. Distributed and Parallel database, 321\u2013334 (2004)","DOI":"10.1023\/B:DAPD.0000031634.19130.bd"},{"key":"12_CR10","unstructured":"Li, W., Han, J.N., Pei, J.: CMAR: Accurate and efficient classification based on multiple-class association rule. In: Proceedings of the International Conference on Data Mining (ICDM 2001), San Jose, CA, pp. 369\u2013376 (2001)"},{"key":"12_CR11","first-page":"80","volume-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining","author":"B. Liu","year":"1998","unstructured":"Liu, B., Hsu, W., Ma, Y.: Integrating classification and association rule mining. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 80\u201386. AAAI Press, New York (1998)"},{"key":"12_CR12","unstructured":"Moonesinghe, H.D.K., Moon-Jung, C., Pang-Ning, T.: Fast Parallel Mining of Frequent Item-sets (Technical Report MSU-CSE-06-29). Dept. of Computer Science and Engineering, Michigan State University (2006)"},{"key":"12_CR13","unstructured":"Pramudiono, I., Kitsuregawa, M.: Shared nothing parallel execution of FP-growth. DBSJ Letters, v2 i1. 43-46 (2003)"},{"key":"12_CR14","volume-title":"C4.5 Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5 Programs for Machine Learning. Morgan Kaufmann Publishers, Inc., San Francisco (1993)"},{"key":"12_CR15","first-page":"202","volume":"4","author":"F. Thabtah","year":"2006","unstructured":"Thabtah, F.: Pruning techniques in associative classification: Survey and comparison. Journal of Digital Information Management\u00a04, 202\u2013205 (2006)","journal-title":"Journal of Digital Information Management"},{"key":"12_CR16","first-page":"363","volume":"15","author":"G. Thakur","year":"2008","unstructured":"Thakur, G., Ramesh, C.J.: A Framework For Fast Classification Algorithms. International Journal Information Theories & Applications\u00a015, 363\u2013369 (2008)","journal-title":"International Journal Information Theories & Applications"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Yu, K.M., Zhou, J., Hsiao, W.C.: Load balancing approach parallel algorithm for frequent pattern mining. PaCT, 623\u2013631 (2007)","DOI":"10.1007\/978-3-540-73940-1_63"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Zaiane, O., Lu, P.: Fast Parallel Association Rules Mining without Candidacy Generation. In: Proceeding of IEEE International Conference on Data Mining (ICDM 2001), pp. 665\u2013668 (2001)","DOI":"10.1109\/ICDM.2001.989600"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Zhou, J., Yu, K.M.: Tidset-based parallel FP-tree algorithm for the frequent pattern mining problem on PC clusters. In: Proceeding of 3rd international conference on grid and pervasive computing, pp. 18\u201328 (2008)","DOI":"10.1007\/978-3-540-68083-3_5"}],"container-title":["Studies in Computational Intelligence","Intelligent Distributed Computing IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15211-5_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:38Z","timestamp":1606186958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15211-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152108","9783642152115"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15211-5_12","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2010]]}}}