Dynamic User-defined Similarity Searching in Semi-structured Text Retrieval (Contributo in atti di convegno)

Type
Label
  • Dynamic User-defined Similarity Searching in Semi-structured Text Retrieval (Contributo in atti di convegno) (literal)
Anno
  • 2008-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.4108/ICST.INFOSCALE2008.3488 (literal)
Alternative label
  • [1] Geraci F., [1] Pellegrini M. (2008)
    Dynamic User-defined Similarity Searching in Semi-structured Text Retrieval
    in The Third International ICST Conference on Scalable Information Systems (Infoscale 2008), Vico Equense, Napoli
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • [1] Geraci F., [1] Pellegrini M. (literal)
Pagina inizio
  • 10 (literal)
Pagina fine
  • 29 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 20 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • 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. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • [1] CNR-IIT, Pisa, Italy (literal)
Titolo
  • Dynamic User-defined Similarity Searching in Semi-structured Text Retrieval (literal)
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. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it