• Melody transcription for interactive applications

    McNab, Rodger J.; Smith, Lloyd A. (1996-12)
    A melody transcription system has been developed to support interactive music applications. The system accepts monophonic voice input ranging from F2 (87 HZ) to G5 (784 HZ) and tracks the frequency, displaying the result ...
  • Selecting multiway splits in decision trees

    Frank, Eibe; Witten, Ian H. (1996-12)
    Decision trees in which numeric attributes are split several ways are more comprehensible than the usual binary trees because attributes rarely appear more than once in any path from root to leaf. There are efficient ...
  • Reconstructing Minard's graphic with the relational visualisation notation

    Humphrey, Matthew C. (1996-12)
    Richly expressive information visualisations are difficult to design and rarely found. Few software tools can generate multi-dimensional visualisations at all, let alone incorporate artistic detail. The Relational Visualisation ...
  • OzCHI'96 Workshop on the Next Generation of CSCW Systems

    Grundy, John C. (1996-11-25)
    This is the Proceedings of the OZCHI'96 Workshop on the Next Generation of CSCW Systems. Thanks must go to Andy Cockburn for inspiring the name of the workshop and thus giving it a (general) theme! The idea for this workshop ...
  • Teaching students to critically evaluate the quality of Internet research resources

    Cunningham, Sally Jo (1996-11)
    The Internet offers a host of high-quality research material in computer science-and, unfortunately, some very low quality resources as well. As part of learning the research process, students should be taught to critically ...
  • Timestamp representations for virtual sequences

    Cleary, John G.; McWha, David J.A.; Murray, Pearson (IEEE Computer Society Press, 1996-11)
    The problem of executing sequential programs optimistically using the Time Warp algorithm is considered. It is shown how to do this, by first mapping the sequential execution to a control tree and then assigning timestamps ...
  • Dataset cataloging metadata for machine learning applications and research

    Cunningham, Sally Jo (1996-11)
    As the field of machine learning (ML) matures, two types of data archives are developing: collections of benchmark data sets used to test the performance of new algorithms, and data stores to which machine learning/data ...
  • Identifying hierarchical structure in sequences: a linear-time algorithm

    Nevill-Manning, Craig G.; Witten, Ian H. (1996-11)
    This paper describes an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing phrases which appear more than once by a grammatical rule that generates the phrase, and continuing ...
  • Authorship patterns in information systems

    Cunningham, Sally Jo; Dillon, Stuart M. (1996-10)
    This paper examines the patterns of multiple authorship in five information systems journals. Specifically, we determine the distribution of the number of authors per paper in this field, the proportion of male and female ...
  • Induction of model trees for predicting continuous classes

    Wang, Yong; Witten, Ian H. (1996-10)
    Many problems encountered when applying machine learning in practice involve predicting a "class" that takes on a continuous numeric value, yet few machine learning schemes are able to do this. This paper describes a ...
  • Understanding what machine learning produces - Part II: Knowledge visualization techniques

    Cunningham, Sally Jo; Humphrey, Matthew C.; Witten, Ian H. (1996-10)
    Researchers in machine learning use decision trees, production rules, and decision graphs for visualizing classification data. Part I of this paper surveyed these representations, paying particular attention to their ...
  • Understanding what machine learning produces - Part I: Representations and their comprehensibility

    Cunningham, Sally Jo; Humphrey, Matthew C.; Witten, Ian H. (1996-10)
    The aim of many machine learning users is to comprehend the structures that are inferred from a dataset, and such users may be far more interested in understanding the structure of their data than in predicting the outcome ...
  • Machine learning applied to fourteen agricultural datasets

    Thomson, Kirsten; McQueen, Robert J. (1996-09)
    This document reports on an investigation conducted between November, 1995 and March, 1996 into the use of machine learning on 14 sets of data supplied by agricultural researchers in New Zealand. Our purpose here is to ...
  • Serendipity: integrated environment support for process modelling, enactment and improvement

    Grundy, John C.; Hosking, John G. (1996-08)
    Large cooperative work systems require work coordination, context awareness and process modelling and enactment mechanisms to be effective. The Serendipity environment provides visual languages for specifying process models ...
  • Compression and explanation using hierarchical grammars

    Nevill-Manning, Craig G.; Witten, Ian H. (1996-07)
    Data compression is an eminently pragmatic pursuit: by removing redundancy, storage can be utilised more efficiently. Identifying redundancy also serves a less prosaic purpose-it provides cues for detecting structure, and ...
  • CSCW in New Zealand: a snapshot

    Blackett, Colin; Reeves, Steve (1996-07)
    This report has been produced as one of the outputs of the FORST funded project "Improved Computer Supported Collaborative Work Systems" which is currently running in the Department of Computer Science at the University ...
  • Digital libraries based on full-text retrieval

    Witten, Ian H.; Nevill-Manning, Craig G.; Cunningham, Sally Jo (1996-07)
    Because digital libraries are expensive to create and maintain, Internet analogs of public libraries-reliable, quality, community services-have only recently begun to appear. A serious obstacle to their creation is the ...
  • Tree browsing

    Apperley, Mark; Chester, Michael (1996-07)
    Graphic representations of tree structures are notoriously difficult to create, display, and interpret, particularly when the volume of information they contain, and hence the number of nodes, is large. The problem of ...
  • Current techniques for measuring and modeling ATM traffic

    Pearson, Murray W.; Cleary, John G.; Unger, Brian; Williamson, Carey (1996-06)
    ATM has now been widely accepted as the leading contender for the implementation of broadband communications networks (Brinkmann, Lavrijsen, Louis, et al, 1995) ATM networks are no longer restricted to research laboratories, ...
  • High performance simulation for ATM network development

    Cleary, John G.; Pearson, Murray W.; Graham, Ian; Unger, Brian (1996-06)
    Techniques for measuring and modeling ATM traffic are reviewed. The requirements for cell level ATM network modeling and simulation are then outlined followed by a description of an ATM traffic and network (ATM-TN) simulator. ...

View more