Academic Journal
Προβολή σε EDS

OPT-RNN-DBSVM: OPTimal Recurrent Neural Network and Density-Based Support Vector Machine

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: OPT-RNN-DBSVM: OPTimal Recurrent Neural Network and Density-Based Support Vector Machine
Συγγραφείς: Karim El Moutaouakil, Abdellatif El Ouissari, Adrian Olaru, Vasile Palade, Mihaela Ciorei
Πηγή: Mathematics, Vol 11, Iss 3555, p 3555 (2023)
Στοιχεία εκδότη: MDPI AG
Έτος έκδοσης: 2023
Συλλογή: Directory of Open Access Journals: DOAJ Articles
Θεματικοί όροι: Recurrent Neural Network (RNN), Density-Based Algorithm, Support Vector Machine (SVM), Kernel-Adatron algorithm (KA), Euler–Cauchy algorithm, Mathematics, QA1-939
Περιγραφή: When implementing SVMs, two major problems are encountered: (a) the number of local minima of dual-SVM increases exponentially with the number of samples and (b) the computer storage memory required for a regular quadratic programming solver increases exponentially as the problem size expands. The Kernel-Adatron family of algorithms, gaining attention recently, has allowed us to handle very large classification and regression problems. However, these methods treat different types of samples (i.e., noise, border, and core) in the same manner, which makes these algorithms search in unpromising areas and increases the number of iterations as well. This paper introduces a hybrid method to overcome such shortcomings, called the Optimal Recurrent Neural Network and Density-Based Support Vector Machine (Opt-RNN-DBSVM). This method consists of four steps: (a) the characterization of different samples, (b) the elimination of samples with a low probability of being a support vector, (c) the construction of an appropriate recurrent neural network to solve the dual-DBSVM based on an original energy function, and (d) finding the solution to the system of differential equations that govern the dynamics of the RNN, using the Euler–Cauchy method involving an optimal time step. Density-based preprocessing reduces the number of local minima in the dual-SVM. The RNN’s recurring architecture avoids the need to explore recently visited areas. With the optimal time step, the search moves from the current vectors to the best neighboring support vectors. It is demonstrated that RNN-SVM converges to feasible support vectors and Opt-RNN-DBSVM has very low time complexity compared to the RNN-SVM with a constant time step and the Kernel-Adatron algorithm–SVM. Several classification performance measures are used to compare Opt-RNN-DBSVM with different classification methods and the results obtained show the good performance of the proposed method.
Τύπος εγγράφου: article in journal/newspaper
Γλώσσα: English
Relation: https://www.mdpi.com/2227-7390/11/16/3555; https://doaj.org/toc/2227-7390; https://doaj.org/article/5a8b442bb2364faf92667f8b99b3c323
DOI: 10.3390/math11163555
Διαθεσιμότητα: https://doi.org/10.3390/math11163555
https://doaj.org/article/5a8b442bb2364faf92667f8b99b3c323
Αριθμός Καταχώρησης: edsbas.85D1295B
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://doi.org/10.3390/math11163555#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.85D1295B
RelevancyScore: 926
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 926.330688476563
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: OPT-RNN-DBSVM: OPTimal Recurrent Neural Network and Density-Based Support Vector Machine
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Karim+El+Moutaouakil%22">Karim El Moutaouakil</searchLink><br /><searchLink fieldCode="AR" term="%22Abdellatif+El+Ouissari%22">Abdellatif El Ouissari</searchLink><br /><searchLink fieldCode="AR" term="%22Adrian+Olaru%22">Adrian Olaru</searchLink><br /><searchLink fieldCode="AR" term="%22Vasile+Palade%22">Vasile Palade</searchLink><br /><searchLink fieldCode="AR" term="%22Mihaela+Ciorei%22">Mihaela Ciorei</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Mathematics, Vol 11, Iss 3555, p 3555 (2023)
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: MDPI AG
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2023
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Directory of Open Access Journals: DOAJ Articles
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Recurrent+Neural+Network+%28RNN%29%22">Recurrent Neural Network (RNN)</searchLink><br /><searchLink fieldCode="DE" term="%22Density-Based+Algorithm%22">Density-Based Algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22Support+Vector+Machine+%28SVM%29%22">Support Vector Machine (SVM)</searchLink><br /><searchLink fieldCode="DE" term="%22Kernel-Adatron+algorithm+%28KA%29%22">Kernel-Adatron algorithm (KA)</searchLink><br /><searchLink fieldCode="DE" term="%22Euler–Cauchy+algorithm%22">Euler–Cauchy algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22QA1-939%22">QA1-939</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: When implementing SVMs, two major problems are encountered: (a) the number of local minima of dual-SVM increases exponentially with the number of samples and (b) the computer storage memory required for a regular quadratic programming solver increases exponentially as the problem size expands. The Kernel-Adatron family of algorithms, gaining attention recently, has allowed us to handle very large classification and regression problems. However, these methods treat different types of samples (i.e., noise, border, and core) in the same manner, which makes these algorithms search in unpromising areas and increases the number of iterations as well. This paper introduces a hybrid method to overcome such shortcomings, called the Optimal Recurrent Neural Network and Density-Based Support Vector Machine (Opt-RNN-DBSVM). This method consists of four steps: (a) the characterization of different samples, (b) the elimination of samples with a low probability of being a support vector, (c) the construction of an appropriate recurrent neural network to solve the dual-DBSVM based on an original energy function, and (d) finding the solution to the system of differential equations that govern the dynamics of the RNN, using the Euler–Cauchy method involving an optimal time step. Density-based preprocessing reduces the number of local minima in the dual-SVM. The RNN’s recurring architecture avoids the need to explore recently visited areas. With the optimal time step, the search moves from the current vectors to the best neighboring support vectors. It is demonstrated that RNN-SVM converges to feasible support vectors and Opt-RNN-DBSVM has very low time complexity compared to the RNN-SVM with a constant time step and the Kernel-Adatron algorithm–SVM. Several classification performance measures are used to compare Opt-RNN-DBSVM with different classification methods and the results obtained show the good performance of the proposed method.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://www.mdpi.com/2227-7390/11/16/3555; https://doaj.org/toc/2227-7390; https://doaj.org/article/5a8b442bb2364faf92667f8b99b3c323
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.3390/math11163555
– Name: URL
  Label: Availability
  Group: URL
  Data: https://doi.org/10.3390/math11163555<br />https://doaj.org/article/5a8b442bb2364faf92667f8b99b3c323
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.85D1295B
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.85D1295B
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.3390/math11163555
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Recurrent Neural Network (RNN)
        Type: general
      – SubjectFull: Density-Based Algorithm
        Type: general
      – SubjectFull: Support Vector Machine (SVM)
        Type: general
      – SubjectFull: Kernel-Adatron algorithm (KA)
        Type: general
      – SubjectFull: Euler–Cauchy algorithm
        Type: general
      – SubjectFull: Mathematics
        Type: general
      – SubjectFull: QA1-939
        Type: general
    Titles:
      – TitleFull: OPT-RNN-DBSVM: OPTimal Recurrent Neural Network and Density-Based Support Vector Machine
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Karim El Moutaouakil
      – PersonEntity:
          Name:
            NameFull: Abdellatif El Ouissari
      – PersonEntity:
          Name:
            NameFull: Adrian Olaru
      – PersonEntity:
          Name:
            NameFull: Vasile Palade
      – PersonEntity:
          Name:
            NameFull: Mihaela Ciorei
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2023
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: Mathematics, Vol 11, Iss 3555, p 3555 (2023
              Type: main
ResultId 1