Closed patterns meet n-ary relations

@article{Cerf2009ClosedPM,
  title={Closed patterns meet n-ary relations},
  author={Lo{\"i}c Cerf and J{\'e}r{\'e}my Besson and C{\'e}line Robardet and Jean-François Boulicaut},
  journal={TKDD},
  year={2009},
  volume={3},
  pages={3:1-3:36}
}
Set pattern discovery from binary relations has been extensively studied during the last decade. In particular, many complete and efficient algorithms for frequent closed set mining are now available. Generalizing such a task to n-ary relations (n ≥ 2) appears as a timely challenge. It may be important for many applications, for example, when adding the time dimension to the popular objects × features binary case. The generality of the task (no assumption being made on the relation arity or on… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 169 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 95 extracted citations

Interesting pattern mining in multi-relational data

Data Mining and Knowledge Discovery • 2013
View 6 Excerpts
Highly Influenced

On closure operators related to maximal tricliques in tripartite hypergraphs

Discrete Applied Mathematics • 2018
View 8 Excerpts
Highly Influenced

HDminer: Efficient Mining of High Dimensional Frequent Closed Patterns from Dense Data

2014 IEEE International Conference on Data Mining Workshop • 2014
View 4 Excerpts
Highly Influenced

Biclustering meets triadic concept analysis

Annals of Mathematics and Artificial Intelligence • 2013
View 5 Excerpts
Highly Influenced

169 Citations

02040'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 169 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

TRIAS--An Algorithm for Mining Iceberg Tri-Lattices

Sixth International Conference on Data Mining (ICDM'06) • 2006
View 7 Excerpts
Highly Influenced

Espresso-MV: Algorithms for multiple valued logic minimization

R. RUDELL, A. SANGIOVANNI-VINCENTELLI
Proceedings of the IEEE Custom International Circuit Conference. IEEE Computer Society, 230–234. • 1985
View 13 Excerpts
Highly Influenced

Logic Minimization Algorithms for VLSI Synthesis

R. K. BRAYTON, A. L. SANGIOVANNI-VINCENTELLI, C. T. MCMULLEN, G. D. HACHTEL
Kluwer Academic, Norwell, MA. • 1984
View 4 Excerpts
Highly Influenced

Fast algorithms for frequent itemset mining using FP-trees

IEEE Transactions on Knowledge and Data Engineering • 2005
View 1 Excerpt
Highly Influenced

MVSIS . In Notes of the IEEE International Workshop on Logic Synthesis

M. GAO, J.-H. JIANG, Y. JIANG, Y. LI, S. SINHA
2000
View 1 Excerpt
Highly Influenced

Mvsis

M. GAO, JIANG, +4 authors R. BRAYTON
Notes of the IEEE International Workshop on Logic Synthesis. IEEE Computer Society. • 2000
View 2 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…