Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

A non-negative matrix factorization based clustering to identify potential tuna fishing zones

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 11 No. 6 (2021)

DOI
10.11591/ijece.v11i6.pp5458-5466
ISSN
2722-2578, 2088-8708
Published
2021-12-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Many nonnegative matrix factorization based clusterings are employed in discovering pattern and knowledge. Considering the sparseness nature of our data set about the daily tuna fishing data, we attempted to utilize a clustering approach, which is based on non-negative matrix factorization. Adding sparseness constraint and assigning good initial value in the modified NMF method, a proposed algorithm Direct-NMFSC yielded better result cluster compared to other methods which are also utilizing sparse constraint to their approaches, SNMF and NMFSC. The result of this study shows that Direct-NMFSC has 5.376 times of iteration number less than NMFSC in average with 531.97 as the CH index result. The determination of potential fishing zones is one of the essential efforts in the potential fishing zone mapping system for tuna fishing. By means of this novel data-driven study to construct the information and to identify the potential tuna fishing zones is done. We also showed that utilizing the Direct-NMFSC can spot and identify the potential tuna fishing zones presented in red cluster that covers both the spatial and temporal information.

Collaboration network of the authors

40 authors · 88 co-authorship links · 33 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Indonesia
  • Mercu Buana University
  • University of Reading
  • Universitas Gadjah Mada
  • Universitas Islam Negeri Maulana Malik Ibrahim
  • Michigan State University
  • Universitas Stikubank
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Ida NurhaidaMercu Buana University3
Remmy A. M. ZenMercu Buana University3
Ruli ManurungAffiliation unknown2
Hong WeiUniversity of Reading2
Agus HarjokoUniversitas Gadjah Mada2
Edi WinarkoUniversitas Gadjah Mada2
Edy WinarnoUniversitas Stikubank2
Vina AyumiMercu Buana University2
Adinda Rizkita SyafiraUniversity of Indonesia1
Widijanto Satyo NugrohoUniversity of Indonesia1
Rahmat M. Samik-IbrahimUniversity of Indonesia1
Edward CitrahadiAffiliation unknown1
Tieta AntarestiUniversity of Indonesia1
L. M. Rasdi RereUniversity of Indonesia1
Mohamad Ivan FananyUniversity of Indonesia1
Yohanes GultomUniversity of Indonesia1
Rian Josua MasikomeRWTH Aachen University1
Muhamad SolehUniversity of Indonesia1
Sesa WigunaUniversity of Auckland1
Yuni ArtiUniversity of Indonesia1
Hans Timothy WijayaUniversity of Indonesia1
Juan Thomas WijayaUniversity of Indonesia1
Yohanes Fridolin HestrioUniversity of Indonesia1
Bayu Satria PersadaUniversity of Indonesia1
Frederic Morado SaragihUniversity of Indonesia1
Muhammad Yusuf KardawiUniversity of Indonesia1
Wisnu Aryo JatmikoUniversity of Indonesia1
Ahmad SaikhuInstitut Teknologi Sepuluh Nopember1
Herwanto HerwantoAffiliation unknown1
Lilis NurellisaMercu Buana University1
Dwiza RianaUniversitas Nusa Mandiri1
Yudi RamdhaniAffiliation unknown1
Rizki Tri PrasetioAffiliation unknown1
Handrie NoprissonMercu Buana University1
Hong WeiUniversity of Reading1

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.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>A non-negative matrix factorization based clustering to identify potential tuna fishing zones</dc:title><dc:creator>Fitrianah, Devi</dc:creator><dc:creator>Fahmi, Hisyam</dc:creator><dc:creator>Hidayanto, Achmad Nizar</dc:creator><dc:creator>Ning-Tan, Pang</dc:creator><dc:creator>Arymurthy, Aniati Murni</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span lang="EN-US"&amp;gt;Many nonnegative matrix factorization based clusterings are employed in discovering pattern and knowledge. Considering the sparseness nature of our data set about the daily tuna fishing data, we attempted to utilize a clustering approach, which is based on non-negative matrix factorization. Adding sparseness constraint and assigning good initial value in the modified NMF method, a proposed algorithm Direct-NMFSC yielded better result cluster compared to other methods which are also utilizing sparse constraint to their approaches, SNMF and NMFSC. The result of this study shows that Direct-NMFSC has 5.376 times of iteration number less than NMFSC in average with 531.97 as the CH index result. The determination of potential fishing zones is one of the essential efforts in the potential fishing zone mapping system for tuna fishing. By means of this novel data-driven study to construct the information and to identify the potential tuna fishing zones is done. We also showed that utilizing the Direct-NMFSC can spot and identify the potential tuna fishing zones presented in red cluster that covers both the spatial and temporal information.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2021-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v11i6.pp5458-5466</dc:identifier><dc:identifier>10.11591/ijece.v11i6.pp5458-5466</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 11 No 6 (2021); 5458</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/24358/15262</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>