K-tree : large scale document clustering

We introduce K-tree in an information retrieval context. It is an efficient approximation of the k-means clustering algorithm. Unlike k-means it forms a hierarchy of clusters. It has been extended to address issues with sparse representations. We compare performance and quality to CLUTO using document collections. The K-tree has a low time complexity that is suitable for large document collections. This tree structure allows for efficient disk based implementations where space requirements exceed that of main memory.

Digital storytelling as participatory public history in Australia

This chapter discusses digital storytelling as a methodology for participatory public history through a detailed reflection on an applied research project that integrated both public history and digital storytelling in the context of a new master-planned urban development: the Kelvin Grove Urban Village Sharing Stories project.

The knowledge advantage (K-Adv): unleashing creativity and innovation

The K-Adv has been developed around the concept that it comprises an ICT enabling infrastructure that encompasses ICT hardware and software infrastructure facilities together with an enabling ICT support system; a leadership infrastructure support system that provides the vision for its implementation and the realisation capacity for the vision to be realised; and the necessary people infrastructure that includes the people capabilities and capacities supported by organisational processes that facilitates this resource to be mobilised.

Document clustering with K-tree

This paper describes the approach taken to the XML Mining track at INEX 2008 by a group at the Queensland University of Technology. We introduce the K-tree clustering algorithm in an Information Retrieval context by adapting it for document clustering. Many large scale problems exist in document clustering. K-tree scales well with large inputs due to its low complexity. It offers promising results both in terms of efficiency and quality. Document classification was completed using Support Vector Machines.

Developing knowledge precincts in regional towns: opportunities and challenges

While extensive literature exists on knowledge-based urban development (KBUD) focusing on large metropolitan cities, there is a paucity of literature looking into similar developments in small regional towns. The major aim of the paper is to examine the nature and potential for building knowledge precincts in regional towns. Through a review of extant literature on knowledge precincts, five key value elements and principles for development are identified. These principles are then tested and applied to a case study of the small town of Cooroy in Noosa, Australia. The Cooroy Lower Mill Site and its surroundings are the designated location for what may be called a community-based creative knowledge precinct. The opportunities and challenges for setting up a creative knowledge precinct in Cooroy were examined. The study showed that there is a potential to develop Cooroy with the provision of cultural and learning facilities, partnerships with government, business and educational institutions, and networking with other creative and knowledge precincts in the region. However, there are also specific challenges relating to the development of a knowledge precinct within the regional town and these relate to critical mass, competition and governance.

Foldback current control for a DG to achieve Fast Arc Extinction in a distribution network

The distribution network reliability can be increased if distributed generators (DGs) are allowed to operate in both grid-connected and islanded operations when the network has a high DG penetration level. However, the current utility regulations do not allow for the islanded operation. The arc faults are the one of the major issues preventing the islanded operation, since the arc will not extinguish if the DGs are not disconnected. In this paper, the effect of a converter interfaced DG on an arc fault is investigated by considering different control strategies for the converter. The foldback current control characteristic is proposed to a converter interfaced DG to achieve quick arc extinction and self-restoration without disconnecting the DG in the event of an arc fault. The results are validated through PSCAD/EMTDC simulations.

The role of timber plantations in U.K. investment portfolios

Although timber plantations and forests are classified as forms of agricultural production, the ownership of this land classification is not limited to rural producers. Timber plantations and forests are now regarded as a long-term investment with both institutional and absentee owners. While the NCREIF property indices have been the benchmarks for the measurement of the performance of the commercial property market in the UK, for many years the IPD timberland index has recently emerged as the U.K. forest and timberland performance indicator. The IPD Forest index incorporates 126 properties over five regions in the U.K. This paper will utilise the IPD Forestry Index to examine the performance of U.K. timber plantations and forests over the period 1981-2004. In particular, issues to be critically assessed include plantation and forest performance analysis, comparative investment analysis, and the role of plantations and forests in investment portfolios, the risk reduction and portfolio benefits of plantations and forests in mixed-asset portfolios and the strategic investment significance of U.K. timberlands.

An effective model of using negative relevance feedback for information filtering

Over the years, people have often held the hypothesis that negative feedback should be very useful for largely improving the performance of information filtering systems; however, we have not obtained very effective models to support this hypothesis. This paper, proposes an effective model that use negative relevance feedback based on a pattern mining approach to improve extracted features. This study focuses on two main issues of using negative relevance feedback: the selection of constructive negative examples to reduce the space of negative examples; and the revision of existing features based on the selected negative examples. The former selects some offender documents, where offender documents are negative documents that are most likely to be classified in the positive group. The later groups the extracted features into three groups: the positive specific category, general category and negative specific category to easily update the weight. An iterative algorithm is also proposed to implement this approach on RCV1 data collections, and substantial experiments show that the proposed approach achieves encouraging performance.