Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices-Reference-Cited by-同舟云学术

Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices

Published:2011 Issue: Volume: Page:49-64
ISSN:0302-9743
Container-title:Formal Concept Analysis
language:
Short-container-title:

Author:

Balcázar José L.,Tîrnăucă Cristina

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20514-9_6

Reference21 articles.

1. Aggarwal, C.C., Yu, P.S.: A new approach to online generation of association rules. IEEE Transactions on Knowledge and Data Engineering 13(4), 527–540 (2001)

2. Baixeries, J.: Lattice Characterization of Armstrong and Symmetric Dependencies. Ph.D. thesis, Universitat Politècnica de Catalunya (2007)

3. Baixeries, J.: A formal context for symmetric dependencies. In: Medina and Obiedkov [15], pp. 90–105

4. Baixeries, J., Balcázar, J.L.: Unified characterization of symmetric dependencies with lattices. In: Ganter, B., Kwuida, L. (eds.) Contributions to the 4th International Conference on Formal Concept Analysis (ICFCA). Verlag Allgemeine Wissensch (2006)

5. Lecture Notes in Computer Science;J. Baixeries,2009

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computing triadic generators and association rules from triadic contexts;Annals of Mathematics and Artificial Intelligence;2022-02-03

2. Pattern Discovery in Triadic Contexts;Ontologies and Concepts in Mind and Machine;2020

3. Formal and computational properties of the confidence boost of association rules;ACM Transactions on Knowledge Discovery from Data;2013-11

4. Partially ordered sets and stratification;Mathematical Social Sciences;2013-11