<?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-05-04T19:54:24.104Z</responseDate>
    <request verb="GetRecord" identifier="ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:3:11652" metadataPrefix="dim">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:3:11652</identifier>
                <datestamp>2025-10-21T23:43:03Z</datestamp>
                <setSpec>3</setSpec>
            </header>
            <metadata>
                <dim:dim>
                    <dim:field mdschema="dc" element="title" lang="en">Click Stream Analysis and Fraud Detection Using Modified Metaheuristic Optimized Gated Recurrent Unit Based Models, Chapter in LNNS Lecture Notes in Networks and Systems: ICDAM 2025: International Conference on Data Analytics and Management, Springer, volume 1597</dim:field>
                    <dim:field mdschema="dc" element="date" qualifier="issued">2025</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/3/11652</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">https://link.springer.com/chapter/10.1007/978-3-032-02831-0_2</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="id:53896" confidence="-1">V. Zeljkovic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:53897" confidence="-1">S. Ivanovic</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-5511-2531" confidence="-1">M. Antonijevic</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="orcid::0000-0002-4825-8102" confidence="-1">M. Markovic Blagojevic</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">Click traffic plays a major role for advertisers and platforms hosting content. Higher click traffic indicates greater interest in advertisements and promoted material. Compensation is usually associated with click traffic volume, with higher click rates leading to better user-to-customer conversion rates and improved sales and promotion outcomes. However, this link between click rates and compensation has led to an interesting phenomenon known as click fraud, where clicks are generated without genuine interest to exploit advertisers. This can damage the reputation of platforms, deplete advertising budgets, and impact revenue streams for content creators. Nevertheless, distinguishing genuine clicks from fraudulent activity can be challenging, as attackers constantly adapt their strategies to avoid detection. This work explores the use of click-stream analysis by applying gated recurrent unit (GRU)-based networks to identify fraudulent click traffic. Since the performance of classifiers remains tightly coupled with parameter selection, a modified metaheuristic algorithm is introduced to improve outcomes through hyperparameter tuning. Simulations on real-world data have shown promising results, with the best-performing models achieving an accuracy as high as 0.790146.</dim:field>
                    <dim:field mdschema="dc" element="type">bookPart</dim:field>
                    <dim:field mdschema="dc" element="publisher">Springer, Cham</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="spage">16</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="epage">26</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="doi">10.1007/978-3-032-02831-0_2</dim:field>
                    <dim:field mdschema="dc" element="source">LNNS Lecture Notes in Networks and Systems: ICDAM 2025: Proceedings of Data Analytics and Management, volume 1597</dim:field>
                </dim:dim>
            </metadata>
        </record>
    </GetRecord>
</OAI-PMH>
