{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:12:08Z","timestamp":1730214728864,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/dsaa.2015.7344895","type":"proceedings-article","created":{"date-parts":[[2015,12,8]],"date-time":"2015-12-08T22:18:36Z","timestamp":1449613116000},"page":"1-7","source":"Crossref","is-referenced-by-count":1,"title":["Cluster-based data oriented hashing"],"prefix":"10.1109","author":[{"given":"Sanaa","family":"Chafik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imane","family":"Daoudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mounim A.","family":"El Yacoubi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"El Ouardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","first-page":"25","article-title":"Hierarchical K-means: an algorithm for centroids initialization for K-means","volume":"36","author":"kohei","year":"2007","journal-title":"Reports of The Faculty of Science and Engineering"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"ref30","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"david","year":"2007","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.193"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.219"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.5772\/37303"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2008.4607665"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/NGNS.2014.6990224"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref16","first-page":"1348","article-title":"Locality sensitive hashing: A comparison of hash function types and querying mechanisms","volume":"11","author":"loic","year":"2010","journal-title":"Pattern Recognition Letters 31"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.76"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140440"},{"key":"ref28","first-page":"1483","article-title":"Annosearch: Image auto-annotation by search","author":"wang","year":"2006","journal-title":"IEEE Conference on Computer Vision and Pattern Recognition"},{"key":"ref4","article-title":"A Simple Vector-Approximation File for Similarity Search in High-Dimensional Vector Spaces","author":"blott","year":"1997","journal-title":"Technical Report 19 ESPRIT project HERMES"},{"key":"ref27","article-title":"Query adaptative locality sensitive hashing","author":"herv\u00e9","year":"2008","journal-title":"Acoustics Speech and Signal Processing 2008 ICASSP 2008 IEEE International Conference on"},{"key":"ref3","first-page":"194","article-title":"A quantitative analysis and performance, study for similarity-search methods in high-dimensional spaces","author":"weber","year":"1998","journal-title":"Proceedings of 24rd International Conference on Very Large Data Bases New York USA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1198\/016214503000000666"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MINES.2010.153"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref2","first-page":"187","article-title":"K-d trees for semi dynamic point sets","author":"bentley","year":"1990","journal-title":"SOCG"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732947"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602266"},{"key":"ref20","article-title":"Spectral hashing","author":"yair","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref22","first-page":"1362","article-title":"Density sensitive hashing","volume":"8","author":"zhongming","year":"2014","journal-title":"Cybernetics IEEE Transactions on 44"},{"key":"ref21","article-title":"Hashing with graphs","author":"wei","year":"2011","journal-title":"Proceedings of the 28th International Conference on Machine Learning (ICML-11)"},{"key":"ref24","article-title":"Data-oriented locality sensitive hashing","author":"wei","year":"2010","journal-title":"Proceedings of the International Conference on Multimedia"},{"key":"ref23","article-title":"Hashing for similarity search: A survey","volume":"2927","author":"jingdong","year":"2014","journal-title":"Arxiv preprint arXiv"},{"key":"ref26","article-title":"Robust and Efficient Locality Sensitive Hashing for Nearest Neighbor Search in Large Data Sets","author":"byungkon","year":"2012","journal-title":"NIPS Workshop on Big Learning (BigLearn) Lake Tahoe Nevada"},{"key":"ref25","first-page":"82","article-title":"Large-Scale Distributed Locality-Sensitive Hashing for General Metric Data","author":"eliezer","year":"2014","journal-title":"Similarity Search and Applications"}],"event":{"name":"2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","start":{"date-parts":[[2015,10,19]]},"location":"Paris","end":{"date-parts":[[2015,10,21]]}},"container-title":["2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7344768\/7344769\/07344895.pdf?arnumber=7344895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,23]],"date-time":"2020-07-23T21:16:50Z","timestamp":1595539010000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7344895\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/dsaa.2015.7344895","relation":{},"subject":[],"published":{"date-parts":[[2015,10]]}}}