default search action
Mohammad Naderi Dehkordi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j13]Fatemeh Nazarieh, Mohammad Naderi Dehkordi:
Time series forecasting based on a novel ensemble-based network and variational mode decomposition. Expert Syst. J. Knowl. Eng. 40(7) (2023) - [j12]Maryam Sadeghi, Mohammad Naderi Dehkordi, Behrang Barekatain, Naser Khani:
Improve customer churn prediction through the proposed PCA-PSO-K means algorithm in the communication industry. J. Supercomput. 79(6): 6871-6888 (2023) - [j11]Maryam Sadeghi, Mohammad Naderi Dehkordi, Behrang Barekatain, Naser Khani:
Correction to: Improve customer churn prediction through the proposed PCA‑PSO‑K means algorithm in the communication industry. J. Supercomput. 79(9): 10505 (2023) - [j10]Maryam Sadeghi, Mohammad Naderi Dehkordi, Behrang Barekatain, Naser Khani:
Correction to: Improve customer churn prediction through the proposed PCA‑PSO‑K means algorithm in the communication industry. J. Supercomput. 79(13): 15212 (2023) - 2021
- [j9]Maryam Kiabod, Mohammad Naderi Dehkordi, Behrang Barekatain:
A fast graph modification method for social network anonymization. Expert Syst. Appl. 180: 115148 (2021) - 2020
- [j8]Fatemeh Fouladfar, Mohammad Naderi Dehkordi, Mohammad Ehsan Basiri:
Predicting the Helpfulness Score of Product Reviews Using an Evidential Score Fusion Method. IEEE Access 8: 82662-82687 (2020) - [j7]Akbar Telikani, Amir H. Gandomi, Asadollah Shahbahrami, Mohammad Naderi Dehkordi:
Privacy-preserving in association rule mining using an improved discrete binary artificial bee colony. Expert Syst. Appl. 144: 113097 (2020)
2010 – 2019
- 2019
- [j6]Maryam Kiabod, Mohammad Naderi Dehkordi, Behrang Barekatain:
TSRAM: A time-saving k-degree anonymization method in social network. Expert Syst. Appl. 125: 378-396 (2019) - [j5]A. Karimi Rizi, Mohammad Naderi Dehkordi, N. Nemat bakhsh:
SNI: Supervised Anonymization Technique to Publish Social Networks Having Multiple Sensitive Labels. Secur. Commun. Networks 2019: 8171263:1-8171263:23 (2019) - 2018
- [j4]Behnam Talebi, Mohammad Naderi Dehkordi:
Sensitive association rules hiding using electromagnetic field optimization algorithm. Expert Syst. Appl. 114: 155-172 (2018) - [j3]Ehsan Amiri, Mohammad Naderi Dehkordi:
Dynamic data clustering by combining improved discrete artificial bee colony algorithm with fuzzy logic. Int. J. Bio Inspired Comput. 12(3): 164-172 (2018) - [c2]Mohammad Norouzifard, Amin Abdollahi Dehkordi, Mohammad Naderi Dehkordi, Hamid Gholamhosseini, Reinhard Klette:
Unsupervised Optic Cup and Optic Disk Segmentation for Glaucoma Detection by ICICA. I-SPAN 2018: 209-214 - 2016
- [j2]Mahtab Hossein Afshari, Mohammad Naderi Dehkordi, Mehdi Akbari:
Association rule hiding using cuckoo optimization algorithm. Expert Syst. Appl. 64: 340-351 (2016)
2000 – 2009
- 2009
- [j1]Mohammad Naderi Dehkordi, Kambiz Badie, Ahmad Khadem Zadeh:
A Novel Method for Privacy Preserving in Association Rule Mining Based on Genetic Algorithms. J. Softw. 4(6): 555-562 (2009) - 2007
- [c1]Mohammad Naderi Dehkordi, Mohammad Hassan Shenassa:
Construct Optimal Predictive Classificatoin rules. DMIN 2007: 52-58
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-08-05 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint