{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:40:08Z","timestamp":1743975608816,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303401"},{"type":"electronic","value":"9783642303418"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-30341-8_17","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T14:30:18Z","timestamp":1344868218000},"page":"323-345","source":"Crossref","is-referenced-by-count":5,"title":["Determining Cosine Similarity Neighborhoods by Means of the Euclidean Distance"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: Proceedings of the Twentieth International Conference on Machine Learning (ICML 2003), Washington, DC, USA, August 21-24, pp. 147\u2013153. AAAI Press (2003)"},{"key":"17_CR2","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial database with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996), Portland, Oregon, USA, August 2-4, pp. 226\u2013231. AAAI Press (1996)"},{"key":"17_CR3","unstructured":"Blott, S., Weber, R.: A simple vector approximation file for similarity search in highdimensional vector spaces. Technical Report 19, ESPRIT project HERMES, vol. 9141 (1997)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: SIGMOD 1984, Proceedings of Annual Meeting, Boston, Massachusetts, USA, June 18-21. ACM SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: Clustering with DBSCAN by means of the triangle inequality. ICS Research Report 3, Institute of Computer Science, Warsaw University of Technology, Warsaw (2010)","DOI":"10.1007\/978-3-642-13529-3_8"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","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\u00a0Triangle Inequality. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol.\u00a06086, pp. 60\u201369. Springer, Heidelberg (2010)"},{"key":"17_CR7","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.\u00a06283, pp. 284\u2013291. Springer, Heidelberg (2010)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz, M., Lasek, P.: A neighborhood-based clustering by means of the triangle inequality and reference points. ICS Research Report 3, Institute of Computer Science, Warsaw University of Technology, Warsaw (2011)","DOI":"10.1007\/978-3-642-15381-5_35"},{"key":"17_CR9","unstructured":"Kryszkiewicz, M.: Efficient determination of neighborhoods defined in terms of cosine similarity measure. ICS Research Report 4, Institute of Computer Science, Warsaw University of Technology, Warsaw (2011)"},{"key":"17_CR10","first-page":"397","volume-title":"Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence (UAI 2000)","author":"A.W. Moore","year":"2000","unstructured":"Moore, A.W.: The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence (UAI 2000), Stanford, California, USA, June 30-July 3, pp. 397\u2013405. Morgan Kaufmann, San Francisco (2000)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-13529-3_7","volume-title":"Rough Sets and Current Trends in Computing","author":"B.K. Patra","year":"2010","unstructured":"Patra, B.K., Hubballi, N., Biswas, S., Nandi, S.: Distance Based Fast Hierarchical Clustering Method for Large Datasets. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol.\u00a06086, pp. 50\u201359. Springer, Heidelberg (2010)"},{"issue":"11","key":"17_CR12","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. Communications of the ACM\u00a018(11), 613\u2013620 (1975)","journal-title":"Communications of the ACM"},{"key":"17_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/11430919_43","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S. Zhou","year":"2005","unstructured":"Zhou, S., Zhao, Y., Guan, J., Huang, J.Z.: A Neighborhood-Based Clustering Algorithm. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 361\u2013371. Springer, Heidelberg (2005)"}],"container-title":["Intelligent Systems Reference Library","Rough Sets and Intelligent Systems - Professor Zdzis\u0142aw Pawlak in Memoriam"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30341-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:07:44Z","timestamp":1743973664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30341-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642303401","9783642303418"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30341-8_17","relation":{},"ISSN":["1868-4394","1868-4408"],"issn-type":[{"type":"print","value":"1868-4394"},{"type":"electronic","value":"1868-4408"}],"subject":[],"published":{"date-parts":[[2013]]}}}