Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability

Award ID(s):: 1931628

NSF-PAR ID:: 10387173

Author(s) / Creator(s):: Sambaturu, P; Gupta, A; Davidson, I; Ravi, SS; Vullikanti, A; Warren, A

Date Published:: 2020-01-01

Journal Name:: The Thirty-Fourth AAAI Conference on Artificial Intelligence

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.