Published July 2022 | Published + Submitted
Conference Paper Open

Closure Operators: Complexity and Applications to Classification and Decision-making

An error occurred while generating the citation.

Abstract

We study the complexity of closure operators, with applications to machine learning and decision theory. In machine learning, closure operators emerge naturally in data classification and clustering. In decision theory, they can model equivalence of choice menus, and therefore situations with a preference for flexibility. Our contribution is to formulate a notion of complexity of closure operators, which translate into the complexity of a classifier in ML, or of a utility function in decision theory.

Additional Information

© 2022 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution International 4.0 License. The first author gratefully acknowledges support from Beyond Limits (Learning Optimal Models) through CAST (The Caltech Center for Autonomous Systems and Technologies). The second author gratefully acknowledges support from the National Science Foundation under grant number SES-1558757. We thank Chris Chambers for many comments and suggestions. We would like to thank our reviewers for their constructive feedback.

Attached Files

Published - 3490486.3538253.pdf

Submitted - 2202.05339.pdf

Files

3490486.3538253.pdf
Files (1.8 MB)
Name Size Download all
md5:e44bb6cae29d5137fdd1039b0d1a8426
1.5 MB Preview Download
md5:5f01b3fbda869f3e68b4ef06d96a4aad
301.5 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
December 21, 2023