Clustering with random indexing K-tree and XML structure


Autoria(s): De Vries, Christopher M.; Geva, Shlomo; De Vine, Lance
Data(s)

2010

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.qut.edu.au/33656/

Publicador

Springer

Relação

http://eprints.qut.edu.au/33656/1/c33656.pdf

DOI:10.1007/978-3-642-14556-8_40

De Vries, Christopher M., Geva, Shlomo, & De Vine, Lance (2010) Clustering with random indexing K-tree and XML structure. In Focused Retrieval and Evaluation : Proceedings of 8th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2009, Springer, Brisbane, Queensland, pp. 407-415.

Direitos

Copyright 2010 Springer

This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via http://www.springer.de/comp/lncs/

Fonte

Computer Science; Faculty of Science and Technology; High Performance Computing and Research Support

Palavras-Chave #080109 Pattern Recognition and Data Mining #080704 Information Retrieval and Web Search
Tipo

Conference Paper