default search action
Mostafa Haghir Chehreghani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Batool Lakzaei, Mostafa Haghir Chehreghani, Alireza Bagheri:
Disinformation detection using graph neural networks: a survey. Artif. Intell. Rev. 57(3): 52 (2024) - [j23]Mostafa Haghir Chehreghani
:
The embeddings world and Artificial General Intelligence. Cogn. Syst. Res. 84: 101201 (2024) - [j22]Mostafa Haghir Chehreghani
A Review on the Impact of Data Representation on Model Explainability. ACM Comput. Surv. 56(10): 263 (2024) - [j21]Mohammadjavad Zohrabi, Saeed Saravani, Mostafa Haghir Chehreghani:
Centrality-based and similarity-based neighborhood extension in graph neural networks. J. Supercomput. 80(16): 24638-24663 (2024) - [c21]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani:
Hierarchical Correlation Clustering and Tree Preserving Embedding. CVPR 2024: 23083-23093 - [i18]Yassin Mohamadi, Mostafa Haghir Chehreghani:
Strong Transitivity Relations and Graph Neural Networks. CoRR abs/2401.01384 (2024) - [i17]Nemat Gholinejad, Mostafa Haghir Chehreghani:
Heterophily-Aware Fair Recommendation using Graph Convolutional Networks. CoRR abs/2402.03365 (2024) - [i16]Batool Lakzaei, Mostafa Haghir Chehreghani, Alireza Bagheri:
LOSS-GAT: Label Propagation and One-Class Semi-Supervised Graph Attention Network for Fake News Detection. CoRR abs/2402.08401 (2024) - 2023
- [j20]Mehdi Salemi Mottaghi, Mostafa Haghir Chehreghani
A deep comprehensive model for stock price prediction. J. Ambient Intell. Humaniz. Comput. 14(8): 11385-11395 (2023) - [j19]Mostafa Haghir Chehreghani
On using affine sketches for multiple-response dynamic graph regression. J. Supercomput. 79(5): 5139-5153 (2023) - [j18]Mostafa Haghir Chehreghani, Zahra Yaghoobi:
Improving empirical efficiency of CUR decomposition. J. Supercomput. 79(8): 9350-9366 (2023) - [c20]Zahra Moteshaker Arani, Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani:
Non-uniform Sampling Methods for Large Itemset Mining. IEEE Big Data 2023: 5714-5722 - [i15]Mohammad Moradi, Mostafa Haghir Chehreghani:
Multilevel User Credibility Assessment in Social Networks. CoRR abs/2309.13305 (2023) - [i14]Fatemeh Gholamzadeh Nasrabadi, AmirHossein Kashani
Content Augmented Graph Neural Networks. CoRR abs/2311.12741 (2023) - 2022
- [j17]Mostafa Haghir Chehreghani
On the theory of dynamic graph regression problem. Comput. Appl. Math. 41(8) (2022) - [j16]Mostafa Haghir Chehreghani
Half a decade of graph convolutional networks. Nat. Mach. Intell. 4(3): 192-193 (2022) - [c19]Mahdi Ghanbari, Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani:
Graph Clustering Using Node Embeddings: An Empirical Study. IEEE Big Data 2022: 5488-5493 - [c18]Sara Asghari, Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani:
On Using Node Indices and Their Correlations for Fake Account Detection. IEEE Big Data 2022: 5656-5661 - [i13]Mostafa Haghir Chehreghani:
The Embeddings World and Artificial General Intelligence. CoRR abs/2209.06569 (2022) - 2021
- [j15]Mostafa Haghir Chehreghani
Sublinear update time randomized algorithms for dynamic graph regression. Appl. Math. Comput. 410: 126434 (2021) - [j14]Mostafa Haghir Chehreghani, Albert Bifet
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. Fundam. Informaticae 182(3): 219-242 (2021) - [j13]Mostafa Haghir Chehreghani
Dynamical algorithms for data mining and machine learning over dynamic graphs. WIREs Data Mining Knowl. Discov. 11(2) (2021) - [c17]Masoud Malek, Mostafa Haghir Chehreghani, Ehsan Nazerfard, Morteza Haghir Chehreghani:
Shallow Node Representation Learning using Centrality Indices. IEEE BigData 2021: 5209-5214 - [i12]Mostafa Haghir Chehreghani:
Effectively Counting s-t Simple Paths in Directed Graphs. CoRR abs/2103.06102 (2021) - 2020
- [j12]Mostafa Haghir Chehreghani
Sampling informative patterns from large single networks. Future Gener. Comput. Syst. 106: 653-658 (2020) - [j11]Morteza Haghir Chehreghani
Learning representations from dendrograms. Mach. Learn. 109(9-10): 1779-1802 (2020) - [c16]Mostafa Haghir Chehreghani:
Subsampled Randomized Hadamard Transform for Regression of Dynamic Graphs. CIKM 2020: 2045-2048 - [i11]Mostafa Haghir Chehreghani:
Generalized Centrality Aggregation and Exclusive Centrality. CoRR abs/2010.01019 (2020)
2010 – 2019
- 2019
- [c15]Mostafa Haghir Chehreghani, Albert Bifet
Adaptive Algorithms for Estimating Betweenness and k-path Centralities. CIKM 2019: 1231-1240 - [c14]Mostafa Haghir Chehreghani
Metropolis-Hastings Algorithms for Estimating Betweenness Centrality. EDBT 2019: 686-689 - [i10]Mostafa Haghir Chehreghani:
On the Theory of Dynamic Graph Regression Problem. CoRR abs/1903.10699 (2019) - [i9]Mostafa Haghir Chehreghani:
Sketch-based Randomized Algorithms for Dynamic Graph Regression. CoRR abs/1905.11963 (2019) - 2018
- [j10]Mostafa Haghir Chehreghani
Discriminative Distance-Based Network Indices with Application to Link Prediction. Comput. J. 61(7): 998-1014 (2018) - [c13]Mostafa Haghir Chehreghani, Albert Bifet
An In-depth Comparison of Group Betweenness Centrality Estimation Algorithms. IEEE BigData 2018: 2104-2113 - [c12]Mostafa Haghir Chehreghani, Albert Bifet
DyBED: An Efficient Algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs. IEEE BigData 2018: 2114-2123 - [c11]Mostafa Haghir Chehreghani
Efficient Context-Aware K-Nearest Neighbor Search. ECIR 2018: 466-478 - [c10]Mostafa Haghir Chehreghani
Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. PAKDD (3) 2018: 752-764 - [i8]Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem:
Novel Adaptive Algorithms for Estimating Betweenness, Coverage and k-path Centralities. CoRR abs/1810.10094 (2018) - [i7]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani:
Nonparametric Feature Extraction from Dendrograms. CoRR abs/1812.09225 (2018) - 2017
- [j9]Mostafa Haghir Chehreghani
Upper and lower bounds for the q-entropy of network models with application to network model selection. Inf. Process. Lett. 119: 1-8 (2017) - [i6]Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem:
Discriminative Distance-Based Network Indices and the Tiny-World Property. CoRR abs/1703.06227 (2017) - [i5]Mostafa Haghir Chehreghani, Talel Abdessalem, Albert Bifet:
Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks. CoRR abs/1704.07351 (2017) - [i4]Mostafa Haghir Chehreghani, Albert Bifet, Talel Abdessalem:
Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs. CoRR abs/1708.08739 (2017) - 2016
- [b1]Mostafa Haghir Chehreghani:
A Theory-based Study of Graph Mining ; Een theoretische studie van graph mining. Katholieke Universiteit Leuven, Belgium, 2016 - [j8]Mostafa Haghir Chehreghani
Mining rooted ordered trees under subtree homeomorphism. Data Min. Knowl. Discov. 30(5): 1249-1272 (2016) - [c9]Mostafa Haghir Chehreghani:
A Framework for Description and Analysis of Sampling-Based Approximate Triangle Counting Algorithms. DSAA 2016: 80-89 - [c8]Mostafa Haghir Chehreghani
Transactional Tree Mining. ECML/PKDD (1) 2016: 182-198 - [c7]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani:
Modeling Transitivity in Complex Networks. UAI 2016 - 2014
- [j7]Mostafa Haghir Chehreghani
An Efficient Algorithm for Approximate Betweenness Centrality Computation. Comput. J. 57(9): 1371-1382 (2014) - [c6]Mostafa Haghir Chehreghani:
Effective co-betweenness centrality computation. WSDM 2014: 423-432 - [p1]Jan Ramon, Constantin Comendant, Mostafa Haghir Chehreghani, Yuyi Wang:
Graph and Network Pattern Mining. Mining User Generated Content 2014: 97-126 - [i3]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani:
Modeling Transitivity in Complex Networks. CoRR abs/1411.0958 (2014) - [i2]Mostafa Haghir Chehreghani, Maurice Bruynooghe:
Mining Rooted Ordered Trees under Homeomorphism. CoRR abs/1412.1470 (2014) - 2013
- [c5]Mostafa Haghir Chehreghani:
An efficient algorithm for approximate betweenness centrality computation. CIKM 2013: 1489-1492 - [i1]Mostafa Haghir Chehreghani:
Efficient Algorithms for Approximate Triangle Counting. CoRR abs/1304.6393 (2013) - 2012
- [j6]Morteza Haghir Chehreghani, Mostafa Haghir Chehreghani
Probabilistic Heuristics for Hierarchical Web Data Clustering. Comput. Intell. 28(2): 209-233 (2012) - 2011
- [j5]Mostafa Haghir Chehreghani
OInduced: An Efficient Algorithm for Mining Induced Patterns From Rooted Ordered Trees. IEEE Trans. Syst. Man Cybern. Part A 41(5): 1013-1025 (2011) - [c4]Mostafa Haghir Chehreghani
Efficiently Mining Unordered Trees. ICDM 2011: 111-120
2000 – 2009
- 2009
- [j4]Morteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani
Density link-based methods for clustering web pages. Decis. Support Syst. 47(4): 374-382 (2009) - [j3]Mostafa Haghir Chehreghani
Efficient rule based structural algorithms for classification of tree structured data. Intell. Data Anal. 13(1): 165-188 (2009) - 2008
- [j2]Morteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani
Improving density-based methods for hierarchical clustering of web pages. Data Knowl. Eng. 67(1): 30-50 (2008) - 2007
- [j1]Mostafa Haghir Chehreghani, Masoud Rahgozar, Caro Lucas, Morteza Haghir Chehreghani:
A heuristic algorithm for clustering rooted ordered trees. Intell. Data Anal. 11(4): 355-376 (2007) - [c3]Mostafa Haghir Chehreghani, Masoud Rahgozar
Mining Maximal Embedded Unordered Tree Patterns. CIDM 2007: 437-443 - [c2]Mostafa Haghir Chehreghani, Masoud Rahgozar
Clustering Rooted Ordered Trees. CIDM 2007: 450-455 - [c1]Morteza Haghir Chehreghani, Hassan Abolhassani, Mostafa Haghir Chehreghani
Attaining Higher Quality for Density Based Algorithms. RR 2007: 329-338
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: