Scalable Fuzzy Decision Tree Induction Using Fast Data Partitioning and Incremental Approach for Large Dataset
- سال انتشار: 1400
- محل انتشار: مجله پیشرفت در مهندسی کامپیوتر و فناوری، دوره: 7، شماره: 1
- کد COI اختصاصی: JR_JACET-7-1_004
- زبان مقاله: انگلیسی
- تعداد مشاهده: 181
نویسندگان
Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
Computer Engineering Department, Yazd University, Yazd, Iran.
Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Tehran ,IRAN
Department of Computer Engineering, Science and Research Branch, Islamic Azad University, Daneshgah Blvd., Simon Bulivar Blvd., P.O. Box: ۱۴۵۱۵/۷۷۵, Tehran, Iran
چکیده
The decision tree is one of the popular methods for learning and reasoning through recursive partitioning of data space. To choose the best attribute in the case on numerical features, partitioning criteria should be calculated for individual values or the value range of each attribute should be divided into two or more intervals using a set of cut points. In partitioning range of attribute, the fuzzy partitioning can be used to reduce the noise sensitivity of data and to increase the stability of decision trees. Since the tree-building algorithms need to keep in main memory the whole training dataset, they have memory restrictions. In this paper, we present an algorithm that builds the fuzzy decision tree on the large dataset. In order to avoid storing the entire training dataset in main memory and overcome the memory limitation, the algorithm builds DTs in an incremental way. In the discretization stage, a fuzzy partition was generated on each continuous attribute based on fuzzy entropy. Then, in order to select the best feature for branches, two criteria, including fuzzy information gain and occurrence matrix are used. Besides, real datasets are used to evaluate the behavior of the algorithm in terms of classification accuracy, decision tree complexity, and execution time as well. The results show that proposed algorithm without a need to store the entire dataset in memory and reduce the complexity of the tree is able to overcome the memory limitation and making balance between accuracy and complexity .کلیدواژه ها
Fuzzy Decision trees, Large dataset, Fuzzy Entropy, Fuzzy partitioningاطلاعات بیشتر در مورد COI
COI مخفف عبارت CIVILICA Object Identifier به معنی شناسه سیویلیکا برای اسناد است. COI کدی است که مطابق محل انتشار، به مقالات کنفرانسها و ژورنالهای داخل کشور به هنگام نمایه سازی بر روی پایگاه استنادی سیویلیکا اختصاص می یابد.
کد COI به مفهوم کد ملی اسناد نمایه شده در سیویلیکا است و کدی یکتا و ثابت است و به همین دلیل همواره قابلیت استناد و پیگیری دارد.