Dimensionality Reduction based on UncertainGraph Model
Publish Year: 1401
نوع سند: مقاله کنفرانسی
زبان: English
View: 66
متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دریافت نمایند.
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CEITCONF06_023
تاریخ نمایه سازی: 26 خرداد 1402
Abstract:
Classification in machine learning is done bymany factors which called attributes. The higher the numberof features, the more difficult it becomes to visualize thetraining set and then work on it. Sometimes, most of thesefeatures are related to each other and are therefore consideredredundant features. This is where Dimensionality Reduction(DR) algorithms come into play. In machine learning andstatistics, dimensionality reduction is the process of reducingthe number of supervised random variables by obtaining a setof main variables. Dimensionality reduction can be divided intofeature selection and feature extraction. This paper proposes anew Dimensionality reduction algorithm in the featureselection category using Pearson correlation of attributes andmaking uncertain graph models. The proposed model can bedone for any number of features with increasing theclassification performance compared with filter and wrapperstrategies
Keywords:
Authors
Arezoo Jahani
Faculty of Electrical Engineering,Sahand University of Technlogy,Tabriz, Iran.