{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:19:28Z","timestamp":1773818368677,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819759330","type":"print"},{"value":"9789819759347","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-5934-7_29","type":"book-chapter","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T08:02:36Z","timestamp":1723449756000},"page":"341-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A New Approach to Deriving Jaccard Similarity and Jaccard Distance Properties with and without Considering Feature Weights"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4736-4031","authenticated-orcid":false,"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,13]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC\u20192002), pp. 380\u2013388. ACM Press, New York, NY (2002)","DOI":"10.1145\/509907.509965"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13160-012-0089-6","volume":"30","author":"O Fujita","year":"2013","unstructured":"Fujita, O.: Metrics based on average distance between sets. Jpn. J. Ind. Appl. Math. 30(1), 1\u201319 (2013)","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Gardner, A., Kanno, J., Duncan, C.A., Selmic, R.: Measuring distance between unordered sets of different sizes. In: Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR\u20192014), pp. 137\u2013143. IEEE, New Jersey, NJ (2014)","DOI":"10.1109\/CVPR.2014.25"},{"issue":"5368","key":"29_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1038\/239174c0","volume":"239","author":"G Gilbert","year":"1972","unstructured":"Gilbert, G.: Distance between sets. Lett. Nat. 239(5368), 174 (1972)","journal-title":"Lett. Nat."},{"key":"29_CR5","unstructured":"Gower, J.C.: Similarity, dissimilarity and distance, measures of. In: Kotz, S., Read, C.B., Balakrishnan, N., Vidakovic, B., (eds.), Encyclopedia of Statistical Sciences, vol. 12, pp. 7730\u20137738. 2nd edition, John Wiley, New York, NY (2008)"},{"key":"29_CR6","unstructured":"Jaccard, P.: Etude comparative de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Soci\u00b4et\u00b4e Vaudoise des Sciences Naturelles 37(142), 547\u2013579 (1901)"},{"key":"29_CR7","doi-asserted-by":"publisher","unstructured":"Kosub, S.: A note on the triangle inequality for the Jaccard distance. arXiv.org. 120. https:\/\/doi.org\/10.1016\/j.patrec.2018.12.007 (2016)","DOI":"10.1016\/j.patrec.2018.12.007"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: clustering with DBSCAN by means of the triangle inequality. RSCTC, 60\u201369 (2010)","DOI":"10.1007\/978-3-642-13529-3_8"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Lasek, P.: A neighborhood-based clustering by means of the triangle inequality. IDEAL, 284\u2013291 (2010)","DOI":"10.1007\/978-3-642-15381-5_35"},{"issue":"5323","key":"29_CR10","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1038\/234034a0","volume":"234","author":"M Levandowsky","year":"1971","unstructured":"Levandowsky, M., Winter, D.: Distance between sets. Lett. Nat. 234(5323), 34\u201335 (1971)","journal-title":"Lett. Nat."},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1019154432472","volume":"26","author":"AH Lipkus","year":"1999","unstructured":"Lipkus, A.H.: A proof of the triangle inequality for the Tanimoto distance. J. Math. Chem. 26, 263\u2013265 (1999)","journal-title":"J. Math. Chem."},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.4064\/cm-6-1-319-327","volume":"6","author":"E Marczewski","year":"1958","unstructured":"Marczewski, E., Steinhaus, H.: On a certain distance of sets and the corresponding distance of functions. Colloq. Math. 6, 319\u2013327 (1958)","journal-title":"Colloq. Math."},{"key":"29_CR13","unstructured":"Moore, A. W.: The anchors hierarchy: using the triangle inequality to survive high dimensional data. In: Proceedings of UAI, Stanford, pp. 397\u2013405 (2000)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets. Cambridge University Press (2011)","DOI":"10.1017\/CBO9781139058452"},{"key":"29_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-6407-4","volume-title":"Mathematical Tools for Data Mining","author":"DA Simovici","year":"2008","unstructured":"Simovici, D.A., Djeraba, C.: Mathematical Tools for Data Mining. Springer, London (2008). https:\/\/doi.org\/10.1007\/978-1-4471-6407-4"},{"key":"29_CR16","unstructured":"Tanimoto, T.T.: An elementary mathematical theory of classification and prediction. IBM Report (1958)"},{"key":"29_CR17","unstructured":"Yanilos, P.N.: Data structures and algorithms of nearest neighbor search in general metric spaces. In: Proceedings of 4th ACM-SIAM Symposium on Descrete Algorithms, pp. 311\u2013321 (1993)"},{"key":"29_CR18","doi-asserted-by":"publisher","unstructured":"Zezula, P., Amato, G., Dohnal, V., Bratko, M.: Similarity Search: The Metric Space Approach. Springer (2006). https:\/\/doi.org\/10.1007\/0-387-29151-2","DOI":"10.1007\/0-387-29151-2"}],"container-title":["Communications in Computer and Information Science","Recent Challenges in Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5934-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T06:05:54Z","timestamp":1733119554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5934-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819759330","9789819759347"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5934-7_29","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACIIDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Intelligent Information and Database Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ras Al Khaimah","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aciids2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aciids.pwr.edu.pl\/2024\/index.php#about","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}