3rd International ICST Conference on Scalable Information Systems

Research Article

Dynamic User-Defined Similarity Searching in Semi-Structured Text Retrieval

Download323 downloads
  • @INPROCEEDINGS{10.4108/ICST.INFOSCALE2008.3488,
        author={Filippo Geraci and Marco Pellegrini},
        title={Dynamic User-Defined Similarity Searching  in  Semi-Structured Text Retrieval},
        proceedings={3rd International ICST Conference on Scalable Information Systems},
        publisher={ICST},
        proceedings_a={INFOSCALE},
        year={2010},
        month={5},
        keywords={Semi-Structured Text; personalized search},
        doi={10.4108/ICST.INFOSCALE2008.3488}
    }
    
  • Filippo Geraci
    Marco Pellegrini
    Year: 2010
    Dynamic User-Defined Similarity Searching in Semi-Structured Text Retrieval
    INFOSCALE
    ICST
    DOI: 10.4108/ICST.INFOSCALE2008.3488
Filippo Geraci1,*, Marco Pellegrini1,*
  • 1: Istituto di Informatica e Telematica, CNR, Via G. Moruzzi 1 Pisa (Italy)
*Contact email: filippo.geraci@iit.cnr.it, marco.pellegrini@iit.cnr.it

Abstract

Modern text retrieval systems often provide a similarity search utility, that allows the user to find efficiently a fixed number h of documents in the data set that are the most similar to a given query (here a query is either a simple sequence of keywords or a full document). We consider the case of a textual database made of semi-structured documents. For example, in a corpus of bibliographic records any record may be structured into three fields: title, authors and abstract, where each field is an unstructured free text. Each field, in turns, may be modelled with a specific vector space. The problem is more complex when we also allow users to associate at query time to each vector space a weight influencing its contribution to the overall dynamic aggregated and weighted similarity. We investigate the use of metric k-center clustering to prune the search space at query time. The embedding of the weights in the data structure is investigated with the purpose of allowing users query customization without any data replication. The validity of our approach is demonstrated experimentally by showing significant quality/time performance improvements over two state of the art methods. We also speed up the pre-processing time by a factor at least thirty with respect to a method based on k-means clustering.