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

MINT

后来

Hepatotoxicity of Oral Contraceptivesociations rules can be either exact or approximate. We also illustrate the efficiency of our approach over several data sets and we prove that .-based classification rules have very encouraging results.

conspicuous

Contract Theory in Continuous-Time Modelslational databases, based on similar techniques previously proposed for conventional XML documents. Also, we present a new ordered-based approach on representing context in such a way so as to facilitate the formulation of context-aware queries, and we show how we can manipulate context.

Adherent

Antagonism

Genetic Programming with Greedy Search for Web Service Compositiontal evaluation has been carried out using public benchmark test cases with repositories of up to 15,000 web services and 31,000 properties. The results show good performance in searching for best service compositions, where the number of atomic web services used and the tree depth are used as objectives for minimization.

使人烦燥

Inferring Knowledge from Concise Representations of Both Frequent and Rare Jaccard Itemsetsociations rules can be either exact or approximate. We also illustrate the efficiency of our approach over several data sets and we prove that .-based classification rules have very encouraging results.

人工制品

饥荒

stressors

Evaluating the Interest of Revamping Past Search Resultsaw are applied to construct simulated document collections suitable for information retrieval evaluation. Experiments comparing a traditional retrieval approach with our approach based on past queries using past queries show encouraging improvements using our approach.

闲逛

Efficient Time Aggregation and Querying of Flashed Streams in Constrained Motesams, we discuss the approach and study how to optimize group-by aggregation over time-ordered data in that context, and to provide simple all-purpose group-by and join algorithms. We used an experimental testbed to evaluate the findings and prove the advantage of the alternatives and studies that we made.