259 Hits in 7.3 sec

Being picky

Aleksandar Stupar, Sebastian Michel
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
In this work, we consider processing such top-K queries under the constraint that the result items are members of a specific set, which is provided at query time.  ...  We call this restriction a setdefined selection criterion. Set-defined selections drastically influence the pros and cons of an id-ordered index vs. a scoreordered index.  ...  Figure 1 : 1 Top-K query with set-defined selection.  ... 
doi:10.1145/2396761.2396877 dblp:conf/cikm/StuparM12 fatcat:xfe6bweyifbv3aa5jq6wdyoyki

Shared probe design and existing microarray reanalysis using PICKY

Hui-Hsien Chou
2010 BMC Bioinformatics  
PICKY 2.0 can design shared probes for sets of genes that cannot be individually identified using unique probes.  ...  still useful with respect to the updated annotations.  ...  evaluations, and a few PICKY users for providing encouragements and valuable feedbacks.  ... 
doi:10.1186/1471-2105-11-196 pmid:20406469 pmcid:PMC2875240 fatcat:q5dhbj65xnf33ejfyxyhplwmay

Immutably answering Why-Not questions for equivalent conjunctive queries

Nicole Bidoit, Melanie Herschel, Katerina Tzompanaki
2015 Ingénierie des Systèmes d'Information  
However, algorithms producing such query-based explanations so far may return different results for reordered conjunctive query trees, and even worse, these results may be incomplete.  ...  Clearly, this represents a significant usability problem, as the explanations developers get may be partial and developers have to worry about the query tree representation of their query, losing the advantage  ...  Each atomic condition c is associated with a query operator op in Q, and we define the set of picky operators w.r.t. τ as P Oτ = {op|op associated with some c ∈ P Cτ }.  ... 
doi:10.3166/isi.20.5.27-52 fatcat:7ign677afvgppnuou6stgv5c5y

Causality in Databases

Alexandra Meliou, Wolfgang Gatterbauer, Joseph Y. Halpern, Christoph Koch, Katherine F. Moore, Dan Suciu
2010 IEEE Data Engineering Bulletin  
to the query?  ...  The formal notion of causality is a more refined concept that identifies causes for observations based on user-defined criteria, and that assigns to them gradual degrees of responsibility based on their  ...  Fix a query q and an answer r, and consider k additional queries, called views, v 1 , . . . , v k , with answers b 1 , . . . , b k .  ... 
dblp:journals/debu/MeliouGHKMS10 fatcat:royiiyqzzjhg7kliv3qkq7j5ga

Efficient Computation of Polynomial Explanations of Why-Not Questions

Nicole Bidoit, Melanie Herschel, Aikaterini Tzompanaki
2015 Proceedings of the 24th ACM International on Conference on Information and Knowledge Management - CIKM '15  
This paper [6] focusses on processing Why-Not questions following a query-based approach that identifies the culprit query components.  ...  Answering a Why-Not question consists in explaining why the result of a query does not contain some expected data, called missing answers.  ...  [17] ), reverse skyline queries (Islam et. al. [22] ), reverse Top-k queries (WQRTQ [13] ), spatial keyword Top-K queries (Chen et. al. [10] ) etc.  ... 
doi:10.1145/2806416.2806426 dblp:conf/cikm/BidoitHT15 fatcat:yhn5i4qsbjbmxk7njdv5f6m6xq

Asynchronous Stochastic Optimization Robust to Arbitrary Delays [article]

Alon Cohen, Amit Daniely, Yoel Drori, Tomer Koren, Mariano Schain
2021 arXiv   pre-print
This improves over previous work, which showed that stochastic gradient decent achieves the same rate but with respect to the maximal delay max_t d_t, that can be significantly larger than the average  ...  This setting abstracts asynchronous distributed optimization where a central server receives gradient updates computed by worker machines.  ...  Table 2 : 2 Eventual (top-1) accuracy of the experiments in Fig.1for train and evaluation data sets.  ... 
arXiv:2106.11879v2 fatcat:tldfqi6vsjeu7lw5sxtwd5htrq

Why-query support in graph databases

Elena Vasilyeva
2016 2016 IEEE 32nd International Conference on Data Engineering Workshops (ICDEW)  
Considering graph queries to be complex structures with multiple constraints, iii we investigate different ways of generating explanations starting from the most general one that considers only a query  ...  The unexpectedness of result sets can be expressed in terms of their size or content. In the first case, users have to solve the empty-answer, too-many-, or too-few-answers problems.  ...  While top-k queries deliver K ranking results according to a user-defined weighting function, reverse top-k queries with respect to an item q return those preference functions from a given set of functions  ... 
doi:10.1109/icdew.2016.7495652 dblp:conf/icde/Vasilyeva16 fatcat:snct4vcbsrf4rpdjjbqtxyzpq4

Word embeddings and Global Preference for Contextual Suggestion

Jian Mo, Luc Lamontagne, Richard Khoury
2016 Text Retrieval Conference  
Formally, the user profile can be expressed as: Where is positive example suggestion i, and Pesik is element k (categories, tags, positive reviews, business info) of this positive suggestion. defines a  ...  The weighting parameters might be learnt by another training process which we didn't apply in these experiments. V. RESULTS AND ANALYSIS A.  ... 
dblp:conf/trec/MoLK16 fatcat:x4mt6cbcd5avveai2fnn6g53hm

NanoVar: Accurate Characterization of Patients' Genomic Structural Variants Using Low-Depth Nanopore Sequencing [article]

Cheng Yong Tham, Roberto Tirado-Magallanes, Yufen Goh, Melissa Jane Fullwood, Bryan T.H Koh, Wilson Wang, Chin Hin Ng, Wee Joo Chng, Alexandre Thiery, Daniel G Tenen, Touati Benoukraf
2019 bioRxiv   pre-print
The low sequencing depth requirements of NanoVar enable the use of Nanopore sequencing for accurate SV characterization at a lower sequencing cost, an approach compatible with clinical studies and large-scale  ...  A single top confidence scoring SV was selected from each breakend read ratio interval of 0.1 from 0.4 to 0.9, while the top three highest confidence scoring SVs were selected for the interval of 0.9 to  ...  Cells were pelleted by centrifugation again with the same settings.  ... 
doi:10.1101/662940 fatcat:gdcptznlmbf7ljhwux322gmoka

Continuous top-k query for graph streams

Shirui Pan, Xingquan Zhu
2012 Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12  
Our method represents the first research endeavor for data stream based top-k correlated graph query.  ...  In this paper, we propose to query correlated graphs in a data stream scenario, where an algorithm is required to retrieve the top k graphs which are mostly correlated to a query graph q.  ...  Queries Being Picky-Processing Top-K Queries with Set-Defined Selections (Page 912) Aleksandar Stupar (Saarland University) Sebastian Michel (Saarland University) Finding Top k Most Influential  ... 
doi:10.1145/2396761.2398717 dblp:conf/cikm/PanZ12a fatcat:lugcho6xdbdtzgg5srgcqkwvsa

A novel two-box search paradigm for query disambiguation

David C. Anastasiu, Byron J. Gao, Xing Jiang, George Karypis
2011 World wide web (Bussum)  
A vast advantage of Bobo is that a wide range of domain knowledge can be effectively utilized, where helpful contextual terms do not even need to co-occur with query terms on any page.  ...  altering the original query.  ...  In other words, given a query q j ∈ Q, the set {d 1 ...d j } of relevant documents for q j , and R jk , the set of retrieved documents from top to d k , and considering the precision of a set of retrieved  ... 
doi:10.1007/s11280-011-0154-0 fatcat:hxpyqkriybe7djugjftmijapnq

Optimizing Iceberg Queries with Complex Joins

Brett Walenz, Sudeepa Roy, Jun Yang
2017 Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17  
the join part of query processing, which can be exceedingly expensive even for a small result set.  ...  This paper proposes a framework for combining a number of techniques-a-priori, memoization, and pruning-to optimize iceberg queries with complex joins.  ...  For highly selective iceberg queries, pruning can be extremely effective, with a few queries seeing more than 300× speedup.  ... 
doi:10.1145/3035918.3064053 dblp:conf/sigmod/WalenzR017 fatcat:x7zvmf5vdnhyxmhhzjsi3itq5m

Stronger NAS with Weaker Predictors [article]

Junru Wu, Xiyang Dai, Dongdong Chen, Yinpeng Chen, Mengchen Liu, Ye Yu, Zhangyang Wang, Zicheng Liu, Mei Chen, Lu Yuan
2021 arXiv   pre-print
Extensive experiments demonstrate that WeakNAS costs fewer samples to find top-performance architectures on NAS-Bench-101 and NAS-Bench-201.  ...  Given limited samples, these predictors, however, are far from accurate to locate top architectures due to the difficulty of fitting the huge search space.  ...  k = { fk (s)|s ∈ X \ S k }, S M ⊂ Top N ( P k ), S k+1 = S M ∪ S k , where Top N ( P k ) denote the set of top N architectures in P k (Predictor Fitting) x * = arg max x∈X f (x|S k+1 ), s.t. fk+1 = arg  ... 
arXiv:2102.10490v3 fatcat:cwgtwgwshvezjihtkuk5vd5okq

Content-based retrieval for heterogeneous domains

Makoto P. Kato, Hiroaki Ohshima, Katsumi Tanaka
2012 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval - SIGIR '12  
However, input examples and relevant data can be dissimilar, especially when domains from which the user selects examples and from which the system retrieves data are different.  ...  To verify the effectiveness of our proposed method, we evaluated various methods with a test collection developed for content-based geographic object retrieval.  ...  Nakajima and Tanaka proposed a relative query processing method [18] . A relative query consists of a set of instances and an instance in the set.  ... 
doi:10.1145/2348283.2348392 dblp:conf/sigir/KatoOT12 fatcat:ikkyqsobhvd3jh7z7rwwrsrjfy

A Hierarchical Contraction Scheme for Querying Big Graphs

Wenfei Fan, Yuanhao Li, Muyang Liu, Can Lu
2022 Proceedings of the 2022 International Conference on Management of Data  
This paper proposes a scheme for querying big graphs with a single machine.  ...  For each query class Q in use, supernodes carry synopses 𝑆 Q such that queries of Q are answered by using 𝑆 Q if possible, and otherwise by drilling down to the next level with decontraction of a bounded  ...  and 𝐺 𝑘 is at the top level of H .  ... 
doi:10.1145/3514221.3517862 fatcat:ogoalvlzzbbibo4vwnovbprvqm
« Previous Showing results 1 — 15 out of 259 results