A temporal graph network (TGN) algorithm is introduced to identify fraudulent activities within a digital platform. The central premise is that digital transactions can be modeled via a graph network where various entities interact. The data used to build an event-based temporal graph (ETG) were sourced from an online payment platform and include details such as users, cards, devices, bank accounts, and features related to all these entities. Based on these data, seven distinct graphs were created; the first three represent individual interaction events (card registration, device registration, and bank account registration), while the remaining four are combinations of these graphs (card–device, card–bank account, device–bank account, and card–device–bank account registration). This approach was adopted to determine if the graph’s structure influenced the detection of fraudulent transactions. The results demonstrate that integrating more interaction events into the graph enhances the metrics, meaning graphs containing more interaction events yield superior fraud detection results than those based on individual events. In addition, the data used in this work correspond to Latin American payment transactions, which is relevant in the context of fraud detection since this region has the highest fraud rate in the world, yet few studies have focused on this issue.
1 January 2013 in Lecture Notes in Computer Science
The belief revision process involves several problems considered hard. One of the crucial problems is how to represent to the knowledge base K to consider, as well as how to represent and to add new information , which may even be contradictory to the knowledge base. In this work, both the knowledge base and the new information are in conjunctive normal form. Each clause of a conjunctive normal form is encoded by a string consisting of: 0, 1, *, representing the falsifying assignments of the clause. To use the falsifying assignments of the clauses allows to perform efficiently different logical operators among conjunctive forms. Our belief revision process (K * ) between conjunctive forms is based on solving first the propositional inference, i.e. K = . Based on to count falsifying assignments represented by tertiary chains, an algorithmic proposal is made that allows to determine in a practical way, when (K E ( K * )) is inconsistent. Finally, the time-complexity analysis of our algorithmic proposal is carried out.
1 January 2007 in Lecture Notes in Computer Science
The issue of counting independent sets of a graph, G, represented as , is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics, and chemistry. In chemistry, is recognized as the Merrifield–Simmons (M-S) index for molecular graphs, which is one of the most relevant topological indices related to the boiling point in chemical compounds. This article introduces an innovative algorithm designed for tallying independent sets within grid-like structures. The proposed algorithm is based on the ‘branch-and-bound’ technique and is applied to compute for a square grid formed by m rows and n columns. The proposed approach incorporates the widely recognized vertex reduction rule as the basis for splitting the current subgraph. The methodology involves breaking down the initial grid iteratively until outerplanar graphs are achieved, serving as the ’basic cases’ linked to the leaf nodes of the computation tree or when no neighborhood is incident to a minimum of five rectangular internal faces. The time complexity of the branch-and-bound algorithm speeds up the computation of compared to traditional methods, like the transfer matrix method. Furthermore, the scope of the proposed algorithm is more general than the algorithms focused on grids since it could be applied to process general mesh graphs.