{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T20:03:57Z","timestamp":1778875437531,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031149221","type":"print"},{"value":"9783031149238","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-14923-8_17","type":"book-chapter","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T12:06:36Z","timestamp":1660392396000},"page":"256-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Never Judge a\u00a0Case by\u00a0Its (Unreliable) Neighbors: Estimating Case Reliability for\u00a0CBR"],"prefix":"10.1007","author":[{"given":"Adwait P.","family":"Parsodkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deepak","family":"P.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sutanu","family":"Chakraborti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Deepak, P., Chakraborti, S., Khemani, D.: More or better: on trade-offs in compacting textual problem solution repositories. In: CIKM, pp. 2321\u20132324 (2011)","DOI":"10.1145\/2063576.2063956"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Ganesan, D., Chakraborti, S.: An empirical study of knowledge tradeoffs in case-based reasoning. In: IJCAI, pp. 1817\u20131823 (2018)","DOI":"10.24963\/ijcai.2018\/251"},{"key":"17_CR3","unstructured":"Ganesan, D., Chakraborti, S.: A reachability-based complexity measure for case-based reasoners. In: The Thirty-Second International Flairs Conference (2019)"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM (JACM) 46(5), 604\u2013632 (1999)","journal-title":"J. ACM (JACM)"},{"key":"17_CR5","unstructured":"Lamontagne, L.: Textual CBR authoring using case cohesion. In: Proceedings of 3rd Textual Case-Based Reasoning Workshop at the 8th European Conference on CBR, pp. 33\u201343 (2006)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-74141-1_14","volume-title":"Case-Based Reasoning Research and Development","author":"D Leake","year":"2007","unstructured":"Leake, D., Whitehead, M.: Case provenance: the value of remembering case sources. In: Weber, R.O., Richter, M.M. (eds.) ICCBR 2007. LNCS (LNAI), vol. 4626, pp. 194\u2013208. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74141-1_14"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Li, Q., Li, Y., Gao, J., Zhao, B., Fan, W., Han, J.: Resolving conflicts in heterogeneous data by truth discovery and source reliability estimation. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1187\u20131198 (2014)","DOI":"10.1145\/2588555.2610509"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2897350.2897352","volume":"17","author":"Y Li","year":"2016","unstructured":"Li, Y., et al.: A survey on truth discovery. ACM SIGKDD Explor. Newsl. 17(2), 1\u201316 (2016)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-74141-1_25","volume-title":"Case-Based Reasoning Research and Development","author":"S Massie","year":"2007","unstructured":"Massie, S., Wiratunga, N., Craw, S., Donati, A., Vicari, E.: From anomaly reports to cases. In: Weber, R.O., Richter, M.M. (eds.) ICCBR 2007. LNCS (LNAI), vol. 4626, pp. 359\u2013373. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74141-1_25"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Mathew, D., Chakraborti, S.: Competence guided model for casebase maintenance. In: IJCAI, pp. 4904\u20134908 (2017)","DOI":"10.24963\/ijcai.2017\/691"},{"key":"17_CR11","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/3-540-63233-6_524","volume-title":"Case-Based Reasoning Research and Development","author":"K Racine","year":"1997","unstructured":"Racine, K., Yang, Q.: Maintaining unstructured case bases. In: Leake, D.B., Plaza, E. (eds.) ICCBR 1997. LNCS, vol. 1266, pp. 553\u2013564. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63233-6_524"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-540-85502-6_30","volume-title":"Advances in Case-Based Reasoning","author":"MA Raghunandan","year":"2008","unstructured":"Raghunandan, M.A., Wiratunga, N., Chakraborti, S., Massie, S., Khemani, D.: Evaluation measures for TCBR systems. In: Althoff, K.-D., Bergmann, R., Minor, M., Hanft, A. (eds.) ECCBR 2008. LNCS (LNAI), vol. 5239, pp. 444\u2013458. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85502-6_30"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-48508-2_25","volume-title":"Case-Based Reasoning Research and Development","author":"B Smyt","year":"1999","unstructured":"Smyt, B., McKenna, E.: Footprint-based retrieval. In: Althoff, K.-D., Bergmann, R., Branting, L.K. (eds.) ICCBR 1999. LNCS, vol. 1650, pp. 343\u2013357. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48508-2_25"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/3-540-64574-8_436","volume-title":"Tasks and Methods in Applied Artificial Intelligence","author":"B Smyth","year":"1998","unstructured":"Smyth, B.: Case-base maintenance. In: Pasqual del Pobil, A., Mira, J., Ali, M. (eds.) IEA\/AIE 1998. LNCS, vol. 1416, pp. 507\u2013516. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-64574-8_436"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-030-02922-7_29","volume-title":"Web Information Systems Engineering \u2013 WISE 2018","author":"Y Yang","year":"2018","unstructured":"Yang, Y., Bai, Q., Liu, Q.: On the discovery of continuous truth: a semi-supervised approach with partial ground truths. In: Hacid, H., Cellary, W., Wang, H., Paik, H.-Y., Zhou, R. (eds.) WISE 2018. LNCS, vol. 11233, pp. 424\u2013438. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02922-7_29"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Yin, X., Tan, W.: Semi-supervised truth discovery. In: Proceedings of the 20th International Conference on World Wide Web, pp. 217\u2013226 (2011)","DOI":"10.1145\/1963405.1963439"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Zhao, B., Rubinstein, B.I., Gemmell, J., Han, J.: A Bayesian approach to discovering truth from conflicting sources for data integration. arXiv preprint arXiv:1203.0058 (2012)","DOI":"10.14778\/2168651.2168656"}],"container-title":["Lecture Notes in Computer Science","Case-Based Reasoning Research and Development"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14923-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T17:28:10Z","timestamp":1727803690000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14923-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031149221","9783031149238"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14923-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCBR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Case-Based Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccbr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccbr2022.loria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"68","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":"26","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":"38% - 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":"3","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":"4","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)"}}]}}