{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:22:17Z","timestamp":1735582937556},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,4]],"date-time":"2012-02-04T00:00:00Z","timestamp":1328313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1007\/s10618-012-0249-y","type":"journal-article","created":{"date-parts":[[2012,2,3]],"date-time":"2012-02-03T02:31:45Z","timestamp":1328236305000},"page":"255-274","source":"Crossref","is-referenced-by-count":19,"title":["Active hashing and its application to image and text retrieval"],"prefix":"10.1007","volume":"26","author":[{"given":"Yi","family":"Zhen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dit-Yan","family":"Yeung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,4]]},"reference":[{"key":"249_CR1","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Proceedings of the 47th annual IEEE symposium on foundations of computer science, FOCS \u201906, IEEE Computer Society, Washington, pp 459\u2013468","DOI":"10.1109\/FOCS.2006.49"},{"issue":"4","key":"249_CR2","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin D (1988) Queries and concept learning. Mach Learn 2(4): 319\u2013342","journal-title":"Mach Learn"},{"issue":"6","key":"249_CR3","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM 45(6): 891\u2013923","journal-title":"J ACM"},{"key":"249_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522546.001.0001","volume-title":"Optimum experimental designs","author":"AC Atkinson","year":"1992","unstructured":"Atkinson AC, Donev A (1992) Optimum experimental designs. Oxford University Press, New York, NY"},{"key":"249_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge, UK"},{"key":"249_CR6","doi-asserted-by":"crossref","unstructured":"Bronstein MM, Bronstein AM, Michel F, Paragios N (2010) Data fusion through cross-modality metric learning using similarity-sensitive hashing. In: Proceedings of IEEE conference on computer vision and pattern recognition [46], pp 3594\u20133601","DOI":"10.1109\/CVPR.2010.5539928"},{"issue":"2","key":"249_CR7","first-page":"201","volume":"15","author":"D Cohn","year":"1994","unstructured":"Cohn D, Atlas L, Ladner R (1994) Improving generalization with active learning. Mach Learn 15(2): 201\u2013221","journal-title":"Mach Learn"},{"key":"249_CR8","doi-asserted-by":"crossref","unstructured":"Eshghi K, Rajaram S (2008) Locality sensitive hash functions based on concomitant rank order statistics. In: Proceeding of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201908, ACM, New York, pp 221\u2013229","DOI":"10.1145\/1401890.1401921"},{"key":"249_CR9","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund Y, Iyer R, Schapire RE, Singer Y (2003) An efficient boosting algorithm for combining preferences. J Mach Learn Res 4: 933\u2013969","journal-title":"J Mach Learn Res"},{"issue":"3","key":"249_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time. ACM Transac Math Softw 3(3): 209\u2013226","journal-title":"ACM Transac Math Softw"},{"key":"249_CR11","unstructured":"Guo Y, Greiner R (2007) Optimistic active learning using mutual information. In: Veloso MM (ed) Proceedings of the 20th international joint conference on artificial intelligence, IJCAI \u201907, pp 823\u2013829"},{"key":"249_CR12","unstructured":"Guo Y, Schuurmans D (2007) Discriminative batch mode active learning. In: Platt JC, Koller D, Singer Y, Roweis S (eds), Advances in neural information processing systems 20, NIPS 20, The MIT Press, Cambridge, MA, pp 593\u2013600"},{"key":"249_CR13","doi-asserted-by":"crossref","unstructured":"He J, Liu W, Chang S-F (2010) Scalable similarity search with optimized kernel hashing. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201910, ACM, New York, pp 1129\u20131138","DOI":"10.1145\/1835804.1835946"},{"key":"249_CR14","doi-asserted-by":"crossref","unstructured":"He X, Min W, Cai D, Zhou K (2007) Laplacian optimal design for image retrieval. In: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201907, ACM, New York, pp 119\u2013126","DOI":"10.1145\/1277741.1277764"},{"key":"249_CR15","doi-asserted-by":"crossref","unstructured":"Hoi SCH, Jin R, Zhu J, Lyu MR (2006a) Batch mode active learning and its application to medical image classification. In: Proceedings of the 23rd international conference on machine learning [45], pp 417-424","DOI":"10.1145\/1143844.1143897"},{"key":"249_CR16","doi-asserted-by":"crossref","unstructured":"Hoi SCH, Jin R, Lyu MR (2006b) Large-scale text categorization by batch mode active learning. In: Proceedings of the 15th international conference on world wide web, WWW \u201906, ACM, New York, pp 633\u2013642","DOI":"10.1145\/1135777.1135870"},{"key":"249_CR17","doi-asserted-by":"crossref","unstructured":"Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: Proceeding of the 14th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201908, ACM, New York, pp 426\u2013434","DOI":"10.1145\/1401890.1401944"},{"key":"249_CR18","unstructured":"Kulis B, Darrell T (2009) Learning to hash with binary reconstructive embeddings. In: Bengio Y, Schuurmans D, Lafferty J, Williams CKI, Culotta A (eds) Advances in neural information processing systems 22, NIPS 22, The MIT Press, Cambridge, MA, pp 1042\u20131050"},{"key":"249_CR19","doi-asserted-by":"crossref","unstructured":"Kulis B, Grauman K (2009) Kernelized locality-sensitive hashing for scalable image search. In: Proceedings of IEEE 12th international conference on computer vision, ICCV \u201909, IEEE Computer Society, Washington, pp 2130\u20132137","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"249_CR20","unstructured":"Lewis DD, Gale WA (1994) A sequential algorithm for training text classifiers. In Proceedings of the 17th annual international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201994, Springer-Verlag New York, Inc., New York, pp 3\u201312"},{"key":"249_CR21","unstructured":"Lin R-S, Ross DA, Yagnik J (2010) SPEC hashing: similarity preserving algorithm for entropy-based coding. In: Proceedings of IEEE conference on computer vision and pattern recognition [46], pp 848\u2013854"},{"issue":"4","key":"249_CR22","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1162\/neco.1992.4.4.590","volume":"4","author":"DJC MacKay","year":"1992","unstructured":"MacKay DJC (1992) Information-based objective functions for active data selection. Neural Comput 4(4): 590\u2013604","journal-title":"Neural Comput"},{"key":"249_CR23","unstructured":"McCallum A, Nigam K (1998) Employing EM and pool-based active learning for text classification. In: Proceedings of the 15th international conference on machine learning, ICML \u201998, Morgan Kaufmann Publishers Inc., San Francisco, pp 350\u2013358"},{"key":"249_CR24","doi-asserted-by":"crossref","unstructured":"Mu Y, Shen J, Yan S (2010) Weakly-supervised hashing in kernel space. In: Proceedings of IEEE conference on computer vision and pattern recognition [46], pp 3344\u20133351","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"249_CR25","doi-asserted-by":"crossref","unstructured":"Mu Y, Yan S (2010) Non-metric locality-sensitive hashing. In: Fox M, Poolev (eds) Proceedings of the 24th AAAI conference on artificial intelligence, AAAI \u201910, AAAI Press, Menlo Park, CA, pp 539\u2013544","DOI":"10.1609\/aaai.v24i1.7683"},{"key":"249_CR26","unstructured":"Nguyen HT, Smeulders A (2004) Active learning using pre-clustering. In:Proceedings of the 21st international conference on machine learning, ICML \u201904, ACM, New York, pp 79\u201386"},{"key":"249_CR27","unstructured":"Nicholas R, McCallum A (2001) Toward optimal active learning through sampling estimation of error reduction. In: Proceedings of the 18th international conference on machine learning, ICML \u201901, Morgan Kaufmann Publishers Inc., San Francisco, pp 441\u2013448"},{"key":"249_CR28","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","volume":"50","author":"R Salakhutdinov","year":"2009","unstructured":"Salakhutdinov R, Hinton GE (2009) Semantic hashing. Int J Approx Reason 50: 969\u2013978","journal-title":"Int J Approx Reason"},{"issue":"5","key":"249_CR29","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/0306-4573(88)90021-0","volume":"24","author":"G Salton","year":"1988","unstructured":"Salton G, Buckley C (1988) Term-weighting approaches in automatic text retrieval. Inf Process Manag 24(5): 513\u2013523","journal-title":"Inf Process Manag"},{"issue":"1","key":"249_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/505282.505283","volume":"34","author":"F Sebastiani","year":"2002","unstructured":"Sebastiani F (2002) Machine learning in automated text categorization. ACM Comput Surv 34(1): 1\u201347","journal-title":"ACM Comput Surv"},{"key":"249_CR31","doi-asserted-by":"crossref","unstructured":"Seung HS, Opper M, Sompolinsky H (1992) Query by committee. In: Proceedings of the 5th annual workshop on computational learning theory, COLT \u201992, ACM, New York, pp 287\u2013294","DOI":"10.1145\/130385.130417"},{"key":"249_CR32","unstructured":"Shakhnarovich G (2005) Learning task-specific similarity. PhD thesis, Massachusetts Institute of Technology"},{"key":"249_CR33","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4908.001.0001","volume-title":"Nearest-neighbor methods in learning and vision: theory and practice","author":"G Shakhnarovich","year":"2006","unstructured":"Shakhnarovich G, Darrell T, Indyk P (2006) Nearest-neighbor methods in learning and vision: theory and practice. The MIT Press, Cambridge, MA"},{"key":"249_CR34","first-page":"45","volume":"2","author":"S Tong","year":"2002","unstructured":"Tong S, Koller D (2002) Support vector machine active learning with applications to text classification. J Mach Learn Res 2: 45\u201366","journal-title":"J Mach Learn Res"},{"key":"249_CR35","doi-asserted-by":"crossref","unstructured":"Torralba A, Fergus R, Weiss Y (2008) Small codes and large image databases for recognition. In: Proceedings of IEEE conference on computer vision and pattern recognition, CVPR \u201908, IEEE Computer Society, Los Alamitos, pp 1\u20138","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"249_CR36","doi-asserted-by":"crossref","unstructured":"Wang J, Kumar S, Chang S-F (2010a) Semi-supervised hashing for scalable image retrieval. In: Proceedings of IEEE conference on computer vision and pattern recognition [46], pp 3424\u20133431","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"249_CR37","unstructured":"Wang J, Kumar S, Chang S-F (2010b) Sequential projection learning for hashing with compact codes. In: Proceedings of the 27th international conference on machine learning, ICML \u201910, Omnipress, Haifa, pp 1127\u20131134"},{"key":"249_CR38","unstructured":"Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: Koller D, Schuurmans D, Bengio Y, Bottou L (eds) Advances in neural information processing systems 21, NIPS 21, The MIT Press, Cambridge, MA, pp 1753\u20131760"},{"key":"249_CR39","unstructured":"Yianilos PN (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the 4th annual ACM-SIAM symposium on discrete algorithms, SODA \u201993, Society for Industrial and Applied Mathematics, Philadelphia, pp 311\u2013321"},{"key":"249_CR40","doi-asserted-by":"crossref","unstructured":"Yu K, Bi J, Tresp V (2006) Active learning via transductive experimental design. In: Proceedings of the 23rd international conference on machine learning [47], pp 1081\u20131088","DOI":"10.1145\/1143844.1143980"},{"key":"249_CR41","doi-asserted-by":"crossref","unstructured":"Yu K, Zhu S, Xu W, Gong Y (2008) Non-greedy active learning for text categorization using convex transductive experimental design. In: Proceedings of the 31st annual international ACM SIGIR conference on research and development in information retrieval, SIGIR \u201908, ACM, New York, pp 635\u2013642","DOI":"10.1145\/1390334.1390442"},{"key":"249_CR42","doi-asserted-by":"crossref","unstructured":"Zhang D, Wang J, Cai D, Lu J (2010) Self-taught hashing for fast similarity search. In: Proceedings of the 33rd annual international ACM SIGIR conference on research and development in information retrieval [47], pp 18\u201325","DOI":"10.1145\/1835449.1835455"},{"key":"249_CR43","unstructured":"Zhen Y, Yeung D-Y (2010) Supervised experimental design and its application to text retrieval. In: Proceedings of the 33rd annual international ACM SIGIR conference on research and development in information retrieval [47], pp 299\u2013306"},{"key":"249_CR44","unstructured":"Zhu X, Lafferty J, Ghahramani Z (2003) Combining active learning and semi-supervised learning using gaussian fields and harmonic functions. In: ICML workshop on the continuum from labeled to unlabeled data in machine learning and data mining, ICML \u201903"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0249-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-012-0249-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-012-0249-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T22:11:29Z","timestamp":1713478289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-012-0249-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,4]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["249"],"URL":"https:\/\/doi.org\/10.1007\/s10618-012-0249-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,4]]}}}