arXiv:2202.05339
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Semantic Structure Enhanced Contrastive Adversarial Hash Network for Cross-media Representation Learning
Enhancing Cluster Analysis With Explainable AI and Multidimensional Cluster Prototypes
Explainable Debugger for Black-box Machine Learning Models
Analysis of Kepler Objects of Interest using Machine Learning for Exoplanet Identification
Twitter Sentiment Analysis
ExploreKit: Automatic Feature Generation and Selection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.