Multiple instance learning for re-ranking of web image search results [Görsel arama sonuçlarinin çoklu örnekle öǧrenme yöntemi̇yle yeni̇den siralanmasi]
2012 20th Signal Processing and Communications Applications Conference, SIU 2012, Proceedings
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/28181
In this study, we propose a weakly-supervised multiple instance learning (MIL) method to improve the results of text-based image search engines. In this approach, ranked image list of search engine for a keyword query is treated as weak-positive input data, and with additional negative input data, multiple instance learning bags are constructed. Then, Multiple Instance problem is converted to a standard supervised learning problem by mapping each bag into a feature space defined by instances in training bags using a bag-instance similarity measure. At the end, linear SVM is used to construct a classifier to re-rank keyword-based image search data. Based on the classification scores, we re-rank the images and improve precision over the search engine results. In this respect, we also present our experiments conducted to find a pattern for multiple instance bag sizes to obtain better average precision. © 2012 IEEE.
- Conference Paper 
Showing items related by title, author, creator and subject.
Altingovde I.S.; Blanco, R.; Cambazoglu, B.B.; Ozcan, R.; Sarigil, E.; Ulusoy Ö. (2012)Despite the continuous efforts to improve the web search quality, a non-negligible fraction of user queries end up with very few or even no matching results in leading web search engines. In this work, we provide a detailed ...
Cambazoglu, B.B.; Varol, E.; Kayaaslan, E.; Aykanat, C.; Baeza-Yates, R. (2010)Query forwarding is an important technique for preserving the result quality in distributed search engines where the index is geographically partitioned over multiple search sites. The key component in query forwarding is ...
Gezici, S. (2009)In this paper, mean acquisition time (MAT) analysis of fixed-step serial search (FSSS) algorithms is presented. First, it is shown that the MAT of an FSSS algorithm can be obtained from that of a conventional serial search ...