ORCID Profile
0000-0002-4192-1522
Current Organisations
Monash University
,
Retired
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: IEEE
Date: 06-2008
DOI: 10.1109/CBMS.2008.56
Publisher: Elsevier BV
Date: 09-2000
Publisher: IEEE
Date: 12-2008
Publisher: Association for Computing Machinery (ACM)
Date: 12-1999
Publisher: Cambridge University Press (CUP)
Date: 12-1982
Publisher: Elsevier BV
Date: 1997
DOI: 10.1016/S0933-3657(96)00362-4
Abstract: A nursing database which records patient details and treatments as fields in a standard database format is transformed into a collection, in text form, of patient case days with history. Each case is represented as text strings encoding the patient details, the current problems, treatments and their associated history. The cosine measure of similarity is used to compute a whole case similarity between a text query and the cases in text form. This standard text retrieval technique is used and compared to a simple rule base. In case-based reasoning, the similarity of cases is often computed by combining similarities of the case features involved. In this work the standard text retrieval function is modified to incorporate this case structure by combining in idual matches of case components based on the cosine measure. The combination is based on a linear regression model for learning the weights assigned to the components of this retrieval function. For the 1355 records two tasks were tried: predicting the treatment for a new problem and predicting the treatment for a continuing problem when a change of treatment is required. Simple text retrieval was better than the rule base for one task and case structured retrieval was at least 18% better on both tasks. Further techniques are discussed.
Publisher: Springer Berlin Heidelberg
Date: 2001
Publisher: Emerald
Date: 1992
DOI: 10.1108/EB047846
Abstract: The task of a document retrieval system is to match a query, perhaps in natural language, against a large number of natural language documents. Neural networks are known to be good pattern matchers. This article describes investigations in implementing a document retrieval system based on a neural network model. It shows that many of the standard strategies of information retrieval are applicable in a neural network model.
Publisher: ACM
Date: 29-06-2009
Publisher: Association for Computing Machinery (ACM)
Date: 09-1999
Publisher: Wiley
Date: 11-10-2014
DOI: 10.1002/ASI.22951
Publisher: CNRI Acct
Date: 2014
Publisher: ACM
Date: 15-06-2009
Publisher: Springer Vienna
Date: 1991
Publisher: Association for Computational Linguistics
Date: 2006
Publisher: Elsevier BV
Date: 02-1990
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11768012_29
Publisher: Springer Berlin Heidelberg
Date: 1998
Publisher: IEEE
Date: 10-2013
Publisher: Edinburgh University Library
Date: 02-12-2008
DOI: 10.2218/IJDC.V3I2.66
Abstract: Much work on data repositories has derived from effort on document repositories. It is our contention that people do not access research data for the same reasons that they access research publications. We argue that it is valuable to understand information needs, both immediate and contextual, in establishing both what information should be collected, what metadata are captured, and what discovery services should be established. We report on the information needs that we have collected in our efforts in establishing the Australian National Data Service. These needs cover much more than data – there are needs for information about the data, their creators, a need for overviews, and further requirements to do with proof, collaboration, and innovation. We provide an analysis of those needs, and a set of conclusions that has led to some implementation decisions for ANDS.
Publisher: ACM
Date: 14-10-2008
Publisher: ACM
Date: 23-07-2007
Publisher: ACM Press
Date: 2006
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2012
DOI: 10.1109/MIS.2012.57
Publisher: ACM
Date: 24-04-2004
Publisher: Cambridge University Press (CUP)
Date: 1983
DOI: 10.1017/S0308210500012944
Abstract: An E -unitary inverse semigroup, S , has the property that, if x = S , and e 2 = e = S , then ( xe ) 2 = xe implies that x 2 = x . As a consequence of this, we can see that S is an extension of its semilattice of idempotents, E , by its maximal group morphic image, G . Thus, following McAlister (1974), we attempt to describe S in terms of E and G . If we extend the semilattice E to a larger semilattice F , we are able to describe S in terms of a semi-direct product of F and G , giving a new interpretation to the approach of Schein (1975).
Publisher: Cambridge University Press (CUP)
Date: 12-1984
DOI: 10.1017/S1446788700022308
Abstract: A verbal product is introduced for a particular class of varieties of inverse semigroups and this product is shown to be associative. As well, the structure of this class is examined.
Publisher: Elsevier BV
Date: 05-2001
Location: No location found
Location: United States of America
Location: Australia
No related grants have been discovered for Ross Wilkinson.