Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Scalable decision tree based on fuzzy partitioning and an incremental approach

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 4 (2022)

DOI
10.11591/ijece.v12i4.pp4228-4234
ISSN
2722-2578, 2088-8708
Terbit
2022-08-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Classification as a data mining materiel is the process of assigning entities to an already defined class by examining the features. The most significant feature of a decision tree as a classification method is its ability to data recursive partitioning. To choose the best attributes for partition, the value range of each continuous attribute should be divided into two or more intervals. Fuzzy partitioning can be used to reduce noise sensitivity and increase the stability of trees. Also, decision trees constructed with existing approaches, tend to be complex, and consequently are difficult to use in practical applications. In this article, a fuzzy decision tree has been introduced that tackles the problem of tree complexity and memory limitation by incrementally inserting data sets into the tree. Membership functions are generated automatically. Then Fuzzy Information Gain is used as a fast-splitting attribute selection criterion and the expansion of a leaf is done attending only with the instances stored in it. The efficiency of this algorithm is examined in terms of accuracy and tree complexity. The results show that the proposed algorithm by reducing the complexity of the tree can overcome the memory limitation and make a balance between accuracy and complexity.

Jaringan kolaborasi para penulis

4 penulis · 6 tautan kepenulisan bersama · 3 lintas organisasi

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

  • Islamic Azad University, Tehran
  • Yazd University
  • 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

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.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari 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>Scalable decision tree based on fuzzy partitioning and an incremental approach</dc:title><dc:creator>Lotfi, Somayeh</dc:creator><dc:creator>Ghasemzadeh, Mohammad</dc:creator><dc:creator>Mohsenzadeh, Mehran</dc:creator><dc:creator>Mirzarezaee, Mitra</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span&amp;gt;Classification as a data mining materiel is the process of assigning entities to an already defined class by examining the features. The most significant feature of a decision tree as a classification method is its ability to data recursive partitioning. To choose the best attributes for partition, the value range of each continuous attribute should be divided into two or more intervals. Fuzzy partitioning can be used to reduce noise sensitivity and increase the stability of trees. Also, decision trees constructed with existing approaches, tend to be complex, and consequently are difficult to use in practical applications. In this article, a fuzzy decision tree has been introduced that tackles the problem of tree complexity and memory limitation by incrementally inserting data sets into the tree. Membership functions are generated automatically. Then Fuzzy Information Gain is used as a fast-splitting attribute selection criterion and the expansion of a leaf is done attending only with the instances stored in it. The efficiency of this algorithm is examined in terms of accuracy and tree complexity. The results show that the proposed algorithm by reducing the complexity of the tree can overcome the memory limitation and make a balance between accuracy and complexity.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-08-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.v12i4.pp4228-4234</dc:identifier><dc:identifier>10.11591/ijece.v12i4.pp4228-4234</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 4 (2022); 4228</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/26435/15826</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>