In an age of the growing use of Machine-learning, it has become an imperative task to be able to explain the processes behind the functions of many "black box" models. The explainability feature of artificial intelligence is key to building trust between humans and computers' algorithmic predictions. One of the main ways to generate this interpretability is through attribution methods, which produce importance values of each feature for a single instance in a dataset. There are many different ways of attribution for various Machine-learning models, including ones designed for specific models or "model agnostic" attribution methods—ones that do not require a specific model to achieve importance values. These attribution methods are valued because of their easily understood nature. While evaluation procedures exist such as generality and precision for rule-based explanation methods, these have not been used on attribution methods until recently. A recent experiment by Ratul et al. [1] proved that the two most popular local model-agnostic attribution methods, LIME and SHAP, have poor precision and generality. In this paper, we propose a new attribution method, the Generality and Precision Shapley Attributions (GAPS). To evaluate these models, we use the generality and precision equations used previously to evaluate the other models. We present our findings that GAPS produces higher generality and precision scores than the existing LIME and SHAP models.

Starting in 2013, the International Consortium of Investigative Journalists released a series of networks, known as the Offshore Leaks Networks, detailing the information of entities and transactions of offshore accounts. Through cross-referencing with known blacklists of entities, illicit individuals and transactions were able to be identified in the networks provided. In machine learning research, the Offshore Leaks Networks draws off of large databases of data to classify many nodes in high dimensional space. The chief problem with node classification is that the illicit entities are not always known, and techniques have been devised to tackle this problem, such as centrality and structural-based learning. In this paper, SparseStruct—the algorithm developed by Serra et al. [1]— is shown to achieve the best results. This is because it uses a structural node representational learning technique able to identify specific structural patterns in the graph. This technique achieved AUROC scores of between 0.61 and 0.81, with three of the four scores being the top score of all classifiers compared.