Maximal Closed Set and Half-Space Separations in Finite Closure Systems-Reference-Cited by-同舟云学术

Maximal Closed Set and Half-Space Separations in Finite Closure Systems

Published:2020 Issue: Volume: Page:21-37
ISSN:0302-9743
Container-title:Machine Learning and Knowledge Discovery in Databases
language:
Short-container-title:

Author:

Seiffarth Florian,Horváth Tamás,Wrobel Stefan

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-46150-8_2

Reference16 articles.

1. Artigas, D., Dantas, S., Dourado, M., Szwarcfiter, J.: Partitioning a graph into convex sets. Discret. Math. 311(17), 1968–1977 (2011)

2. Boser, B., Guyon, I., Vapnik, V.: A training algorithm for optimal margin classifiers. In: Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pp. 144–152. ACM Press (1992)

3. Lecture Notes in Computer Science;A Buluç,2016

4. Chepoi, V.: Separation of two convex sets in convexity structures. J. Geom. 50(1), 30–51 (1994)

5. Ellis, J.W.: A general set-separation theorem. Duke Math. J. 19(3), 417–421 (1952)

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

1. Efficient Vertical Mining of Frequent Quantitative Patterns;2023 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC/PiCom/CBDCom/CyberSciTech);2023-11-14

2. Social network mining and analytics for quantitative patterns;Proceedings of the International Conference on Advances in Social Networks Analysis and Mining;2023-11-06

3. Maximal closed set and half-space separations in finite closure systems;Theoretical Computer Science;2023-09

4. A Scalable Algorithm for Vertical Mining of Quantitative Frequent Patterns;2023 IEEE Smart World Congress (SWC);2023-08-28

5. Online Learning of Convex Sets on Graphs;Machine Learning and Knowledge Discovery in Databases;2023