Propositionalisation of Multi-instance Data Using Random Forests

Abstract

Abstract. Multi-instance learning is a generalisation of attribute-value learning where examples for learning consist of labeled bags (i.e. multisets) of instances. This learning setting is more computationally challenging than attribute-value learning and a natural fit for important application areas of machine learning such as classification of molecules and image classification. One approach to solve multi-instance learning problems is to apply propositionalisation, where bags of data are converted into vectors of attribute-value pairs so that a standard propositional (i.e. attribute-value) learning algorithm can be applied. This approach is attractive because of the large number of propositional learning algorithms that have been developed and can thus be applied to the propositionalised data. In this paper, we empirically investigate a variant of an existing propositionalisation method called TLC. TLC uses a single decision tree to obtain propositionalised data. Our variant applies a random forest instead and is motivated by the potential increase in robustness that this may yield. We present results on synthetic and real-world data from the above two application domains showing that it indeed yields increased classification accuracy when applying boosting and support vector machines to classify the propositionalised data.

A Non-invasive Method to Diagnose Lung Adenocarcinoma

“…The selected features were filtered by propositionalization and partition using the Partition-Membership filter (Partition Membership Filter with option Random Committee in Weka) on Lung 2 train and test sets. It can apply any partition generator to a given feature vector to get these filtered vectors for all instances, and the filtered instances are composed of these values plus class attribute and make as sparse instances (29).…”

“…PMF was used for transforming features and CFS is good at picking the most representative minimum feature subset. It has been proved that PMF can not only solve the problem of binary classification but also improve the accuracy of classification(29,30). Meanwhile, in order to avoid over-fitting as much as possible, the train and the test sets were divided with stratified random sampling to keep them balanced.…”

A novel automated lumen segmentation and classification algorithm for detection of irregular protrusion after stents deployment

“…The WEKA 3.8.1 has the partition‐membership filter that can apply any partition generator to a given feature vector to get these filtered vectors for all instances . The partition‐membership filter uses a partition generator to generate partition membership values; filtered instances are composed of these values plus class attribute and make as sparse instances …”

Development of a Radiomics Prediction Model for Histological Type Diagnosis in Solitary Pulmonary Nodules: The Combination of CT and FDG PET

“…Then the partition-Membership filter (PMF, PartitionMembershipFilter with option Random Committee in Weka) used to transform the normalized 2 PETR and 2 CTR features into sparse instances to improve the model performance (34,35).…”