Oblivious Bounds on the Probability of Boolean Functions [PDF]
, 2014 This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities.
Gatterbauer, Wolfgang, Suciu, Dan
core +2 more sources
Finding minimum representative pattern sets [PDF]
, 2012 10.1145/2339530.2339543Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining51 ...
Liu, G., Wong, L., Zhang, H.
core +2 more sources
The roles and contributions of Biodiversity Observation Networks (BONs) in better tracking progress to 2020 biodiversity targets: a European case study [PDF]
, 2015 The Aichi Biodiversity Targets of the United Nations’ Strategic Plan for Biodiversity set ambitious goals for protecting biodiversity from further decline. Increased efforts are urgently needed to achieve these targets by 2020.
García Camacho, F.A. +10 more
core +1 more source
Compressed bitmap indexes: beyond unions and intersections [PDF]
, 2016 Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logical operations (AND,OR,NOT) that are ideally suited for bitmaps. However, it
Kaser, Owen, Lemire, Daniel
core +1 more source
Scalability and Total Recall with Fast CoveringLSH [PDF]
, 2016 Locality-sensitive hashing (LSH) has emerged as the dominant algorithmic technique for similarity search with strong performance guarantees in high-dimensional spaces.
Arasu A. +6 more
core +2 more sources
Scalable and Robust Set Similarity Join [PDF]
, 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).
Christiani, Tobias Lybecker +2 more
core +2 more sources
Keyword search over relational tables and streams [PDF]
, 2009 Relational keyword search (R-KWS) provides an intuitive way to query relational data without requiring SQL, or knowledge of the underlying schema. In this paper we describe a comprehensive framework for R-KWS covering snapshot queries on conventional ...
Alexander Markowetz +2 more
core +2 more sources
Causal reasoning and symbolic relationships in Medieval Illuminations Raisonnement causale et relations symboliques dans les Enluminures médiévales [PDF]
Journal of Data Mining and Digital Humanities, 2019 This work applies knowledge engineering’s techniques to medieval illuminations. Inside it, an illumination is considered as a knowledge graph which was used by some elites in the Middle Ages to represent themselves as a social group and exhibit the ...
Djibril Diarra +2 more
doaj
ERBlox: Combining Matching Dependencies with Machine Learning for Entity Resolution
, 2017 Entity resolution (ER), an important and common data cleaning problem, is about detecting data duplicate representations for the same external entities, and merging them into single representations. Relatively recently, declarative rules called "matching
Bahmani, Zeinab +2 more
core +1 more source
Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries
, 2018 A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system.
A Artale +8 more
core +1 more source