A Lossless Data Reduction for Mining Constrained Patterns in n-ary Relations

@inproceedings{Poesia2014ALD,
  title={A Lossless Data Reduction for Mining Constrained Patterns in n-ary Relations},
  author={Gabriel Poesia and Lo{\"i}c Cerf},
  booktitle={ECML/PKDD},
  year={2014}
}
  • Gabriel Poesia, Loïc Cerf
  • Published in ECML/PKDD 2014
  • Mathematics, Computer Science
  • Given a binary relation, listing the itemsets takes exponential time. The problem grows worse when searching for analog patterns defined in n-ary relations. However, real-life relations are sparse and, with a greater number n of dimensions, they tend to be even sparser. Moreover, not all itemsets are searched. Only those satisfying some userdefined constraints, such as minimal size constraints. This article proposes to exploit together the sparsity of the relation and the presence of… CONTINUE READING
    1 Citations

    Figures, Tables, and Topics from this paper

    References

    SHOWING 1-10 OF 17 REFERENCES
    Closed patterns meet n-ary relations
    • 132
    • PDF
    Closed Pattern Mining from n-ary Relations
    • 2
    • Highly Influential
    • PDF
    ExAnte: Anticipated Data Reduction in Constrained Pattern Mining
    • 101
    • Highly Influential
    • PDF
    ExAMiner: optimized level-wise frequent pattern mining with monotone constraints
    • 81
    • PDF
    DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints
    • 184
    • PDF
    Scalable Mining of Frequent Tri-concepts from Folksonomies
    • 30
    • Highly Influential
    FP-Bonsai: The Art of Growing and Pruning Small FP-Trees
    • 63
    • PDF
    TRIAS--An Algorithm for Mining Iceberg Tri-Lattices
    • 139
    • Highly Influential
    • PDF
    Efficient mining of constrained correlated sets
    • 187