Solving the multiple instance problem with axis-parallel rectangles
Artificial Intelligence
Image retrieval by hypertext links
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Generic image classification using visual knowledge on the web
MULTIMEDIA '03 Proceedings of the eleventh ACM international conference on Multimedia
Multi-model similarity propagation and its application for web image retrieval
Proceedings of the 12th annual ACM international conference on Multimedia
A bootstrapping framework for annotating and retrieving WWW images
Proceedings of the 12th annual ACM international conference on Multimedia
Estimating the Support of a High-Dimensional Distribution
Neural Computation
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
MILES: Multiple-Instance Learning via Embedded Instance Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning in region-based image retrieval
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
An EM-Approach for clustering multi-instance objects
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Hi-index | 0.00 |
In image retrieval and annotation, Multi-Instance Learning has been studied actively. Most of the methods solve the MIL problem in a supervised way. In this paper, we proposed two unsupervised frameworks for clustering multi-instance objects based on Expectation Maximization (EM) and iterative heuristic optimization respectively. For each framework, we introduced three new algorithms of finding users' interests on specific web images without any manual labeled data. And comparative studies have shown the effectiveness of the proposed algorithms.