| 摘要 |
The concurrent multiple instance learning technique described encodes the inter-dependency between instances (e.g. regions in an image) in order to predict a label for a future instance, and, if desired the label for an image determined from the label of these instances. The technique, in one embodiment, uses a concurrent tensor to model the semantic linkage between instances in a set of images. Based on the concurrent tensor, rank-1 supersymmetric non-negative tensor factorization (SNTF) can be applied to estimate the probability of each instance being relevant to a target category. In one embodiment, the technique formulates the label prediction processes in a regularization framework, which avoids overfitting, and significantly improves a learning machine's generalization capability, similar to that in SVMs. The technique, in one embodiment, uses Reproducing Kernel Hilbert Space (RKHS) to extend predicted labels to the whole feature space based on the generalized representer theorem.
|
