SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Saadatmand Mehrdad 1980 )
 

Sökning: WFRF:(Saadatmand Mehrdad 1980 ) > (2021) > An LSTM-Based Plagi...

  • Moravvej, S. V.Department of Computer Engineering, Isfahan University of Technology, Isfahan, Iran (författare)

An LSTM-Based Plagiarism Detection via Attention Mechanism and a Population-Based Approach for Pre-training Parameters with Imbalanced Classes

  • Artikel/kapitelEngelska2021

Förlag, utgivningsår, omfång ...

  • 2021-12-05
  • Cham :Springer Science and Business Media Deutschland GmbH,2021
  • printrdacarrier

Nummerbeteckningar

  • LIBRIS-ID:oai:DiVA.org:mdh-56879
  • https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-56879URI
  • https://doi.org/10.1007/978-3-030-92238-2_57DOI
  • https://urn.kb.se/resolve?urn=urn:nbn:se:ri:diva-57902URI

Kompletterande språkuppgifter

  • Språk:engelska
  • Sammanfattning på:engelska

Ingår i deldatabas

Klassifikation

  • Ämneskategori:ref swepub-contenttype
  • Ämneskategori:kon swepub-publicationtype

Anmärkningar

  • Plagiarism is one of the leading problems in academic and industrial environments, which its goal is to find the similar items in a typical document or source code. This paper proposes an architecture based on a Long Short-Term Memory (LSTM) and attention mechanism called LSTM-AM-ABC boosted by a population-based approach for parameter initialization. Gradient-based optimization algorithms such as back-propagation (BP) are widely used in the literature for learning process in LSTM, attention mechanism, and feed-forward neural network, while they suffer from some problems such as getting stuck in local optima. To tackle this problem, population-based metaheuristic (PBMH) algorithms can be used. To this end, this paper employs a PBMH algorithm, artificial bee colony (ABC), to moderate the problem. Our proposed algorithm can find the initial values for model learning in all LSTM, attention mechanism, and feed-forward neural network, simultaneously. In other words, ABC algorithm finds a promising point for starting BP algorithm. For evaluation, we compare our proposed algorithm with both conventional and population-based methods. The results clearly show that the proposed method can provide competitive performance.

Ämnesord och genrebeteckningar

Biuppslag (personer, institutioner, konferenser, titlar ...)

  • Mousavirad, S. J.Department of Computer Engineering, Hakim Sabzevari Univesity, Sabzevar, Iran (författare)
  • Helali Moghadam, MahshidRISE,Industriella system,Mälardalen University, Sweden,RISE Research Institutes of Sweden, Västerås, Sweden(Swepub:ri)mahshid.helali.moghadam@ri.se (författare)
  • Saadatmand, Mehrdad,1980-RISE,Industriella system,RISE Research Institutes of Sweden, Västerås, Sweden(Swepub:ri)MehrdadSaa@ri.se (författare)
  • Department of Computer Engineering, Isfahan University of Technology, Isfahan, IranDepartment of Computer Engineering, Hakim Sabzevari Univesity, Sabzevar, Iran (creator_code:org_t)

Sammanhörande titlar

  • Ingår i:Lect. Notes Comput. Sci.Cham : Springer Science and Business Media Deutschland GmbH, s. 690-7019783030922375

Internetlänk

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy