Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2003 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2003 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Applying propositional learning algorithms to multi-instance data

      Frank, Eibe; Xu, Xin
      Thumbnail
      Files
      uow-cs-wp-2003-06.pdf
      2.047Mb
      Find in your library  
      Citation
      Export citation
      Frank, E. & Xu, X. (2003). Applying propositional learning algorithms to multi-instance data. (Working paper 06/03). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/1006
      Abstract
      Multi-instance learning is commonly tackled using special-purpose algorithms. Development of these algorithms has started because early experiments with standard propositional learners have failed to produce satisfactory results on multi-instance data—more specifically, the Musk data. In this paper we present evidence that this is not necessarily the case. We introduce a simple wrapper for applying standard propositional learners to multi-instance problems and present empirical results for the Musk data that are competitive with genuine multi-instance algorithms. The key features of our new wrapper technique are: (1) it discards the standard multi-instance assumption that there is some inherent difference between positive and negative bags, and (2) it introduces weights to treat instances from different bags differently. We show that these two modifications are essential for producing good results on the Musk benchmark datasets.
      Date
      2003-06
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      06/03
      Publisher
      University of Waikato, Department of Computer Science
      Collections
      • 2003 Working Papers [8]
      Show full item record  

      Usage

      Downloads, last 12 months
      98
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement