![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Mahdi Esmaeili
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j11]Nadia Nekouie, Morteza Romoozi, Mahdi Esmaeili:
Correction: A New Evolutionary Ensemble Learning of Multimodal Feature Selection from Microarray Data. Neural Process. Lett. 56(4): 204 (2024) - [j10]Zohreh Sadat Akhavan-Hejazi, Mahdi Esmaeili, Mostafa Ghobaei-Arani
, Behrouz Minaei-Bidgoli:
Identifying influential users using homophily-based approach in location-based social networks. J. Supercomput. 80(13): 19091-19126 (2024) - [j9]Zahra Sadat Sajjadi, Mahdi Esmaeili, Mostafa Ghobaei-Arani
, Behrouz Minaei-Bidgoli:
An efficient graph embedding clustering approach for heterogeneous network. J. Supercomput. 80(13): 19562-19591 (2024) - 2023
- [j8]Zahra Sadat Sajjadi, Mahdi Esmaeili, Mostafa Ghobaei-Arani
, Behrouz Minaei-Bidgoli:
A hybrid clustering approach for link prediction in heterogeneous information networks. Knowl. Inf. Syst. 65(11): 4905-4937 (2023) - [j7]Nadia Nekouie, Morteza Romoozi, Mahdi Esmaeili:
A New Evolutionary Ensemble Learning of Multimodal Feature Selection from Microarray Data. Neural Process. Lett. 55(5): 6753-6780 (2023) - [j6]Nadia Nekouie, Morteza Romoozi, Mahdi Esmaeili:
Multimodal feature selection from microarray data based on Dempster-Shafer evidence fusion. J. Supercomput. 79(11): 12591-12621 (2023) - [j5]Nadia Nekouie, Morteza Romoozi, Mahdi Esmaeili:
Correction to: Multimodal feature selection from microarray data based on Dempster-Shafer evidence fusion. J. Supercomput. 79(15): 17754 (2023) - 2022
- [j4]Mohsen Taherinia, Mahdi Esmaeili, Behrouz Minaei-Bidgoli:
A high-performance algorithm for finding influential nodes in large-scale social networks. J. Supercomput. 78(14): 15905-15952 (2022) - 2018
- [j3]Jafar Pouramini
, Behrouz Minaei-Bidgoli
, Mahdi Esmaeili:
A Novel Feature Selection Method in the Categorization of Imbalanced Textual Data. KSII Trans. Internet Inf. Syst. 12(8): 3725-3748 (2018) - [j2]Mohammad Tahmasebi, Faranak Fotouhi-Ghazvini, Mahdi Esmaeili:
Learning Style and Web Page Features. J. Web Eng. 17(3&4): 284-304 (2018) - 2006
- [j1]Sohrab Effati
, Mohammad Janfada
, Mahdi Esmaeili
, H. Roohparvar:
Solving of optimal control problem of parabolic PDEs in exploitation of oil by iterative dynamic programming. Appl. Math. Comput. 181(2): 1505-1512 (2006)
Informal and Other Publications
- 2010
- [i1]Mahdi Esmaeili, Fazekas Gabor:
Finding Sequential Patterns from Large Sequence Data. CoRR abs/1002.1150 (2010)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-08-06 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint