{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:21:44Z","timestamp":1743654104874,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642310867"},{"type":"electronic","value":"9783642310874"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31087-4_6","type":"book-chapter","created":{"date-parts":[[2012,6,29]],"date-time":"2012-06-29T11:54:10Z","timestamp":1340970850000},"page":"48-57","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Determination of Binary Non-negative Vector Neighbors with Regard to Cosine Similarity"],"prefix":"10.1007","author":[{"given":"Marzena","family":"Kryszkiewicz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","first-page":"232","volume":"60","author":"E. Leo","year":"2009","unstructured":"Leo, E.: New relations between similarity measures for vectors based on vector norms. ASIS&T Journal\u00a060(2), 232\u2013239 (2009)","journal-title":"ASIS&T Journal"},{"key":"6_CR2","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":"6_CR3","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":"6_CR4","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":"6_CR5","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":"6_CR6","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"},{"issue":"1-3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1019154432472","volume":"26","author":"A.H. Lipkus","year":"1999","unstructured":"Lipkus, A.H.: A proof of the triangle inequality for the Tanimoto dissimilarity. Journal of Mathematical Chemistry\u00a026(1-3), 263\u2013265 (1999)","journal-title":"Journal of Mathematical Chemistry"},{"key":"6_CR8","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":"6_CR9","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":"6","key":"6_CR10","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.\u00a038(6), 983\u2013996 (1998)","journal-title":"J. Chem. Inf. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Advanced Research in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31087-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T22:57:30Z","timestamp":1743634650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31087-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642310867","9783642310874"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31087-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}