Hossein Yazdanjouei

Mr. Hossein Yazdanjouei

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
21 November 2021 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
ZDZeinab Ghasemi Darehnaei
Zeinab Ghasemi Darehnaei
Mohammad ShokouhifarMohammad Shokouhifar
Mohammad Shokouhifar
Hossein YazdanjoueiHossein Yazdanjouei
Hossein Yazdanjouei
SFSeyed Mohammad Jalal Rastegar Fatemi
Seyed Mohammad Jalal Rastegar Fatemi

3 January 2025 in Knowledge and Information Systems
Verified
Journal Article
Open access
PDF file
NYNavid Yazdanjue
Navid Yazdanjue
Hossein YazdanjoueiHossein Yazdanjouei
Hossein Yazdanjouei
HGHassan Gharoun
Hassan Gharoun
MKMohammad Sadegh Khorshidi
Mohammad Sadegh Khorshidi
MRMorteza Rakhshaninejad
Morteza Rakhshaninejad
Amir H GandomiAmir H Gandomi
Amir H Gandomi
In recent decades, social network anonymization has become a crucial research field due to its pivotal role in preserving users' privacy. However, the high diversity of approaches introduced in relevant studies poses a challenge to gaining a profound understanding of the field. In response to this, the current study presents an exhaustive and well-structured bibliometric analysis of the social network anonymization field. To begin our research, related studies from the period of 2007–2022 were collected from the Scopus Database and then preprocessed. Following this, the VOSviewer was used to visualize the network of authors’ keywords. Subsequently, extensive statistical and network analyses were performed to identify the most prominent keywords and trending topics. Additionally, the application of co-word analysis through SciMAT and the Alluvial diagram allowed us to explore the themes of social network anonymization and scrutinize their evolution over time. These analyses culminated in an innovative taxonomy of the existing approaches and anticipation of potential trends in this domain. To the best of our knowledge, this is the first bibliometric analysis in the social network anonymization field, which offers a deeper understanding of the current state and an insightful roadmap for future research in this domain.

31 May 2025 in Annals of Operations Research
Verified
Journal Article
Open access
PDF file
NYNavid Yazdanjue
Navid Yazdanjue
MRMorteza Rakhshaninejad
Morteza Rakhshaninejad
Hossein YazdanjoueiHossein Yazdanjouei
Hossein Yazdanjouei
MNMikko S Niemelä
Mikko S Niemelä
Fang ChenFang Chen
Fang Chen
Amir H GandomiAmir H Gandomi
Amir H Gandomi
In response to escalating digital crime on the web, our study proposes a two-phase, semi-supervised method to detect and classify illicit marketplaces, addressing the challenge of limited labeled text documents on the deep/dark web, Telegram, Reddit, and Pastebin. Initially, we developed a self-training semi-supervised ensemble model using XGBoost, Random Forest, and AdaBoost to classify sales-related documents accurately. Next, we employ three XGBoost semi-supervised models to further classify “Sale” documents into “Drug”, “Weapon”, and stolen “Credential” categories. To enhance the performance of the classification model, we propose the Enhanced Interior Search Algorithm (EISA), which is an advanced version of the Interior Search Algorithm (ISA) meta-heuristic, for feature selection and hyperparameter tuning. EISA uses different mirror types and Lévy flights to efficiently navigate search spaces and converge on high-quality solutions. Additionally, we propose an application-specific objective function allowing for adjustments based on task requirements. Experimental results indicate that our EISA-aided semi-supervised approach effectively detects and classifies illicit marketplaces, addressing the lack of labeled data, while achieving competitive performance against other models with F1-scores of 0.9451 for “Sale” detection, 0.9173 for “Drug” sales, 0.9250 for “Weapon” sales, and 0.8862 for “Credential” sales, along with Transformed Matthews Correlation Coefficient (TMCC) values of 0.9108, 0.9202, 0.9472, and 0.8560. Besides, changes in the objective function’s weights demonstrate the model’s adaptability and applicability in real-world environments. The successful deployment of the EISA-aided semi-supervised model highlights its effectiveness in combating digital crime and confirms its practical value.

14 April 2024 in Information Sciences
Verified
Journal Article
Open access
NYNavid Yazdanjue
Navid Yazdanjue
Hossein YazdanjoueiHossein Yazdanjouei
Hossein Yazdanjouei
RKRamin Karimianghadim
Ramin Karimianghadim
Amir H GandomiAmir H Gandomi
Amir H Gandomi
Recently, social network usage has exhibited explosive growth, leading to a huge amount of users’ private data available. The main challenge in releasing social network data publicly is the protection of the users’ privacy while preserving its utility for third parties. Accordingly, several social network privacy-preserving methods have been introduced, where anonymization is the most common approach. Structural k-anonymity is a widely used anonymization model to mask the structure of social networks by clustering the edges and nodes into super-edges and super-nodes. However, it comes at the cost of losing structural information, which is measured by a criterion called structural information loss (SIL). This study introduces an enhanced discrete particle swarm optimization (EDPSO) algorithm, which effectively minimizes the SIL within the clustering process of the structural k-anonymity model, leading to a high-utility anonymized network. In this regard, we propose a vector-based solution representation that can be efficiently exploited by the EDPSO. Moreover, a novel position updating heuristic is suggested for the EDPSO, which adaptively tunes the operators’ selection probabilities. This happens based on each operator’s performance both in the current iteration and their history regarding the number and the average amount of fitness improvements in the previous iterations. We also propose two fortified versions of the EDPSO algorithm (EDPSOVNS and EDPSOSA) by employing two new network-specific local search strategies to enhance the exploration, exploitation, and convergence rate of the process. Simulation results on the nine real-world networks demonstrate the superiority of the suggested algorithms in terms of the fitness value, reliability, and convergence rate over other analyzed approaches found in the literature.

19 March 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
NBNavid Behmanesh-Fard
Navid Behmanesh-Fard
Hossein YazdanjoueiHossein Yazdanjouei
Hossein Yazdanjouei
Mohammad ShokouhifarMohammad Shokouhifar
Mohammad Shokouhifar
Frank WernerFrank Werner
Frank Werner
Symbolic pole/zero analysis is a crucial step in designing an analog operational amplifier. Generally, a simplified symbolic analysis of analog circuits suffers from NP-hardness, i.e., an exponential growth of the number of symbolic terms of the transfer function with the circuit size. This study presents a mathematical model combined with a heuristic–metaheuristic solution method for symbolic pole/zero simplification in operational transconductance amplifiers. First, the circuit is symbolically solved and an improved root splitting method is applied to extract symbolic poles/zeroes from the exact expanded transfer function. Then, a hybrid algorithm based on heuristic information and a metaheuristic technique using simulated annealing is used for the simplification of the derived symbolic roots. The developed method is tested on three operational transconductance amplifiers. The obtained results show the effectiveness of the proposed method in achieving accurate simplified symbolic pole/zero expressions with the least complexity.

9 February 2023 in Preprints.org
Verified
Preprint
Open access
PDF file
NBNavid Behmanesh-Fard
Navid Behmanesh-Fard
Hossein YazdanjoueiHossein Yazdanjouei
Hossein Yazdanjouei
Mohammad ShokouhifarMohammad Shokouhifar
Mohammad Shokouhifar
Frank WernerFrank Werner
Frank Werner
Symbolic pole/zero analysis is an important step when designing an analog operational amplifier. Generally, a simplified symbolic analysis of analog circuits suffers from NP-hardness, i.e., an exponential growth of the number of symbolic terms of the transfer function with the circuit size. In this study, we present a mathematical model combined with a heuristic-metaheuristic solution method for the symbolic pole/zero simplification in operational transconductance amplifiers (OTA). At first, the circuit is symbolically solved and an improved root splitting method is applied to extract symbolic poles/zeroes from the exact expanded transfer function. Then, a hybrid algorithm based on heuristic information and a metaheuristic technique using simulated annealing is performed for the simplification of the derived symbolic pole/zero expressions. The developed method has been tested on three analog OTAs. The obtained results show the effectiveness of the proposed method to achieve accurate simplified symbolic pole/zero expressions with the least complexity.