Recruitment process graph based unsupervised anomaly detection

Abstract

In some examples, recruitment process graph based unsupervised anomaly detection may include obtaining log data associated with a recruitment process for a plurality of candidates, and generating knowledge graphs and graph embeddings. The graph embeddings may be trained to include a plurality of properties such that graph embeddings of genuine candidate hires and fraudulent candidate hires are appropriately spaced in a vector space. The trained graph embeddings may be clustered to generate a plurality of embedding clusters that include a genuine candidate cluster, and a fraudulent candidate cluster. For a new candidate graph embedding for a new candidate, a determination may be made as to whether the new candidate graph embedding belongs to the genuine candidate cluster, to the fraudulent candidate cluster, or to an anomalous cluster, and instructions may be generated to respectively retain or suspend the new candidate.