The traditional crawlers used by search engines to build their collection of Web pages frequently gather unmodified pages that already exist in their collection. This creates unne...
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Abstract. We present a novel algorithm called DBSC, which finds subspace clusters in numerical datasets based on the concept of ”dependency”. This algorithm employs a depth-...
In this paper, conceptual frequency rate, a new frequency definition suitable for query stream mining, is introduced. An online single-pass algorithm called OFSD (Online Frequent...
In many database applications, there are opportunities for multiple top-N queries to be evaluated at the same time. Often it is more cost effective to evaluate multiple such queri...