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.

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.

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.

Random Indexing K-tree

Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering.

Clustering with random indexing K-tree and XML structure

This paper describes the approach taken to the clustering task at INEX 2009 by a group at the Queensland University of Technology. The Random Indexing (RI) K-tree has been used with a representation that is based on the semantic markup available in the INEX 2009 Wikipedia collection. The RI K-tree is a scalable approach to clustering large document collections. This approach has produced quality clustering when evaluated using two different methodologies.

A new future for growth factor complexes as wound therapies?

Background: Topical administration of growth factors (GFs) has displayed some potential in wound healing, but variable efficacy, high doses and costs have hampered their implementation. Moreover, this approach ignores the fact that wound repair is driven by interactions between multiple GFs and extracellular matrix (ECM) proteins. The Problem: Deep dermal partial thickness burn (DDPTB) injuries are the most common burn presentation to pediatric hospitals and also represent the most difficult burn injury to manage clinically. DDPTB often repair with a hypertrophic scar. Wounds that close rapidly exhibit reduced scarring. Thus treatments that shorten the time taken to close DDTPB’s may coincidently reduce scarring. Basic/Clinical Science Advances: We have observed that multi-protein complexes comprised of IGF and IGF-binding proteins bound to the ECM protein vitronectin (VN) significantly enhance cellular functions relevant to wound repair in human skin keratinocytes. These responses require activation of both the IGF-1R and the VN-binding αv integrins. We have recently evaluated the wound healing potential of these GF:VN complexes in a porcine model of DDTPB injury. Clinical Care Relevance: This pilot study demonstrates that GF:VN complexes hold promise as a wound healing therapy. Enhanced healing responses were observed after treatment with nanogram doses of the GF:VN complexes in vitro and in vivo. Critically healing was achieved using substantially less GF than studies in which GFs alone have been used. Conclusion: These data suggest that coupling GFs to ECM proteins, such as VN, may ultimately prove to be an improved technique for the delivery of novel GF-based wound therapies.