Closure operators: Complexity and applications to classification and decision-making
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.
Code (0)
등록된 구현이 없습니다.
Tasks
BIG-bench Machine LearningClassificationClusteringDecision MakingSimilar Papers 제목 키워드 기반
Beyond Closure Models: Learning Chaotic-Systems via Physics-Informed Neural Operators
Accurately predicting the long-term behavior of chaotic systems is crucial for various applications such as climate modeling. However, achieving such predictions typically requires iterative computations over a dense spa…
Finite Confluences and Closed Pattern Mining
The purpose of this article is to propose and investigate a partial order structure weaker than the lattice structure and which have nice properties regarding closure operators. We extend accordingly closed pattern minin…
CNC-TP: Classifier Nominal Concept Based on Top-Pertinent Attributes
Knowledge Discovery in Databases (KDD) aims to exploit the vast amounts of data generated daily across various domains of computer applications. Its objective is to extract hidden and meaningful knowledge from datasets t…
Decision support from financial disclosures with deep neural networks and transfer learning
Company disclosures greatly aid in the process of financial decision-making; therefore, they are consulted by financial investors and automated traders before exercising ownership in stocks. While humans are usually able…
Decision MakingDeep LearningTransfer LearningThe Transformation Logics
We introduce a new family of temporal logics designed to finely balance the trade-off between expressivity and complexity. Their key feature is the possibility of defining operators of a new kind that we call transformat…