{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:12:27Z","timestamp":1743135147458,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466762"},{"type":"electronic","value":"9783031466779"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46677-9_25","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"359-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CTKM: Crypto-Based User Clustering on\u00a0Web Transaction Data"],"prefix":"10.1007","author":[{"given":"Jiangfeng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinpei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenxi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuefeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/TKDE.2017.2763620","volume":"30","author":"X Chen","year":"2017","unstructured":"Chen, X., Fang, Y., Yang, M., Nie, F., Zhao, Z., Huang, J.Z.: PurTreeClust: a clustering algorithm for customer segmentation from massive customer transaction data. IEEE Trans. Knowl. Data Eng. 30(3), 559\u2013572 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Guidotti, R., Monreale, A., Nanni, M., Giannotti, F., Pedreschi, D.: Clustering individual transactional data for masses of users. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 195\u2013204 (2017)","DOI":"10.1145\/3097983.3098034"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-16148-4_22","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M Carnein","year":"2019","unstructured":"Carnein, M., Trautmann, H.: Customer segmentation based on transactional data using stream clustering. In: Yang, Q., Zhou, Z.-H., Gong, Z., Zhang, M.-L., Huang, S.-J. (eds.) PAKDD 2019. LNCS (LNAI), vol. 11439, pp. 280\u2013292. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16148-4_22"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar, A., Aksu, H., Uluagac, A.S., Conti, M.: A survey on homomorphic encryption schemes: theory and implementation. ACM Comput. Surv. (Csur) 51(4), 1\u201335 (2018)","journal-title":"ACM Comput. Surv. (Csur)"},{"issue":"10","key":"25_CR5","doi-asserted-by":"publisher","first-page":"3424","DOI":"10.1109\/TKDE.2020.2969633","volume":"33","author":"W Wu","year":"2020","unstructured":"Wu, W., Liu, J., Wang, H., Hao, J., Xian, M.: Secure and efficient outsourced k-means clustering using fully homomorphic encryption with ciphertext packing technique. IEEE Trans. Knowl. Data Eng. 33(10), 3424\u20133437 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"8","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1109\/TKDE.2019.2912748","volume":"32","author":"X Yi","year":"2019","unstructured":"Yi, X., Bertino, E., Rao, F.Y., Lam, K.Y., Nepal, S., Bouguettaya, A.: Privacy-preserving user profile matching in social networks. IEEE Trans. Knowl. Data Eng. 32(8), 1572\u20131585 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"10562","DOI":"10.1109\/ACCESS.2017.2706947","volume":"5","author":"R Mendes","year":"2017","unstructured":"Mendes, R., Vilela, J.P.: Privacy-preserving data mining: methods, metrics, and applications. IEEE Access 5, 10562\u201310582 (2017)","journal-title":"IEEE Access"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Iezzi, M.: Practical privacy-preserving data science with homomorphic encryption: an overview. In: 2020 IEEE International Conference on Big Data (Big Data), pp. 3979\u20133988. IEEE (2020)","DOI":"10.1109\/BigData50022.2020.9377989"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.21629\/JSEE.2017.01.19","volume":"28","author":"L Zhang","year":"2017","unstructured":"Zhang, L., Liu, Y., Wang, R., Fu, X., Lin, Q.: Efficient privacy-preserving classification construction model with differential privacy technology. J. Syst. Eng. Electron. 28(1), 170\u2013178 (2017)","journal-title":"J. Syst. Eng. Electron."},{"issue":"2","key":"25_CR10","first-page":"352","volume":"8","author":"X Sun","year":"2018","unstructured":"Sun, X., Zhang, P., Liu, J.K., Yu, J., Xie, W.: Private machine learning classification based on fully homomorphic encryption. IEEE Trans. Emerg. Top. Comput. 8(2), 352\u2013364 (2018)","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"issue":"5","key":"25_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1109\/TDSC.2013.43","volume":"11","author":"J Vaidya","year":"2013","unstructured":"Vaidya, J., Shafiq, B., Fan, W., Mehmood, D., Lorenzi, D.: A random decision tree framework for privacy-preserving data mining. IEEE Trans. Dependable Secure Comput. 11(5), 399\u2013411 (2013)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"2066","DOI":"10.1109\/TII.2017.2695487","volume":"13","author":"K Xing","year":"2017","unstructured":"Xing, K., Hu, C., Yu, J., Cheng, X., Zhang, F.: Mutual privacy preserving $$ k $$-means clustering in social participatory sensing. IEEE Trans. Industr. Inf. 13(4), 2066\u20132076 (2017)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"J\u00e4schke, A., Armknecht, F.: Unsupervised machine learning on encrypted data. In: International Conference on Selected Areas in Cryptography, pp. 453\u2013478. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_21","DOI":"10.1007\/978-3-030-10970-7_21"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206\u2013215 (2003)","DOI":"10.1145\/775047.775142"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Liu, D., Bertino, E., Yi, X.: Privacy of outsourced k-means clustering. In: Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, pp. 123\u2013134 (2014)","DOI":"10.1145\/2590296.2590332"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Peng, Y., Li, H., Cui, J., Zhu, Y., Peng, C.: An efficient range query model over encrypted outsourced data using secure KD tree. In: 2016 International Conference on Networking and Network Applications (NaNA), pp. 250\u2013253. IEEE (2016)","DOI":"10.1109\/NaNA.2016.31"},{"issue":"3","key":"25_CR17","doi-asserted-by":"crossref","first-page":"2431","DOI":"10.1109\/TCC.2022.3208711","volume":"11","author":"Y Guo","year":"2022","unstructured":"Guo, Y., Xie, H., Wang, M., Jia, X.: Privacy-preserving multi-range queries for secure data outsourcing services. IEEE Trans. Cloud Comput. 11(3), 2431\u20132444 (2022)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, Y., Zhao, Q., Rao, W.: Automatic user categorization through large transaction data. In: 2019 IEEE International Conference on Multimedia and Expo (ICME), pp. 278\u2013283. IEEE (2019)","DOI":"10.1109\/ICME.2019.00056"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10618-022-00874-9","volume":"37","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., Zhao, Q., Shi, Y., Li, J., Rao, W.: Category tree distance: a taxonomy-based transaction distance for web user analysis. Data Min. Knowl. Disc. 37(1), 39\u201366 (2023)","journal-title":"Data Min. Knowl. Disc."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, Q., et al.: TaxoVec: taxonomy based representation for web user profiling. In: Proceedings of the 2021 International Conference on Multimodal Interaction, pp. 548\u2013556 (2021)","DOI":"10.1145\/3462244.3479929"},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.is.2012.06.001","volume":"38","author":"X Yi","year":"2013","unstructured":"Yi, X., Zhang, Y.: Equally contributory privacy-preserving k-means clustering over vertically partitioned data. Inf. Syst. 38(1), 97\u2013107 (2013)","journal-title":"Inf. Syst."},{"key":"25_CR22","unstructured":"Hardy, S., et al.: Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. arXiv preprint arXiv:1711.10677 (2017)"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.datak.2014.07.008","volume":"92","author":"Q Zhao","year":"2014","unstructured":"Zhao, Q., Fr\u00e4nti, P.: WB-index: a sum-of-squares based index for cluster validity. Data Knowl. Eng. 92, 77\u201389 (2014)","journal-title":"Data Knowl. Eng."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46677-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T11:11:07Z","timestamp":1730459467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46677-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466762","9783031466779"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46677-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"216","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.97","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.77","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}