<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-22T20:51:56Z</responseDate><request verb="GetRecord" identifier="oai:bura.brunel.ac.uk:2438/3296" metadataPrefix="dim">https://bura.brunel.ac.uk/oai/request</request><GetRecord><record><header><identifier>oai:bura.brunel.ac.uk:2438/3296</identifier><datestamp>2016-01-27T09:08:28Z</datestamp><setSpec>com_2438_23</setSpec><setSpec>com_2438_58</setSpec><setSpec>com_2438_8630</setSpec><setSpec>com_2438_8620</setSpec><setSpec>col_2438_3672</setSpec><setSpec>col_2438_210</setSpec><setSpec>col_2438_8638</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
<dim:field mdschema="dc" element="contributor" qualifier="advisor">Macredie, R</dim:field>
<dim:field mdschema="dc" element="contributor" qualifier="author">Cribbin, Timothy</dim:field>
<dim:field mdschema="dc" element="date" qualifier="accessioned">2009-05-11T17:24:46Z</dim:field>
<dim:field mdschema="dc" element="date" qualifier="available">2009-05-11T17:24:46Z</dim:field>
<dim:field mdschema="dc" element="date" qualifier="issued">2005</dim:field>
<dim:field mdschema="dc" element="identifier" qualifier="uri">http://bura.brunel.ac.uk/handle/2438/3296</dim:field>
<dim:field mdschema="dc" element="description">This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.</dim:field>
<dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this dissertation we propose, test and develop a novel search interaction model to address two key problems associated with conducting an open-ended search task within a classical information retrieval system: (i) the need to reformulate the query within the context of a shifting conception of the problem and (ii) the need to integrate relevant results across a number of separate results sets. In our model the user issues just one highrecall query and then performs a sequence of more focused, distinct aspect searches by&#xd;
browsing the static structured context of a spatial-semantic visualization of this retrieved&#xd;
document set. Our thesis is that unsupervised spatial-semantic visualization can automatically classify retrieved documents into a two-level hierarchy of relevance. In particular we hypothesise that the locality of any given aspect exemplar will tend to comprise a sufficient proportion of same-aspect documents to support a visually guided strategy for focused, same-aspect searching that we term the aspect cluster growing&#xd;
strategy. We examine spatial-semantic classification and potential aspect cluster growing performance across three scenarios derived from topics and relevance judgements from&#xd;
the TREC test collection. Our analyses show that the expected classification can be represented in spatial-semantic structures created from document similarities computed by a simple vector space text analysis procedure. We compare two diametrically opposed approaches to layout optimisation: a global approach that focuses on preserving the all similarities and a local approach that focuses only on the strongest similarities. We find that the local approach, based on a minimum spanning tree of similarities, produces a better classification and, as observed from strategy simulation, more efficient aspect cluster growing performance in most situations, compared to the global approach of multidimensional scaling. We show that a small but significant proportion of aspect clustering&#xd;
growing cases can be problematic, regardless of the layout algorithm used. We identify the&#xd;
characteristics of these cases and, on this basis, demonstrate a set of novel interactive tools that provide additional semantic cues to aid the user in locating same-aspect documents.</dim:field>
<dim:field mdschema="dc" element="description" qualifier="provenance" lang="en">Submitted by BURA Manager (bura-manager@brunel.ac.uk) on 2009-05-11T17:24:26Z&#xd;
No. of bitstreams: 1&#xd;
Classifying complex topics using spatial-semantic document visualization.pdf: 2896830 bytes, checksum: b1ca07d094567c896ea3a424d7b0bf43 (MD5)</dim:field>
<dim:field mdschema="dc" element="description" qualifier="provenance" lang="en">Approved for entry into archive by BURA Manager(bura-manager@brunel.ac.uk) on 2009-05-11T17:24:46Z (GMT) No. of bitstreams: 1&#xd;
Classifying complex topics using spatial-semantic document visualization.pdf: 2896830 bytes, checksum: b1ca07d094567c896ea3a424d7b0bf43 (MD5)</dim:field>
<dim:field mdschema="dc" element="description" qualifier="provenance" lang="en">Made available in DSpace on 2009-05-11T17:24:46Z (GMT). No. of bitstreams: 1&#xd;
Classifying complex topics using spatial-semantic document visualization.pdf: 2896830 bytes, checksum: b1ca07d094567c896ea3a424d7b0bf43 (MD5)&#xd;
  Previous issue date: 2005-12</dim:field>
<dim:field mdschema="dc" element="format" qualifier="extent">2896830 bytes</dim:field>
<dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
<dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
<dim:field mdschema="dc" element="publisher">Brunel University, School of Information Systems, Computing and Mathematics</dim:field>
<dim:field mdschema="dc" element="relation" qualifier="uri">http://bura.brunel.ac.uk/bitstream/2438/3296/4/FulltextThesis.pdf</dim:field>
<dim:field mdschema="dc" element="title" lang="en">Classifying complex topics using spatial-semantic document visualization: An evaluation of an interaction model to support open-ended search tasks</dim:field>
<dim:field mdschema="dc" element="type">Thesis</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>