1778 search results - page 211 / 356 » The Theory of Probabilistic Databases |
145
click to vote
KDD
2006
ACM
16 years 5 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...
215
click to vote
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
We present SchemaScope, a system to derive Document Type Definitions and XML Schemas from corpora of sample XML documents. Tools are provided to visualize, clean, and refine exist...
123
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
We initiate a novel study of clustering problems. Rather than specifying an explicit objective function to optimize, our framework allows the user of clustering algorithm to speci...
119
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasets structured as graphs. We present an efficient algorithm for minin...
123
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
In the paper we describe the problem of grouping and aggregation in the concept-oriented data model. The model is based on ordering its elements within a hierarchical multidimensi...