Optimizing parameter selection in bidirectional encoder portrayal for transformers algorithm using particle swarm optimization for artificial intelligence generate essay detection
This research proposes a novel method for detecting artificial intelligence (AI)-generated essays by integrating the bidirectional encoder representations from transformers (BERT) model with particle swarm optimization (PSO). Unlike traditional approaches that rely on manual hyperparameter tuning, this study introduces a systematic optimization technique using PSO to improve BERT’s performance in identifying AI-generated content. The key problem addressed is the lack of effective, real-time detection systems that preserve academic integrity amidst rapid AI advancements. This optimization enhances the model’s detection accuracy and operational efficiency. The research dataset consisted of 46,246 essays, which, after data cleaning, were refined to 44,868. The model was then tested on 9,250 essays. Initial evaluations showed BERT's accuracy ranging from 83% to 94%. After being optimized with PSO, the model achieved an accuracy of 98%, an F1-score of 98.31%, precision of 97.75%, and recall of 98.87%. The model was deployed using a FastAPI-based web interface, enabling real-time detection and providing users with an efficient way to quickly verify text authenticity. This research contributes a scalable, automated solution for AI-generated text detection and offers promising implications for its application in various academic and digital content verification contexts.
Collaboration network of the authors
11 authors ·
23 co-authorship links
· 2 across different organisations
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Institut Teknologi Del
Bandung Institute of Technology
Different organisations
Same organisation
Affiliation unknown
Thicker line = more joint articles · bigger circle = more articles
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.