{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:15:01Z","timestamp":1725488101651},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665991"},{"type":"electronic","value":"9783540480976"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48097-8_10","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T11:02:38Z","timestamp":1186052558000},"page":"116-127","source":"Crossref","is-referenced-by-count":4,"title":["Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval"],"prefix":"10.1007","author":[{"given":"Irwin","family":"King","sequence":"first","affiliation":[]},{"given":"Tak-Kan","family":"Lau","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"19","author":"N. Beckmann","year":"1990","unstructured":"N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. \u201cThe R*\u00adtree: an efficient and robust access method for points and rectangles\u201d. ACM SIGMOD Record, 19(2):322\u2013331, 1990.","journal-title":"ACM SIGMOD Record"},{"issue":"9","key":"10_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"J. L. Bentley. \u201cMultidimensional Binary Search Trees Used for Associative Searching\u201d. Communications of the ACM, 18(9):509\u2013517, 1975.","journal-title":"Communications of the ACM"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1145\/253262.253345","volume":"26","author":"T. Bozkaya","year":"1997","unstructured":"Tolga Bozkaya and Meral Ozsoyoglu. \u201cDistance-Based Indexing for High-dimensional Metric Spaces\u201d. SIGMOD Record, 26(2):357\u2013368, June 1997.","journal-title":"SIGMOD Record"},{"key":"10_CR4","unstructured":"T. C. Chiueh. \u201cContent-Based Image Indexing\u201d. In Proceedings of the 20th VLDB Conference, pages 582\u2013593, September 1994."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. A. Finkel","year":"1974","unstructured":"R. A. Finkel and J. L. Bentley. \u201cQuad Trees: A Data Structure for Retrieval on Composite Keys\u201d. Acta Informatica, 4(1):1\u20139, 1974.","journal-title":"Acta Informatica"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/971697.602266","volume":"14","author":"A. Guttman","year":"1984","unstructured":"A. Guttman. \u201cR-trees: A Dynamic Index Structure for Spatial Searching\u201d. ACM SIGMOD, 14(2):47\u201357, June 1984.","journal-title":"ACM SIGMOD"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1145\/253262.253347","volume":"26","author":"N. Katayama","year":"1997","unstructured":"Norio Katayama and Shinichi Satoh. \u201cThe SR-tree: an index structure for high-dimensional nearest neighbor queries\u201d. SIGMOD Record, 26(2):369\u2013380, June 1997.","journal-title":"SIGMOD Record"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"I. King, L. Xu, and L.W. Chan. Using rival penalized competitive clustering for feature indexing in Hong Kong\u2019s textile and fashion image database. In Proceedings to the International Joint Conference on Neural Networks (IJCNN\u201898), pages 237\u2013240. IEEE Computer Press, May 4\u20139, 1998.","DOI":"10.1109\/IJCNN.1998.682269"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1109\/5.58325","volume":"78","author":"T. Kohonen","year":"1990","unstructured":"T. Kohonen. The self-organizing map. Proc. IEEE, 78:1464\u20131480, 1990.","journal-title":"Proc. IEEE"},{"key":"10_CR10","unstructured":"R. Rosenblatt. Principles of Neurodynamics. Spartan Books, New York, 1959. neural networks."},{"key":"10_CR11","unstructured":"T. Sellis, N. Roussopoulos, and C. Faloutsos. \u201cThe R+-tree: a dynamic index for multidimensional objects\u201d. In Proceedings of the 13th VLDB Conference, pages 507\u2013518, 1987."},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/72.238318","volume":"4","author":"L. Xu","year":"1993","unstructured":"Lei Xu, Adam Krzy_zak, and Erkki Oja. Rival penalized competitive learning for clustering analysis, RBF net, and curve detection. IEEE Trans. on Neural Networks, 4(4):636\u2013649, 1993.","journal-title":"IEEE Trans. on Neural Networks"},{"key":"10_CR13","unstructured":"P. N. Yianilos. \u201cData structures and algorithms for nearest neighbor search in general metric spaces\u201d. In Proc. of the 4th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 311\u2013321, 1993."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48097-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T21:49:04Z","timestamp":1550440144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48097-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665991","9783540480976"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48097-8_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}