{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:26:11Z","timestamp":1781101571032,"version":"3.54.1"},"reference-count":18,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,1]]},"abstract":"<p>This article presents a new approximate index structure, the Bregman hyperplane tree, for indexing the Bregman divergence, aiming to decrease the number of distance computations required at query processing time, by sacrificing some accuracy in the result. The experimental results on various high-dimensional data sets demonstrate that the proposed index structure performs comparably to the state-of-the-art Bregman ball tree in terms of search performance and result quality. Moreover, this method results in a speedup of well over an order of magnitude for index construction. The authors also apply their space partitioning principle to the Bregman ball tree and obtain a new index structure for exact nearest neighbor search that is faster to build and a slightly slower at query processing than the original.<\/p>","DOI":"10.4018\/jmdem.2012100104","type":"journal-article","created":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T12:26:23Z","timestamp":1361967983000},"page":"75-87","source":"Crossref","is-referenced-by-count":0,"title":["Bregman Hyperplane Trees for Fast Approximate Nearest Neighbor Search"],"prefix":"10.4018","volume":"3","author":[{"given":"Bilegsaikhan","family":"Naidan","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Magnus Lie","family":"Hetland","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jmdem.2012100104-0","first-page":"3","article-title":"Latent Dirichlet allocation.","author":"D. M.Blei","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"jmdem.2012100104-1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"jmdem.2012100104-2","doi-asserted-by":"crossref","unstructured":"Cayton, L. (2008). Fast nearest neighbor retrieval for bregman divergences. In Proceedings of the 25th International Conference on Machine Learning, (ICML \u201908) (pp. 112\u2013119).","DOI":"10.1145\/1390156.1390171"},{"key":"jmdem.2012100104-3","unstructured":"Everingham, M., Van Gool, L., Williams, C. K. I., Winn, J., & Zisserman, A. (2007). The PASCAL visual object classes challenge 2007 results."},{"key":"jmdem.2012100104-4","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proceedings of the International Conference on Management of Data (pp. 47\u201357).","DOI":"10.1145\/971697.602266"},{"key":"jmdem.2012100104-5","first-page":"36","article-title":"A statistical method for estimation of speech spectral density and formant frequencies.","volume":"53","author":"F.Itakura","year":"1970","journal-title":"Electronics and Communications in Japan"},{"key":"jmdem.2012100104-6","first-page":"5","article-title":"Rcv1: A new benchmark collection for text categorization research.","author":"D. D.Lewis","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"jmdem.2012100104-7","unstructured":"Liu, T., Moore, A. W., Gray, E., & Yang, K. (2004). An investigation of practical approximate nearest neighbor algorithms. In Proceedings of the 18th Annual Conference on Neural Information Processing Systems."},{"key":"jmdem.2012100104-8","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"jmdem.2012100104-9","doi-asserted-by":"crossref","unstructured":"Nielsen, F., Boissonnat, J.-D., & Nock, R. (2007). On Bregman Voronoi diagrams. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA \u201907) (pp. 746\u2013755).","DOI":"10.1145\/1247069.1247089"},{"key":"jmdem.2012100104-10","doi-asserted-by":"crossref","unstructured":"Nowak, E., Jurie, F., & Triggs, B. (2006). Sampling strategies for bag-of-features image classification. In Proceedings of the European Conference on Computer Vision.","DOI":"10.1007\/11744085_38"},{"key":"jmdem.2012100104-11","first-page":"9","article-title":"Bridging the gap: Query by semantic example.","author":"N.Rasiwasia","year":"2007","journal-title":"IEEE Transactions on Multimedia"},{"key":"jmdem.2012100104-12","doi-asserted-by":"crossref","unstructured":"Rubner, Y., Puzicha, J., Tomasi, C., & Buhmann, J. M. (1999, September 20-27). Empirical evaluation of dissimilarity measures for color and texture. In Proceedings of the 7th IEEE International Conference on Computer Vision, Kerkyra, Greece (pp. 1165\u20131173).","DOI":"10.1109\/ICCV.1999.790412"},{"key":"jmdem.2012100104-13","author":"H.Samet","year":"2005","journal-title":"Foundations of multidimensional and metric data structures (The Morgan Kaufmann series in computer graphics and geometric modeling)"},{"key":"jmdem.2012100104-14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"jmdem.2012100104-15","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces.","volume":"98","author":"R.Weber","year":"1998","journal-title":"Proceedings of VLDB"},{"key":"jmdem.2012100104-16","author":"P.Zezula","year":"2006","journal-title":"Similarity search: The metric space approach"},{"key":"jmdem.2012100104-17","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Chin, B., Srinivasan, O., Anthony, P., & Tung, K. H. (2009, August 24-28). Similarity search on bregman divergence: Towards non-metric indexing. In Proceedings of the 35th International Conference on Very Large Data Bases, Lyon, France.","DOI":"10.14778\/1687627.1687630"}],"container-title":["International Journal of Multimedia Data Engineering and Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=75457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T17:45:21Z","timestamp":1654105521000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jmdem.2012100104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,10,1]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jmdem.2012100104","relation":{},"ISSN":["1947-8534","1947-8542"],"issn-type":[{"value":"1947-8534","type":"print"},{"value":"1947-8542","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,1]]}}}