<?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-10T08:02:42.065Z</responseDate>
    <request verb="GetRecord" identifier="ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:1:11209" metadataPrefix="dim">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:1:11209</identifier>
                <datestamp>2025-06-13T13:58:39Z</datestamp>
                <setSpec>1</setSpec>
            </header>
            <metadata>
                <dim:dim>
                    <dim:field mdschema="dc" element="title" lang="en">Modified Metaheuristics Optimization for Cyberbullying Detection on Online Data Science Platform</dim:field>
                    <dim:field mdschema="dc" element="date" qualifier="issued">2024</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/1/11209</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">https://ieeexplore.ieee.org/document/10896377</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-9402-7391" confidence="-1">L. Jovanovic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:51599" confidence="-1">I. Uzelac Bujisic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:51600" confidence="-1">C. Stoean</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="orcid::0000-0002-5135-8083" confidence="-1">J. Kaljevic</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:51602" confidence="-1">J. Cadjenovic</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="description" qualifier="abstract">Online harassment detection faces significant challenges due to its expansive reach and anonymity. Addressing this issue demands effective detection mechanisms capable of processing vast data streams and adapting to evolving online languages. Leveraging advancements in artificial intelligence, we propose a novel approach grounded in natural language processing (NLP) and metaheuristic algorithms. Our methodology integrates term frequency-inverse document frequency (TF-IDF) encoding and the AdaBoost algorithm for classification. To tackle the NP-hard problem of hyperparameter selection, we introduce a modified crayfish optimization algorithm (COA), termed GI-COA. This paper represents a pioneering effort in utilizing metaheuristic algorithms for hyperparameter selection in harassment detection models. Through experimentation, we demonstrate the efficacy of our approach in fostering a safer online environment. The best-performing optimized models demonstrate an accuracy exceeding 77%.</dim:field>
                    <dim:field mdschema="dc" element="type">conferenceObject</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="spage">292</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="epage">298</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="doi">10.1109/SYNASC65383.2024.00055</dim:field>
                    <dim:field mdschema="dc" element="source">2024 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), IEEE, Timisoara, Romania</dim:field>
                </dim:dim>
            </metadata>
        </record>
    </GetRecord>
</OAI-PMH>
