Sciweavers

247 search results - page 1 / 50
» Scaling up all pairs similarity search
Sort
View
WWW
2007
ACM
14 years 5 months ago
Scaling up all pairs similarity search
Roberto J. Bayardo, Yiming Ma, Ramakrishnan Srikan...
WEBI
2009
Springer
13 years 11 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
13 years 10 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
ATAL
2008
Springer
13 years 6 months ago
Not all agents are equal: scaling up distributed POMDPs for agent networks
Many applications of networks of agents, including mobile sensor networks, unmanned air vehicles, autonomous underwater vehicles, involve 100s of agents acting collaboratively und...
Janusz Marecki, Tapana Gupta, Pradeep Varakantham,...
APWEB
2010
Springer
13 years 7 months ago
An Incremental Prefix Filtering Approach for the All Pairs Similarity Search Problem
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....
Hoang Thanh Lam, Dinh Viet Dung, Raffaele Perego, ...