Titlebook: Database and Expert Systems Applications; 24th International C Hendrik Decker,Lenka Lhotská,A Min Tjoa Conference proceedings 2013 Springer

打火石

摘要記錄

Vector, Tensors, and Related Mattersnce objects in the query ordered lists. We study the performance and efficiency of our algorithms on large-scale dataset of millions of documents. Experimental results show a decrease of computational time while preserving the quality of the results.

讓你明白

Kolumban Hutter Ph.D.,Klaus J?hnkobal FP-tree traversal for finding Right-hand Side items. Second, . uses a modified pruning strategy. Third, . adopts a minimal coverset that is used to exclude non-minimal approximate CFDs. For these algorithms, we theoretically proved the correctness and experimentally evaluated the performances.

壯觀的游行

耐寒

放肆的你

gratify

,Plasticity Over 150?Years (1864–2014),System (UMLS) is used then for filtering. The filtering method aims to keep only relevant descriptors. The experiments of our approach that have been carried out on the OHSUMED collection, showed very encouraging results.

Extricate

https://doi.org/10.1007/3-7643-7383-0uced search space of candidate matches to find complex matches. We conclude with experimental results that illustrate how the technique works. Furthermore, we show that the proposed technique greatly improves results over those obtained if the Estimate Mutual Information matrix or the Genetic Programming techniques were to be used independently.

enlist

jarring

Dynamic Multi-probe LSH: An I/O Efficient Index Structure for Approximate Nearest Neighbor Searchich groups small hash buckets into a single bucket by dynamically increasing the number of hash functions during the index construction. Experimental results show that our method is significantly more I/O efficient.