<?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-10-08T23:45:14.463Z</responseDate>
    <request verb="GetRecord" identifier="ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:12173" metadataPrefix="dim">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:12173</identifier>
                <datestamp>2026-09-10T23:34:21Z</datestamp>
                <setSpec>2</setSpec>
            </header>
            <metadata>
                <dim:dim>
                    <dim:field mdschema="dc" element="title" lang="en">Detecting click fraud instances using modified metaheuristic optimized recurrent networks</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/12173</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">https://link.springer.com/article/10.1007/s10586-026-06493-z</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="contributor" qualifier="author" authority="orcid::0000-0001-8502-2038" confidence="-1">Z. Spalevic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:56933" confidence="-1">R. Dragic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-7865-2135" confidence="-1">D. Markovic</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-0002-1003-3493" confidence="-1">I. Milovanovic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0001-9402-7391" confidence="-1">L. Jovanovic</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="etfid:559" confidence="-1">P. Spalevic</dim:field>
                    <dim:field mdschema="dc" element="description" qualifier="abstract">In the digital age, online businesses often rely on advertising as a primary source of revenue. Many services and platforms depend on advertisement income to remain operational, allowing free services to be sustained through ad funding. Advertisers typically pay per click, with fees determined by click-through rates. However, a major challenge in this system is click fraud, a deceptive practice in which advertisements are repeatedly clicked without genuine interest or intent to make a purchase. This behavior leads to financial losses for advertisers, damages platform reputations, and distorts the effectiveness of online advertising. Detecting fraudulent clicks remains a complex challenge due to the constantly evolving tactics employed by fraudsters. This study explores the potential of artificial intelligence (AI) classifiers for identifying instances of click fraud. Because the performance of AI-based classifiers strongly depends on proper hyperparameter selection, a modified optimization metaheuristic is introduced to improve classification accuracy. A comparative analysis is conducted using real-world data, demonstrating promising results from the best-performing models with accuracy as high as 0.786496. Finally, the legal and policy implications of such a system are examined within the context of an evolving digital landscape.</dim:field>
                    <dim:field mdschema="dc" element="type">article</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="doi">10.1007/s10586-026-06493-z</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="volume">29</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="issue">724</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="issn">1386-7857</dim:field>
                    <dim:field mdschema="dc" element="source">Cluster Computing</dim:field>
                </dim:dim>
            </metadata>
        </record>
    </GetRecord>
</OAI-PMH>
