{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:37:58Z","timestamp":1743057478265,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030875701"},{"type":"electronic","value":"9783030875718"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87571-8_32","type":"book-chapter","created":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:02:47Z","timestamp":1631782967000},"page":"372-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unsupervised Entity Resolution Method Based on Random Forest"],"prefix":"10.1007","author":[{"given":"Wanying","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhijiang","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-60029-7_14","volume-title":"Web Information Systems and Applications","author":"L Yu","year":"2020","unstructured":"Yu, L., Nie, T., Shen, D., Kou, Y.: An approach for progressive set similarity join with GPU accelerating. In: Wang, G., Lin, X., Hendler, J., Song, W., Xu, Z., Liu, G. (eds.) WISA 2020. LNCS, vol. 12432, pp. 155\u2013167. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60029-7_14"},{"issue":"1","key":"32_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01835-0","volume":"2","author":"F Naumann","year":"2010","unstructured":"Naumann, F., Herschel, M.: An introduction to duplicate detection. Synth. Lect. Data Manage. 2(1), 1\u201387 (2010)","journal-title":"Synth. Lect. Data Manage."},{"key":"32_CR3","unstructured":"Papadakis, G., Ioannou, E., Palpanas, T.: Entity resolution: past, present and yet-to-come. In: 23th International Conference on Extending Database Technology, pp. 647\u2013650. Copenhagen, Denmark (2020)"},{"issue":"12","key":"32_CR4","doi-asserted-by":"publisher","first-page":"2018","DOI":"10.14778\/2367502.2367564","volume":"5","author":"L Getoor","year":"2012","unstructured":"Getoor, L., Machanavajjhala, A.: Entity resolution: theory, practice & open challenges. Proc. VLDB Endowm. 5(12), 2018\u20132019 (2012)","journal-title":"Proc. VLDB Endowm."},{"key":"32_CR5","unstructured":"Elfeky, M., Verykios V., Elmagarmid, A.: Tailor: a record linkage toolbox. In: 18th International Conference on Data Engineering, pp. 17\u201328 (2002)"},{"issue":"8","key":"32_CR6","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0306-4379(01)00042-4","volume":"26","author":"S Tejada","year":"2001","unstructured":"Tejada, S., Knoblock, C., Minton, S.: Learning object identification rules for information integration. Inf. Syst. 26(8), 607\u2013633 (2001)","journal-title":"Inf. Syst."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Mooney, R.: Adaptive duplicate detection using learnable string similarity measures. In: 9th International Conference on Knowledge Discovery and Data Mining, pp. 39\u201348 (2003)","DOI":"10.1145\/956750.956759"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Christen, P.: Automatic record linkage using seeded nearest neighbour and support vector machine classification. In: 14th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 151\u2013159 (2008)","DOI":"10.1145\/1401890.1401913"},{"issue":"130","key":"32_CR9","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1126\/science.130.3381.954","volume":"3381","author":"HB Newcombe","year":"1959","unstructured":"Newcombe, H.B., Kennedy, J.M., Axford, S.J., James, A.P.: Automatic linkage of vital records. Science 3381(130), 954\u2013959 (1959)","journal-title":"Science"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"83055","DOI":"10.1109\/ACCESS.2021.3086233","volume":"9","author":"C Lu","year":"2021","unstructured":"Lu, C., Huang, G.Y.: Entity resolution in sparse encounter network using Markov logic network. IEEE Access 9, 83055\u201383066 (2021)","journal-title":"IEEE Access"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-319-31750-2_27","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J Fisher","year":"2016","unstructured":"Fisher, J., Christen, P., Wang, Q.: Active learning based entity resolution using markov logic. In: Bailey, J., Khan, L., Washio, T., Dobbie, G., Huang, J.Z., Wang, R. (eds.) PAKDD 2016. LNCS (LNAI), vol. 9652, pp. 338\u2013349. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31750-2_27"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Culotta, A., McCallum, A.: Joint deduplication of multiple record types in relational data. In: 14th International Conference on Information and Knowledge Management, pp. 257\u2013258 (2005)","DOI":"10.1145\/1099554.1099615"},{"issue":"1\u20134","key":"32_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0020-0255(00)00013-X","volume":"126","author":"V Verykios","year":"2000","unstructured":"Verykios, V., Elmagarmid, A., Houstis, E.: Automating the approximate record-matching process. Inf. Sci. 126(1\u20134), 83\u201398 (2000)","journal-title":"Inf. Sci."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Arasu, A., G\u00f6tz, M., Kaushik, R.: On active learning of record matching packages. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 783\u2013794 (2010)","DOI":"10.1145\/1807167.1807252"},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10115-012-0507-8","volume":"35","author":"YF Fu","year":"2013","unstructured":"Fu, Y.F., Zhu, X.Q., Li, B.: A survey on instance selection for active learning. Knowl. Inf. Syst. 35(2), 249\u2013283 (2013)","journal-title":"Knowl. Inf. Syst."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"de Carvalho, M.G., Laender, A.H.F., Gon\u00e7alves, M.A., da Silva, A.S.: A genetic programming approach to record deduplication. IEEE Trans. Knowl. Data Eng. 24(3), 399\u2013412 (2012)","DOI":"10.1109\/TKDE.2010.234"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.websem.2013.06.001","volume":"23","author":"R Isele","year":"2013","unstructured":"Isele, R., Bizer, C.: Active learning of expressive linkage rules using genetic programming. J. Web Semant. 23, 2\u201315 (2013)","journal-title":"J. Web Semant."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1016\/j.procs.2020.03.416","volume":"167","author":"AK Sharma","year":"2020","unstructured":"Sharma, A.K., Chaurasia, S., Srivastava, D.K.: Sentimental short sentences classification by using CNN deep learning model with fine tuned Word2Vec. Procedia Comput. Sci. 167, 1139\u20131147 (2020)","journal-title":"Procedia Comput. Sci."},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.neucom.2019.01.078","volume":"337","author":"G Liu","year":"2019","unstructured":"Liu, G., Guo, J.B.: Bidirectional LSTM with attention mechanism and convolutional layer for text classification. Neurocomputing 337, 325\u2013338 (2019)","journal-title":"Neurocomputing"},{"issue":"4","key":"32_CR20","first-page":"385","volume":"1","author":"GW Flake","year":"2003","unstructured":"Flake, G.W., Tarjan, R.E., Tsioutsiouliklis, K.: Graph clustering and minimum cut trees. Int. Math. 1(4), 385\u2013408 (2003)","journal-title":"Int. Math."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Perbet, F., Stenger, B., Maki, A.: Random forest clustering and application to video segmentation. In: Proceedings of the 2009 British Machine Vision Conference, pp. 1\u201310 (2009)","DOI":"10.5244\/C.23.100"},{"issue":"17","key":"32_CR22","doi-asserted-by":"publisher","first-page":"2463","DOI":"10.1093\/bioinformatics\/btr406","volume":"27","author":"U Bodenhofer","year":"2011","unstructured":"Bodenhofer, U., Kothmeier, A., Hochreiter, S.: APCluster: an R package for affinity propagation clustering. Bioinformatics 27(17), 2463\u20132464 (2011)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87571-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:53:36Z","timestamp":1709834016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87571-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030875701","9783030875718"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87571-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaifeng","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wisa.org.cn\/wisa2021\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"206","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":"49","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":"18","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":"24% - 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":"6,5","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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}