Results 21 to 30 of about 243 (212)

Institutional similarity drives cultural similarity among online communities

open access: yesScientific Reports, 2022
Human organizations are driven by their rules and cultures. But the effects of rules and cultures on organizational development cannot be understood without untangling their effects on each other.
Qiankun Zhong, Seth Frey
doaj   +1 more source

Adaptive MapReduce Similarity Joins [PDF]

open access: yesProceedings of the 5th ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2018
Similarity joins are a fundamental database operation. Given data sets S and R, the goal of a similarity join is to find all points x in S and y in R with distance at most r. Recent research has investigated how locality-sensitive hashing (LSH) can be used for similarity join, and in particular two recent lines of work have made exciting progress on ...
McCauley, Samuel, Silvestri, Francesco
openaire   +4 more sources

Generation of Lane-Level Road Networks Based on a Trajectory-Similarity-Join Pruning Strategy

open access: yesISPRS International Journal of Geo-Information, 2019
With the development of autonomous driving, lane-level maps have attracted significant attention. Since the lane-level road network is an important part of the lane-level map, the efficient, low-cost, and automatic generation of lane-level road networks ...
Ling Zheng   +3 more
doaj   +1 more source

Scalable and Robust Set Similarity Join [PDF]

open access: yes2018 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   +5 more sources

Fast estimation of genetic relatedness between members of heterogeneous populations of closely related genomic variants

open access: yesBMC Bioinformatics, 2018
Background Many biological analysis tasks require extraction of families of genetically similar sequences from large datasets produced by Next-generation Sequencing (NGS). Such tasks include detection of viral transmissions by analysis of all genetically
Viachaslau Tsyvina   +5 more
doaj   +1 more source

A game theoretic approach to balance privacy risks and familial benefits

open access: yesScientific Reports, 2023
As recreational genomics continues to grow in its popularity, many people are afforded the opportunity to share their genomes in exchange for various services, including third-party interpretation (TPI) tools, to understand their predisposition to health
Jia Guo   +7 more
doaj   +1 more source

Product Pre-Launch Prediction From Resilient Distributed e-WOM Data

open access: yesIEEE Access, 2020
Pre-launch success prediction of a product is a challenge in today's electronic world. Based on this prediction, industries can avoid huge losses by deciding on whether to launch or not to launch a product into the market.
Sandhya Narayanan   +2 more
doaj   +1 more source

Stability Analysis of the World Energy Trade Structure by Multiscale Embedding

open access: yesFrontiers in Energy Research, 2021
This study investigates the dynamic trading network structure of the international crude oil and gas market from year 2012 to 2017. We employed the dynamical similarity analysis at different time scales by inducing a multiscale embedding for ...
Leyang Xue   +5 more
doaj   +1 more source

On the Complexity of Inner Product Similarity Join [PDF]

open access: yesProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016
A number of tasks in classification, information retrieval, recommendation systems, and record linkage reduce to the core problem of inner product similarity join (IPS join): identifying pairs of vectors in a collection that have a sufficiently large inner product.
Ahle, Thomas D.   +3 more
openaire   +4 more sources

I/O-Efficient Similarity Join [PDF]

open access: yesAlgorithmica, 2015
We present an I/O-efficient algorithm for computing similarity joins based on locality-sensitive hashing (LSH). In contrast to the filtering methods commonly suggested our method has provable sub-quadratic dependency on the data size. Further, in contrast to straightforward implementations of known LSH-based algorithms on external memory, our approach ...
Rasmus Pagh   +3 more
openaire   +10 more sources

Home - About - Disclaimer - Privacy