Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Hybrid imperialistic competitive algorithm incorporated with hopfield neural network for robust 3 satisfiability logic programming

IAES International Journal of Artificial Intelligence · Vol. 8 No. 2 (2019) · hlm. 144–155

DOI
10.11591/ijai.v8.i2.pp144-155
ISSN
2252-8938, 2089-4872
Terbit
2019-06-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Imperialist Competitive algorithm (ICA) is a robust training algorithm inspired by the socio-politically motivated strategy. This paper focuses on utilizing a hybridized ICA with Hopfield Neural Network on a 3- Satisfiability (3-SAT) logic programming. Eventually the performance of the proposed algorithm will be compared to other 2 algorithms, which are HNN3SATES (ES) and HNN-3SATGA (GA). The performance shall be evaluated with the Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Sum of Squares Error (SSE), Schwarz Bayesian Criterion (SBC), Global Minima Ratio and Computation Time (CPU time). The expected outcome will portray that the IC algorithm will outperform the other two algorithms in doing 3-SAT logic programming.

Kata kunci

Jaringan kolaborasi para penulis

15 penulis · 34 tautan kepenulisan bersama · 17 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universiti Sains Malaysia
  • Universiti Putra Malaysia
  • Universiti Teknologi MARA
  • Universiti Malaysia Perlis
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Nur Ezlin ZamriUniversiti Putra Malaysia4
Nurul Atiqah RomliUniversiti Teknologi MARA3
Nurul Najwa Ahmad AzamUniversiti Sains Malaysia2
Nurshazneem RoslanUniversiti Malaysia Perlis1
Nurul Ain Najwa Mohamad JamilAfiliasi tidak diketahui1
Nurul Atiqah RomliAfiliasi tidak diketahui1
Amierah Abdul MalikUniversiti Sains Malaysia1
Hakami Ali MohammedUniversiti Sains Malaysia1
Muhammad Fadhil MarsaniUniversiti Sains Malaysia1
Farid Zamani Che RoseUniversiti Putra Malaysia1
Basri BadyalinaUniversiti Teknologi MARA1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Hybrid imperialistic competitive algorithm incorporated with hopfield neural network for robust 3 satisfiability logic programming</dc:title>
	<dc:creator>Kathirvel, Vigneshwer</dc:creator>
	<dc:creator>Asyraf Mansor, Mohd.</dc:creator>
	<dc:creator>Mohd Kasihmuddin, Mohd Shareduwan</dc:creator>
	<dc:creator>Sathasivam, Saratha</dc:creator>
	<dc:subject xml:lang="en-US">Mathematical Sciences;Hopfield Neural Network</dc:subject>
	<dc:subject xml:lang="en-US">3 Satisfiability; Exhaustive search; Hopfield neural network; Imperialistic competitive algorithm; Logic programming</dc:subject>
	<dc:description xml:lang="en-US">Imperialist Competitive algorithm (ICA) is a robust training algorithm inspired by the socio-politically motivated strategy. This paper focuses on utilizing a hybridized ICA with Hopfield Neural Network on a 3- Satisfiability (3-SAT) logic programming. Eventually the performance of the proposed algorithm will be compared to other 2 algorithms, which are HNN3SATES (ES) and HNN-3SATGA (GA). The performance shall be evaluated with the Root Mean Square Error (RMSE), Mean Absolute Error (MAE), Sum of Squares Error (SSE), Schwarz Bayesian Criterion (SBC), Global Minima Ratio and Computation Time (CPU time). The expected outcome will portray that the IC algorithm will outperform the other two algorithms in doing 3-SAT logic programming.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US">Universiti Sains Malaysia</dc:contributor>
	<dc:date>2019-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/18018</dc:identifier>
	<dc:identifier>10.11591/ijai.v8.i2.pp144-155</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 8, No 2: June 2019; 144-155</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v8.i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/18018/12837</dc:relation>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/downloadSuppFile/18018/2435</dc:relation>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/downloadSuppFile/18018/2436</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2019 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>