Batool Lakzaei, Mostafa Haghir Chehreghani and Alireza Bagheri, A Decision-Based Heterogenous Graph Attention Network for Multi-Class Fake News Detection, Knowledge-Based Systems, Elsevier, 330 part A, article 114499, 2025.
Yassin Mohamadi and Mostafa Haghir Chehreghani, Mitigating Over-Squashing in Graph Few-Shot Learning by Leveraging Local and Global Similarities, Applied Soft Computing, Elsevier, 184, Part B, article 113863, December 2025.
Fateme Hoseynnia, Mehdi Ghatee and Mostafa Haghir Chehreghani,Mitigating Over-Smoothing in Graph Neural Networks for Node Classification through Adaptive Early Embedding and Biased DropEdge Procedures, Knowledge-Based Systems, Elsevier, 320, article 113615, 2025.
Batool Lakzaei, Mostafa Haghir Chehreghani and Alireza Bagheri, LOSS-GAT: Label Propagation and One-Class Semi-Supervised Graph Attention Network for Fake News Detection, Applied Soft Computing, Elsevier, 174, article 112965, 2025.
Fatemeh Gholamzadeh Nasrabadi, Amirhossein Kashani, Pegah Zahedi and Mostafa Haghir Chehreghani, Content augmented graph neural networks, ACM Transactions on the Web (TWEB), 19(4), article 40, 2025.
Mohammadreza Shahrestani and Mostafa Haghir Chehreghani, Prosody Recognition in Persian Poetry, Speech Communication, Elsevier, 170, article 103222, 2025.
Mostafa Haghir Chehreghani and Morteza Haghir Chehreghani, Mining transactional tree databases under homeomorphism, The Journal of Supercomputing, Springer, 81(4), article 530, 2025.
Mostafa Haghir Chehreghani, A review on the impact of data representation on model explainability, ACM Computing Surveys, 56(10): 263, 2024.
Mohammadjavad Zohrabi, Saeed Saravani and Mostafa Haghir Chehreghani, Centrality-based and similarity-based neighborhood extension in graph neural networks, The Journal of Supercomputing, Springer, 80(16), pp. 24638-24663, 2024.
Morteza Haghir Chehreghani and Mostafa Haghir Chehreghani, Hierarchical correlation clustering and tree preserving embedding, The Thirty-Fourth IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2024.
Mostafa Haghir Chehreghani, The embeddings world and Artificial General Intelligence, Cognitive Systems Research, Elsevier, 84, 101201, 2024.
Batool Lakzaei, Mostafa Haghir Chehreghani and Alireza Bagheri, Disinformation detection using graph neural networks: a survey, Artificial Intelligence Review, Springer, 57(3): 52, 2024.
Zahra Moteshaker Arani, Mostafa Haghir Chehreghani and Morteza Haghir Chehreghani, Non-uniform sampling methods for large itemset mining. IEEE BigData, pp. 5714-5722, 2023.
Mehdi Salemi Mottaghi and Mostafa Haghir Chehreghani, A deep comprehensive model for stock price prediction, Journal of Ambient Intelligence and Humanized Computing, Springer, 14(8), pp. 11385-11395, 2023.
Mostafa Haghir Chehreghani and Zahra Yaghoubi, Improving empirical efficiency of CUR decomposition, The Journal of Supercomputing, Springer, 79(8), pp. 9350-9366, 2023.
Mostafa Haghir Chehreghani, On using affine sketches for multiple-response dynamic graph regression, The Journal of Supercomputing, Springer, 79(5), pp. 5139-5153, 2023.
Sara Asghari, Mostafa Haghir Chehreghani and Morteza Haghir Chehreghani, On using node indices and their correlations for fake account detection, IEEE BigData, pp. 5646-5651, 2022.
Mahdi Ghanbari, Mostafa Haghir Chehreghani and Morteza Haghir Chehreghani, Graph clustering using node embeddings: an empirical study, IEEE BigData, pp. 5478-5483, 2022.
Mostafa Haghir Chehreghani, On the theory of dynamic graph regression problem, Computational and Applied Mathematics, Springer, 41(8), 2022.
Mostafa Haghir Chehreghani, Half a decade of graph convolutional networks, Nature Machine Intelligence, 4(3), pp. 192–193, 2022.
Fatemeh Keshvari, Mostafa Haghir Chehreghani, Non-uniform PageRank using node features and node embeddings, The CSI Journal on Computing Science and Information Technology (JCSIT), 2022, in Persian.
Masoud Malek, Mostafa Haghir Chehreghani, Ehsan Nazerfard, Morteza Haghir Chehreghani, Shallow Node Representation Learning using Centrality Indices, IEEE BigData, pp. 5209-5214, 2021
Mostafa Haghir Chehreghani, Sublinear update time randomized algorithms for dynamic graph regression, Applied Mathematics and Computation, (AMC), Elsevier, 410, 126434, 2021.
Mostafa Haghir Chehreghani, Dynamical algorithms for data mining and machine learning over dynamic graphs, WIRES Data Mining and Knowledge Discovery (DMKD),11(2), 2021.
Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem, Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs, Fundam. Informaticae (FI),182(3), pp. 219-242, 2021.
Mostafa Haghir Chehreghani, Subsampled Randomized Hadamard Transform for Regression of Dynamic Graphs, 29th ACM International Conference on Information and Knowledge Management (CIKM), pp. 2045-2048, 2020.
Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani, Learning representations from dendrograms. Machine Learning (MLJ), Springer, 109(9-10), pp. 1779-1802, 2020.
Mostafa Haghir Chehreghani, Talel Abdessalem, Albert Bifet, Meriem Bouzbila, Sampling informative patterns from large single networks. Future Gener. Comput. Syst. (FGCS), Elsevier, 106, pp. 653-658, 2020.
Mostafa Haghir Chehreghani, Albert Bifet and Talel Abdessalem, Adaptive Algorithms for Estimating Betweenness and k-path Centralities, 28th ACM International Conference on Information and Knowledge Management (CIKM), long research paper, pp. 1231-1240, 2019.
Mostafa Haghir Chehreghani, Talel Abdessalem and Albert Bifet, Metropolis-Hastings algorithms for estimating betweenness centrality, 22nd International Conference on Extending Database Technology (EDBT), short research paper, pp. 686-689, 2019.
Mostafa Haghir Chehreghani, Albert Bifet and Talel Abdessalem, DyBED: an efficient algorithm for updating betweenness centrality in directed dynamic graphs, IEEE International Conference on Big Data (BigData), pp. 2114-2123, 2018.
Mostafa Haghir Chehreghani, Albert Bifet and Talel Abdessalem, An in-depth comparison of group betweenness centrality estimation algorithms, IEEE International Conference on Big Data (BigData), pp. 2104-2113, 2018.
Mostafa Haghir Chehreghani, Albert Bifet and Talel Abdessalem, Discriminative distance-based network indices with application to link prediction, The Computer Journal (Comp. J.), Oxford University press, 61(7), pp. 998-1014, 2018.
Mostafa Haghir Chehreghani and Morteza Haghir Chehreghani, Efficient context-aware k-nearest neighbor search, European Conference on Information Retrieval (ECIR), long paper, pp. 466-478, 2018.
Mostafa Haghir Chehreghani, Albert Bifet and Talel Abdessalem, Efficient exact and approximate algorithms for computing betweenness centrality in directed graphs, Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), research track, pp. 752-764, 2018.
Mostafa Haghir Chehreghani and Talel Abdessalem, Upper and lower bounds for the q-entropy of network models with applications to network model selection, Information Processing Letters journal (IPL), Elsevier, 119, pp. 1-8, 2017.
Mostafa Haghir Chehreghani, A framework for description and analysis of sampling-based approximate triangle counting algorithms, IEEE International Conference on Data Science and Advanced Analytics (DSAA), 2016.
Morteza Haghir Chehreghani and Mostafa Haghir Chehreghani, Modeling transitivity in complex networks, International Conference on Uncertainty in Artificial Intelligence (UAI), 2016, the authors contributed equally.
Mostafa Haghir Chehreghani and Morteza Haghir Chehreghani, Transactional tree mining, European Conference on Machine Learning and Principles and Practice of Knowledge Discovery (ECML-PKDD), 2016.
Mostafa Haghir Chehreghani and Maurice Bruynooghe, Mining rooted ordered trees under subtree homeomorphism, Data Mining and Knowledge Discovery journal (DMKD), Springer, 30(5), pp. 1249-1272, 2016, journal track of ECML-PKDD 2016.
Mostafa Haghir Chehreghani, An efficient algorithm for approximate betweenness centrality computation, The Computer Journal (Comp. J.) , Oxford University press, 57(9), 1371-1382, 2014.
Mostafa Haghir Chehreghani, Effective co-betweenness centrality computation, 7th ACM Conference on Web Search and Data Mining (WSDM), 2014.
Jan Ramon, Constantin Comendant, Mostafa Haghir Chehreghani, Yuyi Wang, Graph and network pattern mining, Mining of user generated content and its applications, Boca Raton, Florida: CRC Press, 2014 (book chapter).
Mostafa Haghir Chehreghani, An efficient algorithm for approximate betweenness centrality computation, 22nd ACM International Conference on Information and Knowledge Management (CIKM), 2013.
Moretza Haghir Chehreghani, Mostafa Haghir Chehreghani and Hassan Abolhassani, Probabilistic heuristics for hierarchical web data clustering, Computational Intelligence journal (CI), Wiley-BlackWell, 28(2), pp. 209-233, 2012.
Mostafa Haghir Chehreghani, Efficiently mining unordered trees, IEEE International Conference on Data Mining (ICDM), 2011, Vancouver, Canada, winner of IEEE student travel grant award.
Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani, Caro Lucas and Masoud Rahgozar, OInduced: an efficient algorithm for mining induced patterns from rooted ordered trees, IEEE Transactions Systems, Man, Cybernetics-A (TSMC-A), 41(5), pp. 1013-1025, 2011.
Jan Ramon and Mostafa Haghir Chehreghani, On the complexity of listing closed frequent subgraph patterns, 8th French Conference on Combinatorics (FCC), Paris, France, 2010.
Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani, Caro Lucas, Masoud Rahgozar and Euhanna Ghadimi, Efficient rule based structural algorithms for classification of tree structured data, Intelligent Data Analysis journal (IDA Journal), IOSPress, 13(1), 2009.
Moretza Haghir Chehreghani, Hassan Abolhassani and Mostafa Haghir Chehreghani, Density link-based methods for clustering web pages, Decision Support Systems journal (DSS), Elsevier, 47(4), pp. 374-382, 2009.
Moretza Haghir Chehreghani, Hassan Abolhassani and Mostafa Haghir Chehreghani, Improving density-based methods for hierarchical clustering of the web pages, Data and Knowledge Engineering journal (DKE), Elsevier, 67(1), pp. 30-50, 2008.
Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas and Morteza Haghir Chehreghani, A heuristic algorithm for clustering rooted ordered trees, Intelligent Data Analysis journal (IDA Journal), IOS Press, vol. 11(4), 2007, pp. 355-376.
Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas and Morteza Haghir Chehreghani, Mining maximal embedded unordered tree patterns, IEEE Symposium Series on Computational Intelligence and Data Mining (CIDM), 2007.
Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas and Morteza Haghir Chehreghani, Clustering rooted ordered trees, IEEE Symposium Series on Computational Intelligence and Data Mining (CIDM), 2007.
Morteza Haghir Chehreghani, Hassan Abolhassani and Mostafa Haghir Chehreghani, Attaining higher quality for density based data mining algorithms, International Conference on Web Reasoning and Rule Systems (RR), Springer Lecture Notes in Computer Sciences, vol. 4524, pp. 329-338, 2007.
Reza Basseda, Mostafa Haghir Chehreghani and Fattaneh Taghiyareh, Modeling an agent-based system using Rebeca, IPM International Symposium on Fundamentals of Software Engineering (FSEN), 2007.