Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7148
Browse
6 results
Search Results
Article FW-S3PFCM: Feature-Weighted Safe-Semi Possibilistic Fuzzy C-Means Clustering(Springer, 2026) Khezri, Shirin; Aghazadeh, Nasser; Hashemzadeh, Mahdi; Golzari Oskouei, AminThe safe semi-supervised fuzzy c-means clustering (S3FCM) method is a well-known clustering method that can produce successful results by incorporating prior knowledge of the class distribution. Its process is fast and simple but still has two limitations. The first issue is that it gives equal weight to all data features, while in real-world applications, different features usually have different importance. Secondly, S3FCM is very sensitive to noise and outliers. This paper proposes an extension of the S3FCM, entitled FW-S3PFCM, to mitigate these shortcomings. The proposed method uses a local feature weighting scheme to consider the different feature weights in the clustering process. Additionally, a possibilistic version of the S3FCM is designed to reduce the sensitivity to noise and outliers. The effectiveness of the proposed method is comprehensively evaluated on various benchmark datasets, and its performance is compared with the state-of-the-arts methods. To practically asses the FW-S3FCM, a real-world dataset of brain MRI images and its segmentation performance are analyzed as well. The average Accuracy, F1-score, Sensitivity, and Precision measures obtained by FW-S3FCM are 0.9682, 0.9826, 0.9743, and 0.9925, respectively, which are better than the competitors' performance.Article A Chebyshev Wavelet Approach to the Generalized Time-Fractional Burgers-Fisher Equation(Univ Tabriz, 2025) Aghazadeh, NasserThis work proposes a new method for obtaining the approximate solution of the time-fractional generalized BurgersFisher equation. The method's main idea is based on converting the nonlinear partial differential equation to a linear partial differential equation using the Picard iteration method. Then, the second kind Chebyshev wavelet collocation method is used to solve the linear equation obtained in the previous step. The technique is called the Chebyshev Wavelet Picard Method (CWPM). The proposed method successfully solves the time fractional generalized Burgers-Fisher equation. The obtained numerical results are compared with the exact solutions and with the solutions obtained using the Haar wavelet Picard method and the homotopy perturbation method.Article A Robust Possibilistic Semi-Supervised Fuzzy Clustering Algorithm With Neighborhood-Aware Feature Weighting(Springer Heidelberg, 2025) Moghaddam, Arezou Najafi; Aghazadeh, Nasser; Hashemzadeh, Mahdi; Oskouei, Amin GolzariThe Semi-Supervised Fuzzy C-Means (SSFCM) method integrates class distribution information with fuzzy logic to overcome the challenges of semi-supervised clustering methods. While the inclusion of label information in the objective function improves the quality of the clustering method, semi-supervised fuzzy techniques still encounter important limitations, including (1) sensitivity to noise and outliers, (2) uniform feature importance, (3) neglecting the influences of neighborhood in the clustering process. In this paper, an improved semi-supervised clustering algorithm is presented to address these challenges. First, the algorithm reduces the sensitivity to noise and outliers by integrating the possibilistic fuzzy C-means algorithm into the SSFCM method. Second, a dynamic feature weighting method assigns different weights to the features in each cluster, which improves the performance of the algorithm in imbalanced datasets. Third, the proposed algorithm introduces a neighborhood mechanism that incorporates the neighbor's trade-off weighting and feature weighting strategy considering a strong metric. Finally, a robust kernel metric is used to further improve the performance on complex and nonlinear datasets. Extensive experiments are conducted on several benchmark datasets to evaluate the performance of the proposed method. The results show that the proposed method outperforms the current state-of-the-art techniques. The implementation source codes of the proposed method are publicly available at https://github.com/Amin-Golzari-Oskouei/RPSSFC-NAFW.Article FW-S3KIFCM: Feature Weighted Safe-Semi Kernel-Based Intuitionistic Fuzzy C-Means Clustering Method(Tsinghua Univ Press, 2025) Khezri, Shirin; Aghazadeh, Nasser; Hashemzadeh, Mahdi; Oskouei, Amin GolzariSemi-supervised clustering (SSC) methods have emerged as a notable research area in machine learning. These methods integrate prior knowledge of class distribution into their clustering process. Despite their efficiency and straightforwardness, SSCs encounter some fundamental issues. Generally, the proportion of unlabeled data surpasses that of labeled data. Consequently, handling the uncertainty of unlabeled data becomes difficult. This issue is frequently related to numerous real-world problems. On the other hand, existing SSC techniques fail to differentiate between the varied attributes within the feature space. When forming clusters, they presume uniform significance for all attributes, disregarding potential variations in feature importance. This presumption hinders the creation of optimal clusters. Furthermore, all existing approaches employ the Euclidean distance metric, susceptible to noise and outliers. This paper proposes a robust safe-semi-supervised clustering algorithm to mitigate these shortcomings. For the first time, this approach combines two concepts of Intuitionistic Fuzzy C-Means (IFCM) clustering and Safe-Semi-Supervised Fuzzy C-Means (S3FCM) clustering to address the uncertainty problem in unlabeled data. Also, it uses a kernel function as a distance metric to tackle noise and outliers. Additionally, incorporating a feature weighting parameter in the objective function highlights the importance of significant features in creating optimal clusters. The effectiveness of the proposed method is thoroughly evaluated on various benchmark datasets, and its performance is compared with state-of-the-art methods. The results show the superiority of the proposed method over its competitors.Article Citation - WoS: 1Citation - Scopus: 1An Iris Segmentation Scheme Based on Bendlets(Springer London Ltd, 2023) Aghazadeh, Nasser; Abbasi, Mandana; Noras, ParisaDue to the effect of agents such as ambiance, transition channel, and other agents, images are polluted by noise during collection, transition, and compaction, leading to decrease image quality. Noise can decrease the accuracy of the next stages of image processing systems. Therefore, one of the vital stages in the novel processing systems is denoising. This article offers a novel image denoising approach using bendlets. Other multi-scale transformations (such as wavelets, curvelets, and shearlets) cannot recognize properties such as location, direction, and curvature of discontinuities well in piecewise stable images. To solve this problem, bendlets are suggested in this article. Bendlets differ from other multi-scale transformations in that an additional bending parameter is utilized for recognizing the curvature of discontinuities. Bendlets need a fewer number of coefficients to identify curvatures than other multi-scale transformations. Furthermore, they help to make the edges more obvious. The suggested approach is utilized on the UBIRIS.V2 database. It earns better accuracy and stability than other multi-scale transformations.Article Citation - WoS: 9Citation - Scopus: 8Taylor Wavelets Collocation Technique for Solving Fractional Nonlinear Singular Pdes(Springer, 2022) Aghazadeh, Nasser; Mohammadi, Amir; Tanoğlu, GamzeA novel technique has been introduced to solve the Emden-Fowler equations. It has been derived from the Taylor wavelets collocation method. The proposed scheme has been successfully implemented in order to solve the singular equations. The singular problem converts to a system of algebraic equations that can be solved numerically. Moreover, the technique is very effective to remove the strong singularity point at x = 0. The numerical experiments have been checked out with the exact and approximate solutions that have been achieved by others including the Adomian decomposition method (Wazwaz in Appl Math Comput 166:638-651, 2005), Modified Homotopy Perturbation Method (Singh et al. J Math Chem 54(4):918-931, 2016). Also, the error analysis of the technique has been considered.