{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:10:03Z","timestamp":1743131403191,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319318622"},{"type":"electronic","value":"9783319318639"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31863-9_7","type":"book-chapter","created":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T07:40:02Z","timestamp":1459150802000},"page":"87-100","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Privacy-Preserving Association Rule Mining Using Negative Border"],"prefix":"10.1007","author":[{"given":"Duc H.","family":"Tran","sequence":"first","affiliation":[]},{"given":"Wee Keong","family":"Ng","sequence":"additional","affiliation":[]},{"given":"Y. D.","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Vinh V.","family":"Thai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,29]]},"reference":[{"key":"7_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) Proceedings of 20th International Conference on Very Large Databases, VLDB, pp. 487\u2013499. Morgan Kaufmann (1994)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Ayan, N., Tansel, A., Arkun, E.: An efficient algorithm to update large itemsets with early pruning. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 287\u2013291. ACM (1999)","DOI":"10.1145\/312129.312252"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Cheung, D., Han, J., Ng, V., Fu, A., Fu, Y.: A fast distributed algorithm for mining association rules. In: Fourth International Conference on Parallel and Distributed Information Systems, pp. 31\u201342. IEEE (1996)","DOI":"10.1109\/PDIS.1996.568665"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Cheung, D., Han, J., Ng, V., Wong, C.: Maintenance of discovered association rules in large databases: an incremental updating technique. In: Proceedings of the Twelfth International Conference on Data Engineering, pp. 106\u2013114. IEEE (1996)","DOI":"10.1109\/ICDE.1996.492094"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Cheung, D.W., Lee, S.D., Kao, B.: A general incremental technique for maintaining discovered association rules. In: Proceedings of the Fifth International Conference On Database Systems For Advanced Applications, pp. 185\u2013194 (1997)","DOI":"10.1142\/9789812819536_0020"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/772862.772867","volume":"4","author":"C Clifton","year":"2002","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. SIGKDD Explor. Newsl. 4(2), 28\u201334 (2002)","journal-title":"SIGKDD Explor. Newsl."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Duan, Y., Canny, J.F., Zhan, J.Z.: Efficient privacy-preserving association rule mining: p4p style. In: CIDM, pp. 654\u2013660. IEEE (2007)","DOI":"10.1109\/CIDM.2007.368938"},{"key":"7_CR8","unstructured":"Goldreich, O.: Secure multi-party computation. Manuscript (2002)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-540-74553-2_38","volume-title":"Data Warehousing and Knowledge Discovery","author":"S Han","year":"2007","unstructured":"Han, S., Ng, W.-K.: Privacy-preserving genetic algorithms for rule discovery. In: Song, I.-Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 407\u2013417. Springer, Heidelberg (2007)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A.: An efficient protocol for yao\u2019s millionaires\u2019 problem. In: Proceedings of the 36th Annual Hawaii International Conference on System Sciences, p. 6, January 2003","DOI":"10.1109\/HICSS.2003.1174464"},{"issue":"9","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. Knowl. Data Eng. 16(9), 1026\u20131037 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lee, C., Lin, C., Chen, M.: Sliding-window filtering: an efficient algorithm for incremental mining. In: Proceedings of the tenth international conference on Information and knowledge management, pp. 263\u2013270. ACM (2001)","DOI":"10.1145\/502585.502630"},{"key":"7_CR13","unstructured":"Mannila, H., Toivonen, H.: On an algorithm for finding all interesting sentences. In: Cybernetics and Systems, Volume II, The Thirteenth European Meeting on Cybernetics and Systems Research. Citeseer (1996)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.-S., Yu, P.S.: An effective hash-based algorithm for mining association rules. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 1995, pp. 175\u2013186. ACM, New York (1995)","DOI":"10.1145\/223784.223813"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1109\/TKDE.2013.41","volume":"26","author":"T Tassa","year":"2014","unstructured":"Tassa, T.: Secure mining of association rules in horizontally distributed databases. IEEE Trans. Knowl. Data Eng. 26(4), 970\u2013983 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR16","unstructured":"Thomas, S., Bodagala, S., Alsabti, K., Ranka, S.: An efficient algorithm for the incremental updation of association rules in large databases. In: Knowledge Discovery and Data Mining, pp. 263\u2013266 (1997)"},{"issue":"4","key":"7_CR17","doi-asserted-by":"crossref","first-page":"593","DOI":"10.3233\/JCS-2005-13401","volume":"13","author":"J Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. J. Comput. Secur. 13(4), 593\u2013622 (2005)","journal-title":"J. Comput. Secur."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Veloso, A., Meira Jr., W., De Carvalho, M., P\u00f4ssas, B., Parthasarathy, S., Zaki, M.: Mining frequent itemsets in evolving databases. In: SIAM International Conference on Data Mining (2002)","DOI":"10.1137\/1.9781611972726.29"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-68125-0_34","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"WK Wong","year":"2008","unstructured":"Wong, W.K., Cheung, D.W., Hung, E., Liu, H.: Protecting privacy in incremental maintenance for distributed association rule mining. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 381\u2013392. Springer, Heidelberg (2008)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: SFCS 1982: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE Computer Society, Washington (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets. In: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Intelligence and Security Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31863-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T21:15:15Z","timestamp":1567718115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-31863-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319318622","9783319318639"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31863-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}