Mining Maximal Embedded Unordered Tree Patterns. - Mostafa Haghir Chehreghani; Masoud Rahgozar; Caro Lucas; Morteza Haghir Chehreghani (CIDM, 2007)

Clustering Rooted Ordered Trees. - Mostafa Haghir Chehreghani; Masoud Rahgozar; Caro Lucas; Morteza Haghir Chehreghani (CIDM, 2007)

Attaining Higher Quality for Density Based Algorithms. - Morteza Haghir Chehreghani; Hassan Abolhassani; Mostafa Haghir Chehreghani (RR, 2007)

A heuristic algorithm for clustering rooted ordered trees. - Mostafa Haghir Chehreghani; Masoud Rahgozar; Caro Lucas; Morteza Haghir Chehreghani (Intell. Data Anal., 2007)

Improving density-based methods for hierarchical clustering of web pages. - Morteza Haghir Chehreghani; Hassan Abolhassani; Mostafa Haghir Chehreghani (Data Knowl. Eng., 2008)

Density link-based methods for clustering web pages. - Morteza Haghir Chehreghani; Hassan Abolhassani; Mostafa Haghir Chehreghani (Decis. Support Syst., 2009)

Efficient rule based structural algorithms for classification of tree structured data. - Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani; Caro Lucas; Masoud Rahgozar; Euhanna Ghadimi (Intell. Data Anal., 2009)

Efficiently Mining Unordered Trees. - Mostafa Haghir Chehreghani (ICDM, 2011)

OInduced: An Efficient Algorithm for Mining Induced Patterns From Rooted Ordered Trees. - Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani; Caro Lucas; Masoud Rahgozar (IEEE Trans. Syst. Man Cybern. Part A, 2011)

Probabilistic Heuristics for Hierarchical Web Data Clustering. - Morteza Haghir Chehreghani; Mostafa Haghir Chehreghani; Hassan Abolhassani (Comput. Intell., 2012)

Efficient Algorithms for Approximate Triangle Counting - Mostafa Haghir Chehreghani (CoRR, 2013)

Graph and Network Pattern Mining. - Jan Ramon; Constantin Comendant; Mostafa Haghir Chehreghani; Yuyi Wang 001 (Mining User Generated Content, 2014)

Effective co-betweenness centrality computation. - Mostafa Haghir Chehreghani (WSDM, 2014)

An Efficient Algorithm for Approximate Betweenness Centrality Computation. - Mostafa Haghir Chehreghani (Comput. J., 2014)

Mining Rooted Ordered Trees under Homeomorphism. - Mostafa Haghir Chehreghani; Maurice Bruynooghe (CoRR, 2014)

A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms. - Mostafa Haghir Chehreghani (DSAA, 2016)

Transactional Tree Mining. - Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani (ECML/PKDD (1), 2016)

Modeling Transitivity in Complex Networks. - Morteza Haghir Chehreghani; Mostafa Haghir Chehreghani (UAI, 2016)

Mining rooted ordered trees under subtree homeomorphism. - Mostafa Haghir Chehreghani; Maurice Bruynooghe (Data Min. Knowl. Discov., 2016)

A Theory-based Study of Graph Mining ; Een theoretische studie van graph mining. - Mostafa Haghir Chehreghani (2016)

Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks. - Mostafa Haghir Chehreghani; Talel Abdessalem; Albert Bifet (CoRR, 2017)

Discriminative Distance-Based Network Indices and the Tiny-World Property. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (CoRR, 2017)

Upper and lower bounds for the q-entropy of network models with application to network model selection. - Mostafa Haghir Chehreghani; Talel Abdessalem (Inf. Process. Lett., 2017)

An In-depth Comparison of Group Betweenness Centrality Estimation Algorithms. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (IEEE BigData, 2018)

DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (IEEE BigData, 2018)

Efficient Context-Aware K-Nearest Neighbor Search. - Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani (ECIR, 2018)

Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (PAKDD (3), 2018)

Discriminative Distance-Based Network Indices with Application to Link Prediction. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (Comput. J., 2018)

Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (CoRR, 2018)

Nonparametric Feature Extraction from Dendrograms. - Morteza Haghir Chehreghani; Mostafa Haghir Chehreghani (CoRR, 2018)

Adaptive Algorithms for Estimating Betweenness and k-path Centralities. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (CIKM, 2019)

Metropolis-Hastings Algorithms for Estimating Betweenness Centrality. - Mostafa Haghir Chehreghani; Talel Abdessalem; Albert Bifet (EDBT, 2019)

Sketch-based Randomized Algorithms for Dynamic Graph Regression. - Mostafa Haghir Chehreghani (CoRR, 2019)

Subsampled Randomized Hadamard Transform for Regression of Dynamic Graphs. - Mostafa Haghir Chehreghani (CIKM, 2020)

Generalized Centrality Aggregation and Exclusive Centrality. - Mostafa Haghir Chehreghani (CoRR, 2020)

Sampling informative patterns from large single networks. - Mostafa Haghir Chehreghani; Talel Abdessalem; Albert Bifet; Meriem Bouzbila (Future Gener. Comput. Syst., 2020)

Learning representations from dendrograms. - Morteza Haghir Chehreghani; Mostafa Haghir Chehreghani (Mach. Learn., 2020)

Shallow Node Representation Learning using Centrality Indices. - Masoud Malek; Mostafa Haghir Chehreghani; Ehsan Nazerfard; Morteza Haghir Chehreghani (IEEE BigData, 2021)

Sublinear update time randomized algorithms for dynamic graph regression. - Mostafa Haghir Chehreghani (Appl. Math. Comput., 2021)

Effectively Counting s-t Simple Paths in Directed Graphs. - Mostafa Haghir Chehreghani (CoRR, 2021)

Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. - Mostafa Haghir Chehreghani; Albert Bifet; Talel Abdessalem (Fundam. Informaticae, 2021)

Dynamical algorithms for data mining and machine learning over dynamic graphs. - Mostafa Haghir Chehreghani (WIREs Data Mining Knowl. Discov., 2021)

On Using Node Indices and Their Correlations for Fake Account Detection. - Sara Asghari; Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani (IEEE Big Data, 2022)

Graph Clustering Using Node Embeddings: An Empirical Study. - Mahdi Ghanbari; Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani (IEEE Big Data, 2022)

Half a decade of graph convolutional networks. - Mostafa Haghir Chehreghani (Nat. Mach. Intell., 2022)

On the theory of dynamic graph regression problem. - Mostafa Haghir Chehreghani (Comput. Appl. Math., 2022)

Non-uniform Sampling Methods for Large Itemset Mining. - Zahra Moteshaker Arani; Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani (IEEE Big Data, 2023)

Multilevel User Credibility Assessment in Social Networks. - Mohammad Moradi; Mostafa Haghir Chehreghani (CoRR, 2023)

Content Augmented Graph Neural Networks. - Fatemeh Gholamzadeh Nasrabadi; AmirHossein Kashani; Pegah Zahedi; Mostafa Haghir Chehreghani (CoRR, 2023)

A deep comprehensive model for stock price prediction. - Mehdi Salemi Mottaghi; Mostafa Haghir Chehreghani (J. Ambient Intell. Humaniz. Comput., 2023)

On using affine sketches for multiple-response dynamic graph regression. - Mostafa Haghir Chehreghani (J. Supercomput., 2023)

Improving empirical efficiency of CUR decomposition. - Mostafa Haghir Chehreghani; Zahra Yaghoobi (J. Supercomput., 2023)

Hierarchical Correlation Clustering and Tree Preserving Embedding. - Morteza Haghir Chehreghani; Mostafa Haghir Chehreghani (CVPR, 2024)

The embeddings world and Artificial General Intelligence. - Mostafa Haghir Chehreghani (Cogn. Syst. Res., 2024)

Strong Transitivity Relations and Graph Neural Networks. - Yassin Mohamadi; Mostafa Haghir Chehreghani (CoRR, 2024)

Heterophily-Aware Fair Recommendation using Graph Convolutional Networks. - Nemat Gholinejad; Mostafa Haghir Chehreghani (CoRR, 2024)

Disinformation detection using graph neural networks: a survey. - Batool Lakzaei; Mostafa Haghir Chehreghani; Alireza Bagheri (Artif. Intell. Rev., 2024)

A Review on the Impact of Data Representation on Model Explainability. - Mostafa Haghir Chehreghani (ACM Comput. Surv., 2024)

Centrality-based and similarity-based neighborhood extension in graph neural networks. - Mohammadjavad Zohrabi; Saeed Saravani; Mostafa Haghir Chehreghani (J. Supercomput., 2024)

LOSS-GAT: Label propagation and one-class semi-supervised graph attention network for fake news detection. - Batool Lakzaei; Mostafa Haghir Chehreghani; Alireza Bagheri (Appl. Soft Comput., 2025)

Mitigating over-smoothing in Graph Neural Networks for node classification through Adaptive Early Embedding and Biased DropEdge procedures. - Fateme Hoseinnia; Mehdi Ghatee; Mostafa Haghir Chehreghani (Knowl. Based Syst., 2025)

Prosody recognition in Persian poetry. - Mohammadreza Shahrestani; Mostafa Haghir Chehreghani (Speech Commun., 2025)

A Decision-Based Heterogenous Graph Attention Network for Multi-Class Fake News Detection. - Batool Lakzaei; Mostafa Haghir Chehreghani; Alireza Bagheri (CoRR, 2025)

Neighborhood-Order Learning Graph Attention Network for Fake News Detection. - Batool Lakzaei; Mostafa Haghir Chehreghani; Alireza Bagheri (CoRR, 2025)

Disentangling Popularity and Quality: An Edge Classification Approach for Fair Recommendation. - Nemat Gholinejad; Mostafa Haghir Chehreghani (CoRR, 2025)

Anchor-based oversampling for imbalanced tabular data via contrastive and adversarial learning. - Hadi Mohammadi; Ehsan Nazerfard; Mostafa Haghir Chehreghani (CoRR, 2025)

Mining transactional tree databases under homeomorphism. - Mostafa Haghir Chehreghani; Morteza Haghir Chehreghani (J. Supercomput., 2025)

Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation. - Zahra Akhlaghi; Mostafa Haghir Chehreghani (CoRR, 2025)

Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation. - Narges Nemati; Mostafa Haghir Chehreghani (CoRR, 2025)

Graph Neural Networks in Multi-Omics Cancer Research: A Structured Survey. - Payam Zohari; Mostafa Haghir Chehreghani (CoRR, 2025)

PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systems. - Mohammad Naeimi; Mostafa Haghir Chehreghani (CoRR, 2025)