{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T11:47:01Z","timestamp":1783424821026,"version":"3.54.6"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tcyb.2016.2591068","type":"journal-article","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T14:48:36Z","timestamp":1477061316000},"page":"3941-3954","source":"Crossref","is-referenced-by-count":75,"title":["Unsupervised Topic Hypergraph Hashing for Efficient Mobile Image Retrieval"],"prefix":"10.1109","volume":"47","author":[{"given":"Lei","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4560-8509","authenticated-orcid":false,"given":"Jialie","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.267"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2733373.2806341"},{"key":"ref33","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2733373.2806360"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.MOBIMEDIA2009.7406"},{"key":"ref37","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835455"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2207394"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.267"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339678"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2207397"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2285219"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288382"},{"key":"ref27","first-page":"1","article-title":"Graph-based clustering and ranking for diversified image search","author":"yan","year":"2014","journal-title":"Multimedia Syst"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2383389"},{"key":"ref66","author":"avriel","year":"1976","journal-title":"Nonlinear Programming Analysis and Methods"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1117\/12.805982"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-011-0472-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1348246.1348248"},{"key":"ref20","first-page":"1360","article-title":"Learning hash functions for cross-view similarity search","author":"kumar","year":"2011","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465274"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009950"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1873987"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2008.917359"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.170"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2461466.2461497"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2199502"},{"key":"ref51","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume":"1","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Stat Probab"},{"key":"ref59","first-page":"321","article-title":"Learning with local and global consistency","author":"zhou","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1109\/TIP.2010.2044958","article-title":"Flexible manifold embedding: A framework for semi-supervised and unsupervised dimension reduction","volume":"19","author":"nie","year":"2010","journal-title":"IEEE Trans Image Process"},{"key":"ref57","first-page":"2598","article-title":"Multi-view k-means clustering on big data","author":"cai","year":"2013","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.218"},{"key":"ref55","first-page":"1713","article-title":"Non-negative multiple matrix factorization","author":"takeuchi","year":"2013","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref54","first-page":"1813","article-title":"Efficient and robust feature selection via joint $\\ell 2$ , 1-norms minimization","author":"nie","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref53","first-page":"1589","article-title":"l2, 1-norm regularized discriminative feature selection for unsupervised learning","author":"yang","year":"2011","journal-title":"Proc Intern Joint Conf Artificial Intel (IJCAI)"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2392052"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2414299"},{"key":"ref40","first-page":"538","article-title":"Sequential spectral learning to hash with multiple representations","author":"kim","year":"2012","journal-title":"Proc Eur Conf Comput Vis (ECCV)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2360856"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2281366"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2283497"},{"key":"ref15","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2515990"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2733373.2806345"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2013.2293063"},{"key":"ref3","first-page":"3005","article-title":"Mobile product search with bag of hash bits and boundary reranking","author":"he","year":"2012","journal-title":"Proc IEEE Int Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref6","article-title":"Hashing for similarity search: A survey","volume":"abs 1408 2927","author":"wang","year":"2014","journal-title":"CoRR"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2011.940881"},{"key":"ref8","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref7","first-page":"1","article-title":"Learning in high-dimensional multimedia data: The state of the art","author":"gao","year":"2015","journal-title":"Multimedia Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2202676"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2289351"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2012.10.026"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299066"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540012"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2011.2169269"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2425651"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2013.2271746"},{"key":"ref44","first-page":"1969","article-title":"The constrained Laplacian rank algorithm for graph-based clustering","author":"nie","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2390975"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/8067607\/07605530.pdf?arnumber=7605530","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:41:00Z","timestamp":1641987660000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7605530\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":66,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2016.2591068","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}