Hassan Nosrati Nahook

Mr. Hassan Nosrati Nahook


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2014 in Journal of Fuzzy Set Valued Analysis
Verified
Journal Article
Open access
PDF file
HNHassan Nosrati Nahook
Hassan Nosrati Nahook
MEMahdi Eftekhari
Mahdi Eftekhari
Feature selection (FS) is considered to be an important preprocessing step in machine learning and pattern recognition, and feature evaluation is the key issue for constructing a feature selection algorithm. Feature selection process can also reduce noise and this way enhance the classification accuracy. In this article, feature selection method based on fuzzy similarity measures by multi objective genetic algorithm (FSFSM - MOGA) is introduced and performance of the proposed method on published data sets from UCI was evaluated. The results show the efficiency of the method is compared with the conventional version. When this method multi-objective genetic algorithms and fuzzy similarity measures used in CFS method can improve it.

14 February 2026 in Zahedan Journal of Research in Medical Sciences
Verified
Journal Article
Open access
HNHassan Nosrati Nahook
Hassan Nosrati Nahook
LSLeila Safabakhsh
Leila Safabakhsh
Background: Gastric cancer remains one of the leading causes of cancer-related mortality worldwide, highlighting the urgent need for novel biomarkers and therapeutic targets. Objectives: This study integrates bioinformatics and machine learning to analyze RNA sequencing data from the Gene Expression Omnibus (GEO) dataset GSE164174, focusing on dysregulated microRNAs (miRNAs) and their roles in gastric carcinogenesis. Methods: Differential expression analysis identified 2,565 significantly altered miRNAs, including hsa-miR-4481 [upregulated, log2 fold change (logFC) = 2.23] and hsa-miR-5100 [downregulated, logFC = -3.91]. Pathway enrichment revealed miRNA-mediated mRNA destabilization (GO:0035279, P = 4.20E-63) as a critical mechanism. Machine learning models, including random forests, were used to assess diagnostic accuracy for top miRNAs. Results: Machine learning models demonstrated high diagnostic accuracy [area under the curve (AUC) > 0.90] for top miRNAs. These findings underscore the potential of miRNAs as non-invasive biomarkers and therapeutic targets. Conclusions: By bridging computational predictions with biological insights, this study provides a foundation for clinical translation and personalized oncology.

1 May 2021
Verified
Open access
HNHassan Nosrati Nahook
Hassan Nosrati Nahook
STS. Tabatabaei
S. Tabatabaei
Background and Objectives: The Ant-Miner algorithm works based on Ant Colony Optimization as a tool for data analysis , and is used to explore classified laws from a set of data. In the current study, two new methods have been proposed for the purpose of optimizing this algorithm. The first method adopted logical negation operation on the records of the produced laws, while the second employed a new Pheromone Update strategy called “Generalized exacerbation of quality conflict”. The two proposed methods were executed in Visual studio C#.Net , and 8 public datasets were applied in the test. Each one of these datasets was executed 10 times both in an independent way and combined with others, and the average results were recorded. Methods: In this study, we have proposed two approaches for the earlier method. Using the first method in the construction of rule records, idioms that include the rules can be made in the form of . Compared to the idioms of the early algorithm, these idioms are more compatible while constructing rules with high coverage. The advantage of this generalization is the reduction of the produced rules, which results in greater understandability of the output. During the process of pheromone update in the ordinary ACO algorithms, the amount of the sprayed pheromone is a function of the quality of rules. The objective of the second method is to strengthen the conflict between not-found, weak, good, and superior solutions. This method is a new strategy of pheromone update where ants with high-quality solutions are motivated through increasing the amount of pheromone sprayed on the trail that they have found; conversely, the ants that find weaker solutions are punished through eliminating pheromone from their trails. Results: The optimization of the initial algorithm using the two proposed methods produces a smaller number of rules, but increases the number of construction diagrams and prevents the production of low-quality rules. Conclusion: The results of tests performed on the dataset indicated the enhancement of algorithm efficiency in idioms of fewer tests, increased prediction accuracy of laws, and improved comprehensibility of the produced laws using the proposed methods.