KFUPM ePrints

On-Line Legal Aid: Markov Chain Model for Efficient Retrieval of Legal Documents

Ghosh-Roy, R. and Habiballah, I.O. and Stonham, T.J. and Irving, M.R. (1998) On-Line Legal Aid: Markov Chain Model for Efficient Retrieval of Legal Documents. Image and Vision Computing Journal, 16 (12). pp. 941-946.

Full text not available from this repository.

Abstract

It is widely accepted that, with large databases, the key to good performance is effective data-clustering. In any large document database clustering is essential for efficient search, browse and therefore retrieval. Cluster analysis allows the identification of groups, or clusters, of similar objects in multi-dimensional space . Conventional document retrieval systems involve the matching of a query against individual documents, whereas a clustered search compares a query with clusters of documents, thereby achieving efficient retrieval. In most document databases, periodic updating of clusters is required due to the dynamic nature of a database. Experimental evidence, however, shows that clustered searches are substantially less effective than conventional searches of corresponding non-clustered documents. In this paper, we investigate the present clustering criteria and its drawbacks. We propose a new approach to clustering and justify the reasons why this new approach should be tested and (if proved beneficial) adopted.



Item Type:Article
Date:24 August 1998
Date Type:Publication
Subjects:Electrical
Divisions:College Of Engineering Sciences > Electrical Engineering Dept
Creators:Ghosh-Roy, R. and Habiballah, I.O. and Stonham, T.J. and Irving, M.R.
Email:UNSPECIFIED, ibrahimh@kfupm.edu.sa, UNSPECIFIED, UNSPECIFIED
ID Code:349
Deposited By:Dr SHARIF IQBAL SHEIKH
Deposited On:15 Mar 2008 16:58
Last Modified:12 Apr 2011 13:06

Repository Staff Only: item control page