{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T04:07:32Z","timestamp":1750133252857,"version":"3.41.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/ijcnn.2017.7966218","type":"proceedings-article","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T21:41:30Z","timestamp":1499722890000},"page":"2927-2934","source":"Crossref","is-referenced-by-count":5,"title":["Improved maximum inner product search with better theoretical guarantees"],"prefix":"10.1109","author":[{"given":"Omid","family":"Keivani","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, USA"}]},{"given":"Kaushik","family":"Sinha","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS, USA"}]},{"given":"Parikshit","family":"Ram","sequence":"additional","affiliation":[{"name":"Skytree, Inc., Atlanta, GA, USA"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)","author":"shrivasatava","year":"2015","journal-title":"Conference on Uncertainty in Artificial Intelligence"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2645710.2645741"},{"key":"ref12","article-title":"On Symmetric and Asymmetric LSHs for Inner Product Search","author":"neyshabur","year":"2015","journal-title":"Proceedings of The 32nd International Conference on Machine Learning"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref14","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"The International Conference on Very Large Databases"},{"key":"ref15","article-title":"Locality-Sensitive Hashing Based on p-Stable Dis","author":"datar","year":"2004","journal-title":"Proc 20th ACM Symp Computational Geometry"},{"key":"ref16","article-title":"Randomized Partition Trees for Exact Nearest Neighbor Search","author":"dasgupta","year":"2013","journal-title":"Proceedings of the 26th Annual Conference on Learning Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-014-9885-5"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2014.13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339677"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.237"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864721"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.167"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206651"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5108-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"ref2","article-title":"Maximum margin matrix factorization","author":"srebro","year":"2005","journal-title":"19th Annual Conference on Neural Information Processing Systems"},{"key":"ref9","article-title":"Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS)","author":"shrivasatava","year":"2014","journal-title":"Annual Conference on Neural Information Processing Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.1"},{"key":"ref22","first-page":"117","article-title":"Texture features for browsing and retrieving of large image data","volume":"33","author":"manjunath","year":"1996","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11218"},{"journal-title":"Text Dat sets in Matlab Format","year":"2009","author":"cai","key":"ref24"},{"journal-title":"UCI Machine Learning Repository","year":"2013","author":"bache","key":"ref23"},{"journal-title":"Tree interpolation","year":"0","key":"ref25"}],"event":{"name":"2017 International Joint Conference on Neural Networks (IJCNN)","start":{"date-parts":[[2017,5,14]]},"location":"Anchorage, AK, USA","end":{"date-parts":[[2017,5,19]]}},"container-title":["2017 International Joint Conference on Neural Networks (IJCNN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7958416\/7965814\/07966218.pdf?arnumber=7966218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T18:51:58Z","timestamp":1750099918000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7966218\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2017.7966218","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}