<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
    <responseDate>2026-08-08T12:23:54.212Z</responseDate>
    <request verb="GetRecord" identifier="ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:12128" metadataPrefix="dim">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:12128</identifier>
                <datestamp>2026-08-01T21:38:10Z</datestamp>
                <setSpec>2</setSpec>
            </header>
            <metadata>
                <dim:dim>
                    <dim:field mdschema="dc" element="title" lang="en">Click Fraud Detection With Recurrent Neural Networks Optimized by an Adapted Version of Variable Neighborhood Search Algorithm</dim:field>
                    <dim:field mdschema="dc" element="date" qualifier="issued">2026</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/2/12128</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">https://onlinelibrary.wiley.com/doi/10.1111/coin.70283</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:56659" confidence="-1">V. Zeljkovic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-4351-068X" confidence="-1">M. Zivkovic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:56661" confidence="-1">F. Al-Turjman</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0001-9107-5398" confidence="-1">J. Gajic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="etfid:178" confidence="-1">L. Babic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0001-9666-5477" confidence="-1">A. Djordjevic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-5511-2531" confidence="-1">M. Antonijevic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-2062-924X" confidence="-1">N. Bacanin</dim:field>
                    <dim:field mdschema="dc" element="description" qualifier="abstract">The revenue generated from online ads has become quite significant, and as with the advancement in any sort of business, this one brings fraudsters with it. However, different forms of fraud can be performed as this work tackles the problems of click fraud in advertisements. In this case, the fraud can be performed by the party that bought the advertisement to boost its revenue, or by other malicious parties that tend to exhaust the resources for the said ad, for example. Due to this and many other scenarios, a robust solution for detecting such cases must be established. However, existing click fraud detection approaches either rely on static rule-based systems or deep learning models with manually tuned hyperparameters, which may result in limited adaptability and suboptimal performance in complex sequential environments. Therefore, there is a need for an adaptive optimization strategy capable of effectively tuning sequential models for improved fraud detection accuracy. This work proposes three different types of recurrent neural networks (RNNs) that are combined with the attention mechanism. Furthermore, in each of the three different experiments, the networks were optimized by strong metaheuristics optimizers, the results of which were compared to establish the strongest one. This was done with the purpose of confirming the improvements to the variable neighborhood search (VNS) algorithm, which was proposed by the authors in this work. The best synthesized RNN model tuned by the suggested modified optimizer attained accuracy of 0.806569, with Matthews correlation coefficient of 0.613209.</dim:field>
                    <dim:field mdschema="dc" element="type">article</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="doi">10.1111/coin.70283</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="volume">42</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="issue">4: e70283</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="issn">0824-7935</dim:field>
                    <dim:field mdschema="dc" element="source">COMPUTATIONAL INTELLIGENCE</dim:field>
                </dim:dim>
            </metadata>
        </record>
    </GetRecord>
</OAI-PMH>
