Reducing rule generation complexity in the prism algorithm

العناوين الأخرى

تقليل وقت عملية توليد القواعد في خوارزمية برزم

مقدم أطروحة جامعية

Hammadi, Muhammad Yasin

مشرف أطروحة جامعية

al-Zubaydi, Rashid A.

أعضاء اللجنة

Duwayri, Rehab
al-Ghul, Said
Alawinah, Ali
al-Emam, Nimr

الجامعة

جامعة فيلادلفيا

الكلية

كلية تكنولوجيا المعلومات

القسم الأكاديمي

قسم علم الحاسوب

دولة الجامعة

الأردن

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

2014

الملخص الإنجليزي

-Data mining is a computer science field that works on finding the relations and patterns that are found within data (training data), by detecting these relations and patterns, rules can be created, that can be used later on to filter out and process future data (test data).

Prism is an easy covering algorithm depending on separate-and-conquer algorithms; this algorithm creates rules by discovering the power of relations between attribute items with the objective class.

The primary phase in Prism is the rule creation phase, where the relation power between every attribute item and the targeted class is computed in every assumption, then the set of training data is classified based on the output results.

One of the primary pillars in the rule generation step is that whenever Prism detects two equal strength values, Prism selects one value only and drops the other to the next iteration of computations and filtering.

However, observations and experiments over more than one data set proved that in each time the other equal value is always chosen in the next iteration, this is obviously unneeded system overhead.

In this thesis, we aim to remove this redundancy in rule generation phase by presenting the enhanced prism (E-Prism) algorithm.

Another insufficiency in this algorithm is that it deals with only categorical attributes, some discretization methods where previously used with Prism, but the problem with these techniques is their large calculation complexity compared to other discretization methods.

This thesis aims overcome this problem by using discretization methods with small complexity as a pre-processing phase allowing Prism to deal with continuous attributes.

التخصصات الرئيسية

الرياضيات

الموضوعات

• الخوارزميات
• التنقيب في البيانات

عدد الصفحات

50

قائمة المحتويات

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-546248