default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHadi Zare 0001
Person information
- affiliation: University of Tehran, Iran
Other persons with the same name
- Hadi Zare 0002
![[0000-0001-5662-9463]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0001-5662-9463")
— The University of Manchester, UK - Hadi Zare 0003 (aka: Hadi Zare Khormizi) — Yazd University, College of Natural Resources and Desert, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Rouhollah Ahmadian, Mehdi Ghatee, Johan Wahlström, Hadi Zare:
Uncertainty Quantification to Enhance Probabilistic-Fusion-Based User Identification Using Smartphones. IEEE Internet Things J. 11(20): 33450-33458 (2024)- [j22]Soheila Molaei, Ghazaleh Niknam, Ghadeer O. Ghosheh, Vinod Kumar Chauhan, Hadi Zare, Tingting Zhu, Shirui Pan, David A. Clifton:
Temporal dynamics unleashed: Elevating variational graph attention. Knowl. Based Syst. 299: 112110 (2024) - [c4]Soheila Molaei, Anshul Thakur, Ghazaleh Niknam, Andrew A. S. Soltan, Hadi Zare, David A. Clifton:
Federated Learning For Heterogeneous Electronic Health Records Utilising Augmented Temporal Graph Attention Networks. AISTATS 2024: 1342-1350 - 2023
- [j21]Mohammad Ali Soltanshahi, Babak Teimourpour, Hadi Zare:
BuB: a builder-booster model for link prediction on knowledge graphs. Appl. Netw. Sci. 8(1): 27 (2023) - [j20]Ghazaleh Niknam, Soheila Molaei, Hadi Zare, David A. Clifton, Shirui Pan:
Graph representation learning based on deep generative gaussian mixture models. Neurocomputing 523: 157-169 (2023) - [j19]Ghazaleh Niknam, Soheila Molaei, Hadi Zare, Shirui Pan, Mahdi Jalili, Tingting Zhu, David A. Clifton:
DyVGRNN: DYnamic mixture Variational Graph Recurrent Neural Networks. Neural Networks 165: 596-610 (2023) - [j18]Soheila Molaei, Nima Ghanbari Bousejin, Hadi Zare, Mahdi Jalili, Shirui Pan:
Learning Graph Representations With Maximal Cliques. IEEE Trans. Neural Networks Learn. Syst. 34(2): 1089-1096 (2023) - [i9]Narges Sadat Fazeli Dehkordi, Hadi Zare, Parham Moradi, Mahdi Jalili:
Graph Variational Embedding Collaborative Filtering. CoRR abs/2311.11824 (2023) - 2022
- [j17]Mohammad Ali Soltanshahi, Babak Teimourpour, Toktam Khatibi, Hadi Zare:
GrAR: A novel framework for Graph Alignment based on Relativity concept. Expert Syst. Appl. 187: 115908 (2022) - [j16]Mohsen Ghassemi Parsa, Hadi Zare, Mehdi Ghatee:
Low-rank dictionary learning for unsupervised feature selection. Expert Syst. Appl. 202: 117149 (2022) - 2021
- [j15]Soheila Molaei, Amirhossein Havvaei, Hadi Zare, Mahdi Jalili:
Collaborative Deep Forest Learning for Recommender Systems. IEEE Access 9: 22053-22061 (2021) - [j14]Sondos Bahadori, Parham Moradi, Hadi Zare:
An improved limited random walk approach for identification of overlapping communities in complex networks. Appl. Intell. 51(6): 3561-3580 (2021) - [j13]Atieh Khodadadi, Soheila Molaei, Mehdi Teimouri, Hadi Zare:
Classification of audio codecs with variable bit-rates using deep-learning methods. Digit. Signal Process. 110: 102952 (2021) - [j12]Sondos Bahadori, Hadi Zare, Parham Moradi:
PODCD: Probabilistic overlapping dynamic community detection. Expert Syst. Appl. 174: 114650 (2021) - [j11]Soheila Molaei, Nima Ghanbari Bousejin, Hadi Zare, Mahdi Jalili:
Deep node clustering based on mutual information maximization. Neurocomputing 455: 274-282 (2021) - [j10]Hadi Zare, Mahdi Hajiabadi, Mahdi Jalili:
Detection of Community Structures in Networks With Nodal Features based on Generative Probabilistic Approach. IEEE Trans. Knowl. Data Eng. 33(7): 2863-2874 (2021) - [c3]Bahareh Fatemi, Soheila Molaei, Hadi Zare, Shirui Pan:
Manifold Approximation and Projection by Maximizing Graph Information. PAKDD (3) 2021: 128-140 - [i8]Mohsen Ghassemi Parsa, Hadi Zare, Mehdi Ghatee:
Low-rank Dictionary Learning for Unsupervised Feature Selection. CoRR abs/2106.11102 (2021) - 2020
- [j9]Mohsen Ghassemi Parsa, Hadi Zare, Mehdi Ghatee:
Unsupervised feature selection based on adaptive similarity learning and subspace clustering. Eng. Appl. Artif. Intell. 95: 103855 (2020) - [j8]Kayvan Bijari, Hadi Zare, Emad Kebriaei, Hadi Veisi:
Leveraging deep graph-based text representation for sentiment polarity applications. Expert Syst. Appl. 144: 113090 (2020) - [j7]Soheila Molaei, Hadi Zare, Hadi Veisi:
Deep learning approach on information diffusion in heterogeneous networks. Knowl. Based Syst. 189 (2020) - [c2]Hadi Zare, Mohsen Ghassemi Parsa, Mehdi Ghatee, Sasan Hossein Alizadeh:
Similarity Preserving Unsupervised Feature Selection based on Sparse Learning. IST 2020: 50-55 - [c1]Sasan Hossein Alizadeh, Nima Shiri Harzevili, Alireza Hediehloo, Hadi Zare:
Relaxing Pairwise Conditional Dependency of NB Attributes using Hidden Variables. IST 2020: 116-122
2010 – 2019
- 2019
- [j6]Shadi Abpeykar, Mehdi Ghatee, Hadi Zare:
Ensemble decision forest of RBF networks via hybrid feature clustering approach for high-dimensional data classification. Comput. Stat. Data Anal. 131: 12-36 (2019) - [i7]Soheila Molaei, Hadi Zare, Hadi Veisi:
Deep Learning Approach on Information Diffusion in Heterogeneous Networks. CoRR abs/1902.08810 (2019) - [i6]Kayvan Bijari, Hadi Zare, Hadi Veisi, Emad Kebriaei:
Deep Sentiment Analysis using a Graph-based Text Representation. CoRR abs/1902.10247 (2019) - [i5]Mohsen Ghassemi Parsa, Hadi Zare, Mehdi Ghatee:
Unsupervised Feature Selection based on Adaptive Similarity Learning and Subspace Clustering. CoRR abs/1912.05458 (2019) - [i4]Hadi Zare, Mahdi Hajiabadi, Mahdi Jalili:
Detection of Community Structures in Networks with Nodal Features based on Generative Probabilistic Approach. CoRR abs/1912.11420 (2019) - 2018
- [j5]Kayvan Bijari, Hadi Zare, Hadi Veisi, Hossein Bobarshad:
Memory-enriched big bang-big crunch optimization algorithm for data clustering. Neural Comput. Appl. 29(6): 111-121 (2018) - 2017
- [j4]Mahdi Hajiabadi, Hadi Zare, Hossein Bobarshad:
IEDC: An integrated approach for overlapping and non-overlapping community detection. Knowl. Based Syst. 123: 188-199 (2017) - [i3]Kayvan Bijari, Hadi Zare, Hadi Veisi, Hossein Bobarshad:
Memory Enriched Big Bang Big Crunch Optimization Algorithm for Data Clustering. CoRR abs/1703.02883 (2017) - 2016
- [j3]Hadi Zare, Mojtaba Niazi:
Relevant based structure learning for feature selection. Eng. Appl. Artif. Intell. 55: 93-102 (2016) - [j2]Mehdi Zarkeshzadeh, Hadi Zare, Zainabolhoda Heshmati, Mehdi Teimouri:
A novel hybrid method for improving ambulance dispatching response time through a simulation study. Simul. Model. Pract. Theory 60: 170-184 (2016) - [i2]Hadi Zare, Mojtaba Niazi:
Relevant based structure learning for feature selection. CoRR abs/1608.07934 (2016) - [i1]Mahdi Hajiabadi, Hadi Zare, Hossein Bobarshad:
IEDC: An Integrated Approach for Overlapping and Non-overlapping Community Detection. CoRR abs/1612.04679 (2016) - 2013
- [j1]Hadi Zare, Adel Mohammadpour, Parham Moradi:
A random projection approach for estimation of the betweenness centrality measure. Intell. Data Anal. 17(2): 217-231 (2013)
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 2025-01-20 22:44 CET 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:
