Concise descriptions of subsets of structured sets

  title={Concise descriptions of subsets of structured sets},
  author={A. Mendelzon and Ken Q. Pu},
  • A. Mendelzon, Ken Q. Pu
  • Published in PODS 2003
  • Computer Science
  • We study the problem of economical representation of subsets of structured sets, that is, sets equipped with a set cover. Given a structured set U, and a language L whose expressions define subsets of U, the problem of Minimum Description Length in L (L-MDL) is: "given a subset V of U, find a shortest string in L that defines V".We show that the simple set cover is enough to model a number of realistic database structures. We focus on two important families: hierarchical and multidimensional… CONTINUE READING
    15 Citations
    The Summarization of Hierarchical Data with Exceptions
    • 5
    • PDF
    MDL Summarization with Holes
    • 32
    • PDF
    Computing Partitions within SQL Queries: A Dead End?
    • 1
    Analyzing a Greedy Approximation of an MDL Summarization
    • Peter Fontana fontanap
    • 2007
    Summarizing Hierarchical Multidimensional Data
    Cluster Description Formats, Problems and Algorithms
    • 10
    • Highly Influenced
    • PDF
    Interpretable and reconfigurable clustering of document datasets by deriving word-based rules
    • 14
    • PDF
    Hyper-rectangle-based discriminative data generalization and applications in data mining
    • 9
    • Highly Influenced
    Turning Clusters into Patterns: Rectangle-Based Discriminative Data Description
    • B. Gao, M. Ester
    • Computer Science
    • Sixth International Conference on Data Mining (ICDM'06)
    • 2006
    • 18
    • Highly Influenced
    • PDF


    The Generalized MDL Approach for Summarization
    • 61
    • Highly Influential
    • PDF
    Automatic subspace clustering of high dimensional data for data mining applications
    • 2,567
    • Highly Influential
    • PDF