{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:01Z","timestamp":1742914081032,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642290374"},{"type":"electronic","value":"9783642290381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29038-1_23","type":"book-chapter","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T07:57:38Z","timestamp":1333612658000},"page":"303-319","source":"Crossref","is-referenced-by-count":3,"title":["Privacy Preserving Mining Maximal Frequent Patterns in Transactional Databases"],"prefix":"10.1007","author":[{"given":"Md. Rezaul","family":"Karim","sequence":"first","affiliation":[]},{"given":"Md. Mamunur","family":"Rashid","sequence":"additional","affiliation":[]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Ho-Jin","family":"Choi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Wang, J.L., Xu, C.F., Pan, Y.H.: An Algorithm for Mining Privacy-Preserving Frequent Itemsets. In: International Conference on Machine Learning and Cybernetics (2006)","DOI":"10.1109\/ICMLC.2006.258592"},{"key":"23_CR2","unstructured":"Mustapha, N., Hossein, M., Shahraki, N., Mamat, A.B., Sulaiman, M.N.B.: A Numerical Method for Frequent Patterns Mining. Journal of Theoretical and Applied Information Technology"},{"key":"23_CR3","unstructured":"Fu, A.W.C., Wang, K.: Privacy-Preserving Frequent Pattern Mining Across Private Databases. In: Proceedings of the Fifth IEEE International Conference on Data Mining, ICDM 2005 (2005)"},{"key":"23_CR4","unstructured":"Oliveira, S.R.M., Zane, O.R.: Privacy Preserving Frequent Itemset Mining. In: IEEE International Conference on Data Mining Workshop on Privacy, Security, Maebashi City, Japan"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering (2000)","DOI":"10.1109\/69.846291"},{"key":"23_CR6","unstructured":"http:\/\/en.wikipedia.org\/wiki\/Prime_number"},{"key":"23_CR7","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceeding of the 20th Inl. Conf. on Very Large Databases (VLDB), Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: Proc. of the 1st IEEE International Conf. on Data Mining, San Jose, USA, pp. 163\u2013170 (2001)","DOI":"10.1109\/ICDM.2001.989514"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases. In: Proceedings of the 17th Inl. Conf. on Data Engineering, Germany (2001)","DOI":"10.1109\/TKDE.2005.183"},{"key":"23_CR10","unstructured":"Gouda, K., Zaki, M.: A New Method for Mining Maximal Frequent Itemsets. In: Proceedings of the World Congress on Engineering, London, U.K (2008)"},{"key":"23_CR11","unstructured":"Burdick, D., Calimlim, M., Gehrke, J.: GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets. In: Data Mining and Knowledge Discovery, The Netherlands (2005)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Mustapha, N., Sulaiman, M.N., Othman, M., Selamat, M.H.: Fast Discovery of Long Patterns for Association Rules. International Journal of Computer Mathematics (2003)","DOI":"10.1080\/0020716031000112376"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Shrivastava, R., Awasthy, R., Solanki, B.: New Improved Algorithm for Mining Privacy Preserving Frequent Itemsets. International Journal of Computer Science & Informatics\u00a01 (2011)","DOI":"10.47893\/IJCSI.2011.1001"},{"key":"23_CR14","unstructured":"http:\/\/empslocal.ex.ac.uk\/people\/staff\/mrwatkin\/zeta\/tutorial.htm"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Wang, H., Hu, C., Chen, Y.: Mining Maximal Patterns Based on Improved FP-lattice structure and Array Technique. In: 2nd International Conference on Future Computer and Communication (2010)","DOI":"10.1109\/ICFCC.2010.5497458"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Leung, C.K., Khan, Q.I., Hoque, T.: CanTree: A canonical-order tree structure for frequent pattern mining. Knowledge and Information Systems (2007)","DOI":"10.1007\/s10115-006-0032-8"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Kai, Y., Yuan, M.: A Fast Algorithm For Discovering Maximum Frequent Item sets. In: IEEE 3rd International Conference on Communication Software and Networks, ICCSN (2011)","DOI":"10.1109\/ICCSN.2011.6014305"},{"key":"23_CR18","unstructured":"Rymon, R.: Search through systematic set enumeration. In: Proc. 3rd Int\u2019l Conf. on PKRR"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29038-1_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:09:19Z","timestamp":1742911759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29038-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642290374","9783642290381"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29038-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}