Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sondos Bahadori

dblp:293/5027 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2024
0009-0004-5365-6182ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph clustering
attributed graph clustering
0.812024
SDAC-DA: Semi-Supervised Deep Attributed Clustering Using Dual Autoencoder · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Graph learning
network embedding
0.812024
SDAC-DA: Semi-Supervised Deep Attributed Clustering Using Dual Autoencoder · IEEE Trans. Knowl. Data Eng. 2024

Methods — techniques the papers use, named apart from their topics

semi-supervised learning · 0.8dual autoencoder · 0.8dimensionality reduction · 0.8
YearPublicationVenuePosition
2024 A multi-objective optimization approach for overlapping dynamic community detection
Sondos Bahadori, Mansooreh Mirzaie, Maryam Nooraei Abadeh
Soft Comput.1
2024 SDAC-DA: Semi-Supervised Deep Attributed Clustering Using Dual Autoencoder
abstract
Attributed graph clustering aims to group nodes into disjoint categories using deep learning to represent node embeddings and has shown promising performance across various applications. However, two main challenges hinder further performance improvement. Firstly, reliance on unsupervised methods impedes the learning of low-dimensional, clustering-specific features in the representation layer, thus impacting clustering performance. Secondly, the predominant use of separate approaches leads to suboptimal learned embeddings that are insufficient for subsequent clustering steps. To address these limitations, we propose a novel method called Semi-supervised Deep Attributed Clustering using Dual Autoencoder (SDAC-DA). This approach enables semi-supervised deep end-to-end clustering in attributed networks, promoting high structural cohesiveness and attribute homogeneity. SDAC-DA transforms the attribute network into a dual-view network, applies a semi-supervised autoencoder layering approach to each view, and integrates dimensionality reduction matrices by considering complementary views. The resulting representation layer contains high clustering-friendly embeddings, which are optimized through a unified end-to-end clustering process for effectively identifying clusters. Extensive experiments on both synthetic and real networks demonstrate the superiority of our proposed method over seven state-of-the-art approaches.
Kamal Berahmand, Sondos Bahadori, Maryam Nooraei Abadeh, Yuefeng Li 0001, Yue Xu 0001
IEEE Trans. Knowl. Data Eng.2
2021 An improved limited random walk approach for identification of overlapping communities in complex networks
Sondos Bahadori, Parham Moradi, Hadi Zare 0001
Appl. Intell.1
2021 PODCD: Probabilistic overlapping dynamic community detection
Sondos Bahadori, Hadi Zare 0001, Parham Moradi
Expert Syst. Appl.1