An incremental prefix filtering approach for the all pairs similarity search problem (Contributo in atti di convegno)

Type
Label
  • An incremental prefix filtering approach for the all pairs similarity search problem (Contributo in atti di convegno) (literal)
Anno
  • 2010-01-01T00:00:00+01:00 (literal)
Alternative label
  • Lam H. T.; Dinh Viet D.; Perego R.; Silvestri F. (2010)
    An incremental prefix filtering approach for the all pairs similarity search problem
    in 12th International Asia-Pacific Web Conference, Buscan, Korea
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Lam H. T.; Dinh Viet D.; Perego R.; Silvestri F. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: APWeb 2010 - 12th International Asia-Pacific Web Conference (Buscan, Korea, 6-8 April 2010). Proceedings, pp. 188 - 194. IEEE, 2010. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • ABSTRACT: Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t. We propose several optimizations on the existing approaches to solve the problem. Our algorithm outperforms the state-of-the-art algorithms in the case with large and high-dimensional datasets. The speedup we achieved varied from 30% to 4-x depending on the similarity threshold and the dataset properties. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Technical University of Eindhoven, CNR-ISTI, Pisa (literal)
Titolo
  • An incremental prefix filtering approach for the all pairs similarity search problem (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


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