{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:05:38Z","timestamp":1751760338304,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030873332"},{"type":"electronic","value":"9783030873349"}],"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-87334-9_2","type":"book-chapter","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T18:50:32Z","timestamp":1631904632000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Determining Tanimoto Similarity Neighborhoods of Real-Valued Vectors by Means of the Triangle Inequality and Bounds on Lengths"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,16]]},"reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s41060-017-0064-z","volume":"4","author":"DC Anastasiu","year":"2017","unstructured":"Anastasiu, D.C., Karypis, G.: Efficient identification of Tanimoto nearest neighbors. Int. J. Data Sci. Anal. 4(3), 153\u2013172 (2017). https:\/\/doi.org\/10.1007\/s41060-017-0064-z","journal-title":"Int. J. Data Sci. Anal."},{"key":"2_CR2","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: ICML\u201903, pp. 147\u2013153, Washington (2003)"},{"key":"2_CR3","unstructured":"Kryszkiewicz, M.: Efficient determination of neighborhoods defined in terms of cosine similarity measure, ICS Research Report 4\/2011, Warsaw University of Technology (2011)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-32115-3_27","volume-title":"Rough Sets and Current Trends in Computing","author":"M Kryszkiewicz","year":"2012","unstructured":"Kryszkiewicz, M.: The triangle inequality versus projection onto a dimension in determining cosine similarity neighborhoods of non-negative vectors. In: Yao, JingTao, et al. (eds.) RSCTC 2012. LNCS (LNAI), vol. 7413, pp. 229\u2013236. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32115-3_27"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-31087-4_6","volume-title":"Advanced Research in Applied Artificial Intelligence","author":"M Kryszkiewicz","year":"2012","unstructured":"Kryszkiewicz, M.: Efficient determination of binary non-negative vector neighbors with regard to cosine similarity. In: Jiang, H., Ding, W., Ali, M., Wu, X. (eds.) IEA\/AIE 2012. LNCS (LNAI), vol. 7345, pp. 48\u201357. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31087-4_6"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-642-30341-8_17","volume-title":"Rough Sets and Intelligent Systems, Intelligent Systems Reference Library","author":"M Kryszkiewicz","year":"2013","unstructured":"Kryszkiewicz, M.: Determining cosine similarity neighborhoods by means of the euclidean distance. In: Skowron, A., Suraj, Z. (eds.) Rough Sets and Intelligent Systems, Intelligent Systems Reference Library, vol. 43, pp. 323\u2013345. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-30341-8_17"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-36546-1_46","volume-title":"Intelligent Information and Database Systems","author":"M Kryszkiewicz","year":"2013","unstructured":"Kryszkiewicz, M.: Bounds on lengths of real valued vectors similar with regard to the Tanimoto similarity. In: Selamat, A., Nguyen, N.T., Haron, H. (eds.) ACIIDS 2013. LNCS (LNAI), vol. 7802, pp. 445\u2013454. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36546-1_46"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-40769-7_46","volume-title":"Flexible Query Answering Systems","author":"M Kryszkiewicz","year":"2013","unstructured":"Kryszkiewicz, M.: On cosine and Tanimoto near duplicates search among vectors with domains consisting of zero, a positive number and a negative number. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds.) FQAS 2013. LNCS (LNAI), vol. 8132, pp. 531\u2013542. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40769-7_46"},{"issue":"1\u20134","key":"2_CR9","first-page":"307","volume":"127","author":"M Kryszkiewicz","year":"2013","unstructured":"Kryszkiewicz, M.: Using non-zero dimensions for the cosine and Tanimoto similarity search among real valued vectors. Fund. Inform. 127(1\u20134), 307\u2013323 (2013)","journal-title":"Fund. Inform."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: The cosine similarity in terms of the Euclidean distance. In: Encyclopedia of Business Analytics and Optimization (2014)","DOI":"10.4018\/978-1-4666-5202-6.ch223"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-05476-6_18","volume-title":"Intelligent Information and Database Systems","author":"M Kryszkiewicz","year":"2014","unstructured":"Kryszkiewicz, M.: Using non-zero dimensions and lengths of vectors for the Tanimoto similarity search among real valued vectors. In: Nguyen, N.T., Attachoo, B., Trawi\u0144ski, B., Somboonviwat, K. (eds.) ACIIDS 2014. LNCS (LNAI), vol. 8397, pp. 173\u2013182. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05476-6_18"},{"key":"2_CR12","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-04714-0_3","volume-title":"Intelligent Tools for Building a Scientific Information Platform: From Research to Implementation","author":"M Kryszkiewicz","year":"2014","unstructured":"Kryszkiewicz, M., Ja\u0144czak, B.: Basic triangle inequality approach versus metric VP-tree and projection in determining Euclidean and cosine neighbors. In: Bembenik, R., Skonieczny, \u0141, Rybi\u0144ski, H., Kryszkiewicz, M., Niezg\u00f3dka, M. (eds.) Intelligent Tools for Building a Scientific Information Platform: From Research to Implementation. SCI, vol. 541, pp. 27\u201349. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04714-0_3"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: clustering with DBSCAN by means of the triangle inequality, ICS Research Report 3\/2010, Warsaw University of Technology (2010)","DOI":"10.1007\/978-3-642-13529-3_8"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-13529-3_8","volume-title":"Rough Sets and Current Trends in Computing","author":"M Kryszkiewicz","year":"2010","unstructured":"Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: clustering with DBSCAN by means of the triangle inequality. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LN CS, vol. 6086, pp. 60\u201369. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13529-3_8"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-15381-5_35","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2010","author":"M Kryszkiewicz","year":"2010","unstructured":"Kryszkiewicz, M., Lasek, P.: A neighborhood-based clustering by means of the\u00a0triangle inequality. In: Fyfe, C., Tino, P., Charles, D., Garcia-Osorio, C., Yin, H. (eds.) IDEAL 2010. LNCS, vol. 6283, pp. 284\u2013291. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15381-5_35"},{"key":"2_CR16","unstructured":"Kryszkiewicz, M., Lasek, P.: A neighborhood-based clustering by means of the triangle inequality and reference points, ICS Research Report 3\/2011, Warsaw University of Technology (2011)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Podsiadly, P.: Efficient search of cosine and Tanimoto near duplicates among vectors with domains consisting of zero, a positive number and a negative number. IEA\/AIE (2), 160\u2013170 (2014)","DOI":"10.1007\/978-3-319-07467-2_17"},{"key":"2_CR18","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":"2_CR19","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)"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Inf. Process. Lett. 40(4), 175\u2013179 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"2_CR21","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1021\/ci9800211","volume":"38","author":"P Willett","year":"1998","unstructured":"Willett, P., Barnard, J.M., Downs, G.M.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6), 983\u2013996 (1998)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"2_CR22","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":"2_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: The Metric Space Approach","author":"P Zezula","year":"2006","unstructured":"Zezula, P., Amato, G., Dohnal, V., Bratko, M.: Similarity Search: The Metric Space Approach. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87334-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:28:53Z","timestamp":1710246533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87334-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030873332","9783030873349"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87334-9_2","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":"16 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCRS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rough Sets","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"19 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcrs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ifsa-eusflat2021.eu\/","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":"26","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":"13","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":"7","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":"50% - 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":"1","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)"}}]}}