{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:11:16Z","timestamp":1745467876323,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319047133"},{"type":"electronic","value":"9783319047140"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-04714-0_3","type":"book-chapter","created":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T12:37:54Z","timestamp":1393418274000},"page":"27-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Basic Triangle Inequality Approach Versus Metric VP-Tree and Projection in Determining Euclidean and Cosine Neighbors"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]},{"given":"Bart\u0142omiej","family":"Ja\u0144czak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,27]]},"reference":[{"key":"3_CR1","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: ICML\u201903, pp. 147\u2013153. Washington (2003)"},{"key":"3_CR2","unstructured":"Ja\u0144czak, B.: Density-based clustering and nearest neighborood search by means of the triangle inequality. M.Sc. Thesis, Warsaw University of Technology (2013)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: The triangle inequality versus projection onto a dimension in determining cosine similarity neighborhoods of non-negative vectors. In: RSCTC 2012, LNCS (LNAI) 7413, pp. 229\u2013236. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32115-3_27"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M.: Determining cosine similarity neighborhoods by means of the euclidean distance. In: Rough Sets and Intelligent Systems, Intelligent Systems Reference Library 43, pp. 323\u2013345. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-30341-8_17"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M., Lasek P.: TI-DBSCAN: clustering with DBSCAN by means of the triangle inequality. In: RSCTC 2010, LNCS (LNAI) 6086, pp. 60\u201369. Springer (2010)","DOI":"10.1007\/978-3-642-13529-3_8"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M., Lasek P.: A neighborhood-based clustering by means of the triangle inequality. In: IDEAL 2010, LNCS 6283, pp. 284\u2013291. Springer (2010)","DOI":"10.1007\/978-3-642-15381-5_35"},{"key":"3_CR7","unstructured":"Moore, A.W.: The anchors hierarchy: using the triangle inequality to survive high dimensional data. In: Proceeding of UAI, pp. 397\u2013405. Stanford (2000)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Patra, B.K., Hubballi, N., Biswas, S., Nandi, S.: Distance based fast hierarchical clustering method for large datasets. In: RSCTC 2010, pp. 50\u201359. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13529-3_7"},{"issue":"11","key":"3_CR9","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/361219.361220","volume":"18","author":"G Salton","year":"1975","unstructured":"Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Commun. ACM 18(11), 613\u2013620 (1975)","journal-title":"Commun. ACM"},{"key":"3_CR10","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann, San Francisco (2006)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Stonebraker, M., Frew, J., Gardels, K., Meredith, J.: The SEQUOIA 2000 storage benchmark. In: Proceeding of ACM SIGMOD, pp. 2\u201311. Washington (1993)","DOI":"10.1145\/170036.170038"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J Uhlmann","year":"1991","unstructured":"Uhlmann, J.: Satisfying general proximity\/similarity queries with metric trees. Inf. Process. Lett. 40(4), 175\u2013179 (1991)","journal-title":"Inf. Process. Lett."},{"key":"3_CR13","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. Philadelphia (1993)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Zezula, P., Amato, G., Dohnal, V., Bratko, M.: Similarity Search: The Metric Space Approach. Springer, Heidelberg (2006)","DOI":"10.1007\/0-387-29151-2"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009783824328","volume":"1","author":"T Zhang","year":"1997","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: a new data clustering algorithm and its applications. Data Min. Knowl. Disc. 1(2), 141\u2013182 (1997)","journal-title":"Data Min. Knowl. Disc."}],"container-title":["Studies in Computational Intelligence","Intelligent Tools for Building a Scientific Information Platform: From Research to Implementation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04714-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T13:01:16Z","timestamp":1676379676000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-04714-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319047133","9783319047140"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04714-0_3","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"27 February 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}