Results 41 to 50 of about 2,525,419 (350)
Semi-supervised Credit Card Fraud Detection via Attribute-Driven Graph Representation [PDF]
Credit card fraud incurs a considerable cost for both cardholders and issuing banks. Contemporary methods apply machine learning-based classifiers to detect fraudulent behavior from labeled transaction records.
Sheng Xiang +7 more
semanticscholar +1 more source
Summarizing Labeled Multi-graphs
17 pages, 8 figures, 4 ...
Berberidis, Dimitris +2 more
openaire +2 more sources
A Note on 1-Edge Balance Index Set [PDF]
A graph labeling is an assignment of integers to the vertices or edges or both, subject to certain conditions. Varieties of graph labeling have been investigated by many authors [2], [3] [5] and they serve as useful models for broad range of ...
Chandrashekar Adiga, +2 more
core +1 more source
RelTR: Relation Transformer for Scene Graph Generation [PDF]
Different objects in the same scene are more or less related to each other, but only a limited number of these relationships are noteworthy. Inspired by Detection Transformer, which excels in object detection, we view scene graph generation as a set ...
Yuren Cong, M. Yang, B. Rosenhahn
semanticscholar +1 more source
Odd Fibonacci Stolarsky-3 Mean Labeling of Some Special Graphs
Let G be a graph with p vertices and q edges and an injective function where each is a odd Fibonacci number and the induced edge labeling are defined by and all these edge labeling are distinct is called Odd Fibonacci Stolarsky-3 Mean Labeling.
M Sree Vidya, S.S Sandhya
doaj +1 more source
Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning [PDF]
Graph representation learning plays a vital role in processing graph-structured data. However, prior arts on graph representation learning heavily rely on labeling information. To overcome this problem, inspired by the recent success of graph contrastive
Ming Jin +5 more
semanticscholar +1 more source
On labeled graph $C^*$-algebras
Given a directed graph $E$ and a labeling $\mathcal{L}$, one forms the labeled graph $C^*$-algebra by taking a weakly left--resolving labeled space $(E, \mathcal{L}, \mathcal{B})$ and considering a universal generating family of partial isometries and projections.
Banjade, Debendra P., Ephrem, Menassie
openaire +4 more sources
L(2,1)—labeling of the bracelet graph
In order to better study the channel assignment problem, a function from the vertex set to the set of all nonnegative integers is generated, that is the L(2,1)—labeling of a graph. Let the least label be zero, the L(2,1)—labeling number of a graph is the
Haiping LI, Ying YANG
doaj +1 more source
-labeling of supersubdivided connected graph plus an edge
Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source
On the study of Rainbow Antimagic Coloring of Special Graphs
Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge .
Dafik Dafik +3 more
doaj +1 more source

