Results 21 to 30 of about 7,953 (261)
Heterogeneous CPU-GPU Epsilon Grid Joins: Static and Dynamic Work Partitioning Strategies
Data Science and Engineering, 2020 Given two datasets (or tables) A and B and a search distance $$\epsilon$$ ϵ , the distance similarity join, denoted as $$A \ltimes _\epsilon B$$ A ⋉ ϵ B , finds the pairs of points ( $$p_a$$ p a , $$p_b$$ p b ), where $$p_a \in A$$ p a ∈ A and $$p_b \in ...
Benoit Gallet, Michael Gowanlock
doaj +1 more source
A Framework for the Data Integration of Earthquake Events
IEEE Access, 2019 Recently, data integration has attracted increasing interest from different research domains. In most situations, data integration systems are provided for users to access homogeneous data from a set of private databases.
Chuanzhao Tian, Guoqing Li
doaj +1 more source
Double Distance-Calculation-Pruning for Similarity Search
Information, 2018 Many modern applications deal with complex data, where retrieval by similarity plays an important role. Complex data main comparison mechanisms are based on similarity predicates.
Ives Renê Venturini Pola +2 more
doaj +1 more source
Metric space similarity joins [PDF]
ACM Transactions on Database Systems, 2008 Similarity join algorithms find pairs of objects that lie within a certain distance ϵ of each other. Algorithms that are adapted from spatial join techniques are designed primarily for data in a vector space and often employ some form of a multidimensional index.
Edwin H. Jacox, Hanan Samet
openaire +1 more source
Nauka ta progres transportu, 2020 Purpose. The article proposes a method for determining the rational parameters of supporting structures made of soil-cement piles on landslide-prone slopes. Methodology.
O. L. Tiutkin, D. Y. Ihnatenko
doaj +1 more source
K-Join: Knowledge-Aware Similarity Join
IEEE Transactions on Knowledge and Data Engineering, 2016 Similarity join is a fundamental operation in data cleaning and integration. Existing similarity-join methods utilize the string similarity to quantify the relevance but neglect the knowledge behind the data, which plays an important role in understanding the data. Thanks to public knowledge bases, e.g., Freebase and Yago, we have an opportunity to use
Zeyuan Shang +3 more
openaire +1 more source
Sub-trajectory Similarity Join with Obfuscation [PDF]
33rd International Conference on Scientific and Statistical Database Management, 2021 User trajectory data is becoming increasingly accessible due to the prevalence of GPS-equipped devices such as smartphones. Many existing studies focus on querying trajectories that are similar to each other in their entirety. We observe that trajectories partially similar to each other contain useful information about users' travel patterns which ...
Yanchuan Chang +4 more
openaire +2 more sources
Ancient mural restoration based on a modified generative adversarial network
Heritage Science, 2020 How to effectively protect ancient murals has become an urgent and important problem. Digital image processing developments have made it possible to repair damaged murals to a certain extent.
Jianfang Cao +4 more
doaj +1 more source
Scalable and Robust Set Similarity Join [PDF]
2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018 Set similarity join is a fundamental and well-studied database operator. It is usually studied in the exact setting where the goal is to compute all pairs of sets that exceed a given similarity threshold (measured e.g. as Jaccard similarity). But set similarity join is often used in settings where 100% recall may not be important --- indeed, where the ...
Christiani, Tobias Lybecker +2 more
openaire +3 more sources
PLoS Computational Biology, 2009 Structural classifications of proteins assume the existence of the fold, which is an intrinsic equivalence class of protein domains. Here, we test in which conditions such an equivalence class is compatible with objective similarity measures. We base our
Alberto Pascual-García +3 more
doaj +1 more source