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
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Applying machine learning to programming by demonstration

      Paynter, Gordon W.; Witten, Ian H.; Koblitz, Neil; Powell, Matthew
      DOI
       10.1080/09528130412331290520
      Link
       www.informaworld.com
      Find in your library  
      Citation
      Export citation
      Paynter, G. W. & Witten, I.H. (2004). Applying machine learning to programming by demonstration. Joutnal of Experimental & Theoretical Artificial Intelligence, 16(3), 161-188.
      Permanent Research Commons link: https://hdl.handle.net/10289/1821
      Abstract
      ‘Familiar’ is a tool that helps end-users automate iterative tasks in their applications by showing examples of what they want to do. It observes the user’s actions, predicts what they will do next, and then offers to complete their task. Familiar learns in two ways. First, it creates a model, based on data gathered from training tasks, that selects the best prediction from among several candidates. Experiments show that decision trees outperform heuristic methods, and can be further improved by incrementally updating the classifier at task time. Second, it uses decision stumps inferred from analogous examples in the event trace to predict the parameters of conditional rules. Because data is sparse—for most users balk at giving more than a few training examples—permutation tests are used to calculate the statistical significance of each stump, successfully eliminating bias towards attributes with many different values.
      Date
      2004
      Type
      Journal Article
      Publisher
      Taylor & Francis
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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