Results 151 to 160 of about 188 (183)
Some of the next articles are maybe not open access.
2008 IEEE 24th International Conference on Data Engineering, 2008
Similarity joins have attracted significant interest, with applications in geographical information systems, astronomy, marketing analyzes, and anomaly detection. However, all the past algorithms, although highly fine-tuned, suffer an output explosion if the query range is even moderately large relative to the local data density.
Brent Bryan +2 more
openaire +1 more source
Similarity joins have attracted significant interest, with applications in geographical information systems, astronomy, marketing analyzes, and anomaly detection. However, all the past algorithms, although highly fine-tuned, suffer an output explosion if the query range is even moderately large relative to the local data density.
Brent Bryan +2 more
openaire +1 more source
Streaming Set Similarity Joins
2021We consider the problem of efficiently answering set similarity joins over streams. This problem is challenging both in terms of CPU cost, because similarity matching is computationally much more expensive than equality comparisons, and memory requirements, due to the unbounded nature of streams.
Lucas PacĂfico +1 more
openaire +1 more source
High-dimensional similarity joins
IEEE Transactions on Knowledge and Data Engineering, 2002Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, called the /spl epsi/ tree, for fast spatial similarity joins on high-dimensional points.
Kyuseok Shim +2 more
openaire +2 more sources
Similarity joins for uncertain strings
Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, 2014A string similarity join finds all similar string pairs between two input string collections. It is an essential operation in many applications, such as data integration and cleaning, and has been extensively studied for deterministic strings. Increasingly, many applications have to deal with imprecise strings or strings with fuzzy information in them.
Manish Patil, Rahul Shah 0001
openaire +1 more source
2015
With the increasing ability of current applications to produce and consume more complex data, such as images and geographic information, the similarity join has attracted considerable attention. However, this operator does not consider the relationship among the elements in the answer, generating results with many pairs similar among themselves, which ...
LĂșcio F. D. Santos +4 more
openaire +1 more source
With the increasing ability of current applications to produce and consume more complex data, such as images and geographic information, the similarity join has attracted considerable attention. However, this operator does not consider the relationship among the elements in the answer, generating results with many pairs similar among themselves, which ...
LĂșcio F. D. Santos +4 more
openaire +1 more source
The similarity join database operator
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detection on sensor networks. Multiple similarity join algorithms and implementation techniques have been proposed.
Silva, Yasin +2 more
openaire +2 more sources
Proceedings of the VLDB Endowment, 2014
String similarity join is an important operation in data integration and cleansing that finds similar string pairs from two collections of strings. More than ten algorithms have been proposed to address this problem in the recent two decades. However, existing algorithms have not been thoroughly compared under the same experimental framework.
Yu Jiang +3 more
openaire +2 more sources
String similarity join is an important operation in data integration and cleansing that finds similar string pairs from two collections of strings. More than ten algorithms have been proposed to address this problem in the recent two decades. However, existing algorithms have not been thoroughly compared under the same experimental framework.
Yu Jiang +3 more
openaire +2 more sources
Signature-Based Trajectory Similarity Join
Emerging vehicular trajectory data have opened up opportunities to benefit many real-world applications, e.g., frequent trajectory based navigation systems, road planning, car pooling, etc. The similarity join is a key operation to enable such applications, which finds similar trajectory pairs from two large collections of trajectories.
Guoliang Li, Shuang Hao, Jianhua Feng
exaly +3 more sources
Similarity Joins of Sparse Features
Companion of the 2024 International Conference on Management of DataIdentifying all pairs of records from two datasets whose similarity exceeds a given threshold is crucial for data cleaning and clustering. Our work on similarity-joins is motivated by detecting fraud and abuse. We focus on similarity-joins of sparse features, where records represent sparse sets, multisets, or vectors.
Ahmed Metwally 0001, Michael Shum
openaire +3 more sources
Similarity Join in Metric Spaces
2003Similarity join in distance spaces constrained by the metric postulates is the necessary complement of more famous similarity range and the nearest neighbors search primitives. However, the quadratic computational complexity of similarity joins prevents from applications on large data collections.
Dohnal V, Gennaro C, Savino P, Zezula P
openaire +5 more sources

