Zobrazeno 1 - 10
of 114
pro vyhledávání: '"TURÁN, GYÖRGY"'
We formulate an XAI-based model improvement approach for Graph Neural Networks (GNNs) for node classification, called Explanation Enhanced Graph Learning (EEGL). The goal is to improve predictive performance of GNN using explanations. EEGL is an iter
Externí odkaz:
http://arxiv.org/abs/2403.07849
Autor:
Naik, Harish, Turán, György
Explainable components in XAI algorithms often come from a familiar set of models, such as linear models or decision trees. We formulate an approach where the type of explanation produced is guided by a specification. Specifications are elicited from
Externí odkaz:
http://arxiv.org/abs/2012.07179
A nearest neighbor representation of a Boolean function is a set of positive and negative prototypes in $R^n$ such that the function has value 1 on an input iff the closest prototype is positive. For $k$-nearest neighbor representation the majority c
Externí odkaz:
http://arxiv.org/abs/2004.01741
Publikováno v:
In Information and Computation May 2022 285 Part B
We administered the Verbal IQ (VIQ) part of the Wechsler Preschool and Primary Scale of Intelligence (WPPSI-III) to the ConceptNet 4 AI system. The test questions (e.g., "Why do we shake hands?") were translated into ConceptNet 4 inputs using a combi
Externí odkaz:
http://arxiv.org/abs/1509.03390
In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of sublogarithm
Externí odkaz:
http://arxiv.org/abs/1410.0245
We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number $\mathrm{Cov}(G)$ and the minimal rectifier network size $\mathrm{Rect}(G)$ of a bipartite graph $G$. We show that there exist graphs with $\mathrm{Cov}
Externí odkaz:
http://arxiv.org/abs/1406.0017
Publikováno v:
In Theoretical Computer Science 7 January 2017 658 Part B:417-428
Publikováno v:
In Discrete Applied Mathematics 2008 156(4):530-544
Publikováno v:
In Theoretical Computer Science 2007 382(3):198-208