1
|
Tang X, Xu C, Luo T, Hou C. Multi-instance positive and unlabeled learning with bi-level embedding. INTELL DATA ANAL 2022. [DOI: 10.3233/ida-215896] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Abstract
Multiple Instance Learning (MIL) is a widely studied learning paradigm which arises from real applications. Existing MIL methods have achieved prominent performances under the premise of plenty annotation data. Nevertheless, sufficient labeled data is often unattainable due to the high labeling cost. For example, the task in web image identification is to find similar samples among a large size of unlabeled dataset through a small number of provided target pictures. This leads to a particular scenario of Multiple Instance Learning with insufficient Positive and superabundant Unlabeled data (PU-MIL), which is a hot research topic in MIL recently. In this paper, we propose a novel method called Multiple Instance Learning with Bi-level Embedding (MILBLE) to tackle PU-MIL problem. Unlike other PU-MIL method using only simple single-level mapping, the bi-level embedding strategy are designed to customize specific mapping for positive and unlabeled data. It ensures the characteristics of key instance are not erased. Moreover, the weighting measure adopted in positive data can extracts the uncontaminated information of true positive instances without interference from negative ones. Finally, we minimize the classification error loss of mapped examples based on class-prior probability to train the optimal classifier. Experimental results show that our method has better performance than other state-of-the-art methods.
Collapse
|
2
|
Xiao Y, Liang F, Liu B. A Transfer Learning-Based Multi-Instance Learning Method With Weak Labels. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:287-300. [PMID: 32149707 DOI: 10.1109/tcyb.2020.2973450] [Citation(s) in RCA: 7] [Impact Index Per Article: 3.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
In multi-instance learning (MIL), labels are associated with bags rather than the instances in the bag. Most of the previous MIL methods assume that each bag has the actual label in the training set. However, from the process of labeling work, the label of a bag is always evaluated by the calculation of the labels obtained from a number of labelers. In the calculation, the weight of each labeler is always unknown and people always assign the weight for each labeler by random or equally, and this may result in the ambiguous labels for the bags, which is called weak labels here. In addition, we always meet the problem of knowledge transfer from the source task to the target task, and this leads to the study of multiple instance transfer learning. In this article, we propose a new framework called transfer learning-based multiple instance learning (TMIL) framework to address the problem of multiple instance transfer learning in which both the source task and the target task contain the weak labels. We first construct a TMIL model with weak labels, which can transfer knowledge from the source task to the target task where both source and target tasks contain weak labels. We then put forward an iterative framework to solve the transfer learning model with weak labels so that we can update the label of the bag to improve the performance of multiple instance learning. We then present the convergence analysis of the proposed method. The experiments show that the proposed method outperforms the existing multiple instance learning methods and can correct the initial labels to obtain the actual labels for the bags.
Collapse
|
3
|
Liu B, Xie H, Xiao Y. Multi-task analysis discriminative dictionary learning for one-class learning. Knowl Based Syst 2021. [DOI: 10.1016/j.knosys.2021.107195] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
|
4
|
Wang X, Chen H, Gan C, Lin H, Dou Q, Tsougenis E, Huang Q, Cai M, Heng PA. Weakly Supervised Deep Learning for Whole Slide Lung Cancer Image Analysis. IEEE TRANSACTIONS ON CYBERNETICS 2020; 50:3950-3962. [PMID: 31484154 DOI: 10.1109/tcyb.2019.2935141] [Citation(s) in RCA: 126] [Impact Index Per Article: 31.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/21/2023]
Abstract
Histopathology image analysis serves as the gold standard for cancer diagnosis. Efficient and precise diagnosis is quite critical for the subsequent therapeutic treatment of patients. So far, computer-aided diagnosis has not been widely applied in pathological field yet as currently well-addressed tasks are only the tip of the iceberg. Whole slide image (WSI) classification is a quite challenging problem. First, the scarcity of annotations heavily impedes the pace of developing effective approaches. Pixelwise delineated annotations on WSIs are time consuming and tedious, which poses difficulties in building a large-scale training dataset. In addition, a variety of heterogeneous patterns of tumor existing in high magnification field are actually the major obstacle. Furthermore, a gigapixel scale WSI cannot be directly analyzed due to the immeasurable computational cost. How to design the weakly supervised learning methods to maximize the use of available WSI-level labels that can be readily obtained in clinical practice is quite appealing. To overcome these challenges, we present a weakly supervised approach in this article for fast and effective classification on the whole slide lung cancer images. Our method first takes advantage of a patch-based fully convolutional network (FCN) to retrieve discriminative blocks and provides representative deep features with high efficiency. Then, different context-aware block selection and feature aggregation strategies are explored to generate globally holistic WSI descriptor which is ultimately fed into a random forest (RF) classifier for the image-level prediction. To the best of our knowledge, this is the first study to exploit the potential of image-level labels along with some coarse annotations for weakly supervised learning. A large-scale lung cancer WSI dataset is constructed in this article for evaluation, which validates the effectiveness and feasibility of the proposed method. Extensive experiments demonstrate the superior performance of our method that surpasses the state-of-the-art approaches by a significant margin with an accuracy of 97.3%. In addition, our method also achieves the best performance on the public lung cancer WSIs dataset from The Cancer Genome Atlas (TCGA). We highlight that a small number of coarse annotations can contribute to further accuracy improvement. We believe that weakly supervised learning methods have great potential to assist pathologists in histology image diagnosis in the near future.
Collapse
|
5
|
|
6
|
|
7
|
Jin X, Wang Y, Tan X. Pornographic Image Recognition via Weighted Multiple Instance Learning. IEEE TRANSACTIONS ON CYBERNETICS 2019; 49:4412-4420. [PMID: 30222590 DOI: 10.1109/tcyb.2018.2864870] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/08/2023]
Abstract
In the era of Internet, recognizing pornographic images is of great significance for protecting children's physical and mental health. However, this task is very challenging as the key pornographic contents (e.g., breast and private part) in an image often lie in local regions of small size. In this paper, we model each image as a bag of regions, and follow a multiple instance learning (MIL) approach to train a generic region-based recognition model. Specifically, we take into account the regions' degree of pornography, and make three main contributions. First, we show that based on very few annotations of the key pornographic contents in a training image, we can generate a bag of properly sized regions, among which the potential positive regions usually contain useful contexts that can aid recognition. Second, we present a simple quantitative measure of a region's degree of pornography, which can be used to weigh the importance of different regions in a positive image. Third, we formulate the recognition task as a weighted MIL problem under the convolutional neural network framework, with a bag probability function introduced to combine the importance of different regions. Experiments on our newly collected large scale dataset demonstrate the effectiveness of the proposed method, achieving an accuracy with 97.52% true positive rate at 1% false positive rate, tested on 100K pornographic images and 100K normal images.
Collapse
|
8
|
MILDMS: Multiple Instance Learning via DD Constraint and Multiple Part Similarity. Symmetry (Basel) 2019. [DOI: 10.3390/sym11091080] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
As a subject area of symmetry, multiple instance learning (MIL) is a special form of a weakly supervised learning problem where the label is related to the bag, not the instances contained in it. The difficulty of MIL lies in the incomplete label information of instances. To resolve this problem, in this paper, we propose a novel diverse density (DD) and multiple part similarity combination method for multiple instance learning, named MILDMS. First, we model the target concepts optimization with a DD function constraint on positive and negative instance space, which can greatly improve the robustness to label noise problem. Next, we combine the positive and negative instances in the bag (generated by hand-crafted and convolutional neural network features) with multiple part similarities to construct an MIL kernel. We evaluate the proposed approach on the MUSK dataset, whose results MUSK1 (91.9%) and MUSK2 (92.2%) show our method is comparable to other MIL algorithms. To further demonstrate generality, we also present experimental results on the PASCAL VOC 2007 and 2012 (46.5% and 42.2%) and COREL (78.6%) that significantly outperforms the state-of-the-art algorithms including deep MIL and other non-deep MIL algorithms.
Collapse
|
9
|
Liu B, Xiao Y, Hao Z. A Selective Multiple Instance Transfer Learning Method for Text Categorization Problems. Knowl Based Syst 2018. [DOI: 10.1016/j.knosys.2017.11.019] [Citation(s) in RCA: 39] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
10
|
Wang L, Meng D, Hu X, Lu J, Zhao J. Instance Annotation via Optimal BoW for Weakly Supervised Object Localization. IEEE TRANSACTIONS ON CYBERNETICS 2017; 47:1313-1324. [PMID: 28129197 DOI: 10.1109/tcyb.2017.2647965] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/06/2023]
Abstract
In this paper, we aim at irregular-shape object localization under weak supervision. With over-segmentation, this task can be transformed into multiple-instance context. However, most multiple-instance learning methods only emphasize single most positive instance in a positive bag to optimize bag-level classification, and leads to imprecise or incomplete localization. To address this issue, we propose a scheme for instance annotation, where all of the positive instances are detected by labeling each instance in each positive bag. Inspired by the successful application of bag-of-words (BoW) to feature representation, we leverage it at instance-level to model the distributions of the positive class and negative class, and then incorporate the BoW learning and instance labeling in a single optimization formulation. We also demonstrate that the scheme is well suited to weakly supervised object localization of irregular-shape. Experimental results validate the effectiveness both for the problem of generic instance annotation and for the application of weakly supervised object localization compared to some existing methods.
Collapse
|
11
|
Xiao Y, Liu B, Yin J, Hao Z. A multiple-instance stream learning framework for adaptive document categorization. Knowl Based Syst 2017. [DOI: 10.1016/j.knosys.2017.01.001] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022]
|
12
|
Liu H, Li X, Zhang S. Learning Instance Correlation Functions for Multilabel Classification. IEEE TRANSACTIONS ON CYBERNETICS 2017; 47:499-510. [PMID: 26887023 DOI: 10.1109/tcyb.2016.2519683] [Citation(s) in RCA: 11] [Impact Index Per Article: 1.6] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/05/2023]
Abstract
Multilabel learning has a wide range of potential applications in reality. It attracts a great deal of attention during the past years and has been extensively studied in many fields including image annotation and text categorization. Although many efforts have been made for multilabel learning, there are two challenging issues remaining, i.e., how to exploit the correlations and how to tackle the high-dimensional problems of multilabel data. In this paper, an effective algorithm is developed for multilabel classification with utilizing those data that are relevant to the targets. The key is the construction of a coefficient-based mapping between training and test instances, where the mapping relationship exploits the correlations among the instances, rather than the explicit relationship between the variables and the class labels of data. Further, a constraint, ℓ¹-norm penalty, is performed on the mapping relationship to make the model sparse, weakening the impacts of noisy data. Our empirical study on eight public datasets shows that the proposed method is more effective in comparing with the state-of-the-art multilabel classifiers.
Collapse
|
13
|
Garnaev A, Baykal-Gursoy M, Poor HV. Security Games With Unknown Adversarial Strategies. IEEE TRANSACTIONS ON CYBERNETICS 2016; 46:2291-2299. [PMID: 26415195 DOI: 10.1109/tcyb.2015.2475243] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/05/2023]
Abstract
The security community has witnessed a significant increase in the number of different types of security threats. This situation calls for the design of new techniques that can be incorporated into security protocols to meet these challenges successfully. An important tool for developing new security protocols as well as estimating their effectiveness is game theory. This game theory framework usually involves two players or agents: 1) a protector and 2) an adversary, and two patterns of agent behavior are considered: 1) selfish behavior, where each of the agents wants to maximize his payoff; and 2) leader and follower behavior, where one agent (the leader) expects that the other agent (the follower) will respond to the leader's strategy. Such an approach assumes that the agents agree on which strategy to apply in advance. In this paper, this strong assumption is relaxed. Namely, the following question is considered: what happens if it is unknown a priori what pattern of behavior the adversary is going to use, or in other words, it is not known, what game he intends to play? Using a simple game-theoretic model, it is shown that the protector can lose if he does not take into account the possibility that the adversary can play a game other than the one the protector has in mind. Further considered is a repeated game in which the protector can learn about the presence of an adversary, and the behavior of belief probabilities is analyzed in this setting.
Collapse
|
14
|
Chen SB, Ding CHQ, Luo B. Similarity Learning of Manifold Data. IEEE TRANSACTIONS ON CYBERNETICS 2015; 45:1744-1756. [PMID: 25312973 DOI: 10.1109/tcyb.2014.2359984] [Citation(s) in RCA: 8] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/04/2023]
Abstract
Without constructing adjacency graph for neighborhood, we propose a method to learn similarity among sample points of manifold in Laplacian embedding (LE) based on adding constraints of linear reconstruction and least absolute shrinkage and selection operator type minimization. Two algorithms and corresponding analyses are presented to learn similarity for mix-signed and nonnegative data respectively. The similarity learning method is further extended to kernel spaces. The experiments on both synthetic and real world benchmark data sets demonstrate that the proposed LE with new similarity has better visualization and achieves higher accuracy in classification.
Collapse
|