اخبار و اعلانات
آمار
| تعداد نشریات | 61 |
| تعداد شمارهها | 2,201 |
| تعداد مقالات | 17,938 |
| تعداد مشاهده مقاله | 55,014,747 |
| تعداد دریافت فایل اصل مقاله | 28,794,616 |
Feature Selection in High Dimensional Datasets based on Adjacency Matrix | ||
| Journal of Data Science and Modeling | ||
| دوره 2، شماره 1 - شماره پیاپی 3، اسفند 2023، صفحه 209-218 اصل مقاله (353.99 K) | ||
| نوع مقاله: original | ||
| شناسه دیجیتال (DOI): 10.22054/jdsm.2024.81171.1052 | ||
| نویسندگان | ||
| Negin Bagherpour* 1؛ Behrang Ebrahimi2 | ||
| 1Department of Engineering Sciences, Faculty of Engineering, University of Tehran, Tehran, Iran | ||
| 2Department Of Engineering Sciences, University Of Tehran | ||
| چکیده | ||
| Feature selection is crucial to improve the quality of classification and clustering. It aims to enhance machine learning performance and reduce computational costs by eliminating irrelevant or redundant features. However, existing methods often overlook intricate feature relationships and select redundant features. Additionally, dependencies are often hidden or inadequately identified. That’s mainly because of nonlinear relationships being used in traditional algorithms. To address these limitations, novel feature selection algorithms are needed to consider intricate feature relationships and capture high-order dependencies, improving the accuracy and efficiency of data analysis. In this paper, we introduce an innovative feature selection algorithm based on Adjacency Matrix, which is applicable to supervised data. The algorithm comprises three steps for identifying pertinent features. In the first step, the correlation between each feature and its corresponding class is measured to eliminate irrelevant features. Moving to the second step, the algorithm focuses on the selected features, calculates pairwise relationships and constructs an adjacency matrix. Finally, the third step employs clustering techniques to classify the adjacency matrix into k clusters, where k represents the number of desired features. From each cluster, the algorithm selects the most representative feature for subsequent analysis. This feature selection algorithm provides a systematic approach to identify relevant features in supervised data, thereby significantly enhance the efficiency and accuracy of data analysis. By taking into account both the linear and nonlinear dependencies between features and effectively detecting them across multiple feature sets, it successfully overcomes the limitations of previous methods. | ||
| کلیدواژهها | ||
| Adjacency matrix؛ Feature selection؛ Mutual information؛ High dimension | ||
|
آمار تعداد مشاهده مقاله: 330 تعداد دریافت فایل اصل مقاله: 245 |
||
Scholarly Journals Management System © 1991.05.01 by Allameh Tabatabaei University is
licensed under Attribution-NonCommercial 4.0 International.