1390 search results - page 113 / 278 » Self-Sizing of Clustered Databases |
117
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
193
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper, we introduce the concept of a QA-Pagelet to refer to the content region in a dynamic page that contains query matches. We present THOR, a scalable and efficient min...
207
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
78
Voted
KDD
2005
ACM
16 years 2 months ago
2005
ACM
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
105
click to vote
KDD
2002
ACM
16 years 2 months ago
2002
ACM
Part of the process of data integration is determining which sets of identifiers refer to the same real-world entities. In integrating databases found on the Web or obtained by us...