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

Hoda Mashayekhi

dblp:67/4363 · DBLP profile ↗
← Back
17ranked-venue papers
5as first author
7since 2021 · last 2026
0000-0003-0080-2743ORCID · verified

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

Artificial intelligence and machine learning · 8 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 2 since 2021Systems, architecture and hardware · 2 · 2 first-author · 1 since 2021Computer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.212015
GDCluster: A General Decentralized Clustering Algorithm · IEEE Trans. Knowl. Data Eng. 2015
Data mining › clustering › large-scale clustering
distributed clustering
0.212015
GDCluster: A General Decentralized Clustering Algorithm · IEEE Trans. Knowl. Data Eng. 2015
Distributed systems
peer-to-peer systems
0.112015
GDCluster: A General Decentralized Clustering Algorithm · IEEE Trans. Knowl. Data Eng. 2015

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

partition-based clustering · 0.4gossip-based communication · 0.4density-based clustering · 0.4
YearPublicationVenuePosition
2026 neoTextGCN: A Neo-approach for node classification in text-attributed graphs
Reza Ghadiri, Mansoor Fateh, Hoda Mashayekhi
Knowl. Based Syst.3
2025 An Adaptive Active Learning Framework for Sparsely Labeled Multi-Label Drifting Data Streams
Reza Rahimian, Hoda Mashayekhi, Maryam Khodabakhsh
Knowl. Based Syst.2
2024 An incremental clustering algorithm based on semantic concepts
Mahboubeh Soleymanian, Hoda Mashayekhi, Marziea Rahimi
Knowl. Inf. Syst.2
2023 Microblog topic detection using evolutionary clustering and social network information
abstract
Summary The messages in microblogs, like Twitter, present a wealth of information around the hot topics and public opinions. Topic detection and tracking enables a better understanding of the incoming information from social networks. Many of the studies performed in this field consider a set of predefined number of topics (clusters) which remain constant during the detection process. Such approaches are not efficient when data is dynamic and cumulative. In addition, nonparametric evolutionary topic models do not have an accurate performance on short texts due to the data deficiency. In this article, we propose an evolutionary clustering model based on the Bayesian nonparametric Dirichlet process mixture model, which automatically determines the number of clusters. To improve the algorithm performance when dealing with short social media texts, temporal information of tweets and other social network parameters are used in a weighted combination to augment the text similarity in detecting topics. Model evaluation is performed on the data gathered from the Twitter during a 2.5‐month period. Results reveal that the social network information can promote the topic detection performance. The proposed model outperforms previous study in terms of topic coherence and clustering performance, leading to a better clustering on short texts.
Hoda Mashayekhi, Elham Sadat Alavi, Behzad Rezaie
Concurr. Comput. Pract. Exp.1
2023 A semi-supervised framework for concept-based hierarchical document clustering
Seyed Mojtaba Sadjadi, Hoda Mashayekhi, Hamid Hassanpour
World Wide Web (WWW)2
2022 A probabilistic topic model based on short distance Co-occurrences
Marziea Rahimi, Morteza Zahedi, Hoda Mashayekhi
Expert Syst. Appl.3
2021 Tracking and analysis of discourse dynamics and polarity during the early Corona pandemic in Iran
Fatemeh Jafarinejad, Marziea Rahimi, Hoda Mashayekhi
J. Biomed. Informatics3
2020 Measuring time-sensitive user influence in Twitter
Behzad Rezaie, Morteza Zahedi, Hoda Mashayekhi
Knowl. Inf. Syst.3
2019 User preferences modeling using dirichlet process mixture model for a content-based recommender system
Rahimpour Cami Bagher, Hamid Hassanpour, Hoda Mashayekhi
Knowl. Based Syst.3
2019 A comparative performance analysis of different activation functions in LSTM networks for classification
Amir Farzad, Hoda Mashayekhi, Hamid Hassanpour
Neural Comput. Appl.2
2019 Rule extraction for fatty liver detection using neural networks
Mojtaba Shahabi, Hamid Hassanpour, Hoda Mashayekhi
Neural Comput. Appl.3
2018 Collaborative fuzzy clustering of distributed concept-drifting dynamic data using a gossip-based approach
Hoda Mashayekhi
Appl. Intell.1
2017 User trends modeling for a content-based recommender system
Rahimpour Cami Bagher, Hamid Hassanpour, Hoda Mashayekhi
Expert Syst. Appl.3
2015 GDCluster: A General Decentralized Clustering Algorithm
abstract
In many popular applications like peer-to-peer systems, large amounts of data are distributed among multiple sources. Analysis of this data and identifying clusters is challenging due to processing, storage, and transmission costs. In this paper, we propose GDCluster, a general fully decentralized clustering method, which is capable of clustering dynamic and distributed data sets. Nodes continuously cooperate through decentralized gossip-based communication to maintain summarized views of the data set. We customize GDCluster for execution of the partition-based and density-based clustering methods on the summarized views, and also offer enhancements to the basic algorithm. Coping with dynamic data is made possible by gradually adapting the clustering model. Our experimental evaluations show that GDCluster can discover the clusters efficiently with scalable transmission cost, and also expose its supremacy in comparison to the popular method LSP2P.
Hoda Mashayekhi, Jafar Habibi, Tania Khalafbeigi, Spyros Voulgaris, Maarten van Steen
IEEE Trans. Knowl. Data Eng.1
2014 L-overlay: A layered data management scheme for peer-to-peer computing
Hoda Mashayekhi, Jafar Habibi
Peer-to-Peer Netw. Appl.1
2010 Towards a General Framework for Evaluating Software Development Methodologies
abstract
It has become essential to scrutinize and evaluate software development methodologies, mainly because of their increasing number and variety. Evaluation is required to gain a better understanding of the features, strengths, and weaknesses of the methodologies. The results of such evaluations can be leveraged to identify the methodology most appropriate for a specific context. Moreover, methodology improvement and evolution can be accelerated using these results. However, despite extensive research, there is still a need for a feature/criterion set that is general enough to allow methodologies to be evaluated regardless of their types. We propose a general evaluation framework which addresses this requirement. In order to improve the applicability of the proposed framework, all the features - general and specific - are arranged in a hierarchy along with their corresponding criteria. Providing different levels of abstraction enables users to choose the suitable criteria based on the context. Major evaluation frameworks for object-oriented, agent-oriented, and aspect-oriented methodologies have been studied and assessed against the proposed framework to demonstrate its reliability and validity.
Shokoofeh Hesari, Hoda Mashayekhi, Raman Ramsin
COMPSAC2
2010 Combining search and trust models in unstructured peer-to-peer networks
Hoda Mashayekhi, Jafar Habibi
J. Supercomput.1