Given a query location Q in multi-dimensional space, the classical KNN problem is to return the K spatially closest answers in the database with respect to Q. The KNDN (K-Nearest Diverse Neighbor) problem is a semantic extension where the objective is to return the spatially closest result set such that each answer is sufficiently different, or diverse, from the rest of the answers. We review h...

In this paper; we illustrate how Internet documents can be automatically analyzed in order to identih the document’s language. This language knowledge is then used for the Internet search engine, GETESS. The aim of the language-classijication heuristics is to ensure that documents with the same content, but different languages (e.g. , in German and English), will not simultaneously presented to...

Relying purely on query-page similarity when ranking Web search results limits the scope of the result set to the detriment of search performance. In this paper we propose that introducing diversity into the ranking metric can increase topic coverage without adversely affecting result relevance in the face of vague queries.

http://dx.doi.org/10.1016/j.vaccine.2016.09.067 0264-410X/ 2016 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecomm Dear Editor, We thank Pond and Mounier-Jack for their comments on our paper, ‘‘Monitoring vaccination coverage: Defining the role of surveys” [1]. We agree that for many countries, administrative estimates of coverage...

Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation that short patterns will tend to be interesting if they have a high support, whereas long patterns can still be very interesting even if their support is relatively low. However, a large number of non-closed (i.e., redu...

A coalgebraic, equational approach to the specification of observational structures allowing for a choice in the result type of observations is presented. Coalgebraic operations whose result type is structured as a coproduct of basic types are considered, and notions of coterm, covariable and coequation, dual to the algebraic notions of term, variable and equation, are used to specify structure...

Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the properties of minimal occurrences and design effective pruning techniques to prune non-closed episodes. An efficient mining algorithm Clo_episode is proposed to mine all closed episodes following a breadth-first sear...