default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSajad Parvin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c17]Mohammad Iman Jamnejad, Sajad Parvin, Ali Heidarzadegan, Mohsen Moshki:
A Meta Classifier by Clustering of Classifiers. MICAI (2) 2014: 140-151- 2013
- [j1]Hamid Parvin
, Hamid Alinejad-Rokny, Behrouz Minaei-Bidgoli, Sajad Parvin:
A new classifier ensemble methodology based on subspace learning. J. Exp. Theor. Artif. Intell. 25(2): 227-250 (2013) - 2012
- [c16]Hamid Parvin, Behzad Maleki, Sajad Parvin:
A Clustering Ensemble Based on a Modified Normalized Mutual Information Metric. AMT 2012: 32-42 - [c15]Hamid Parvin, Sajad Parvin, Zahra Rezaei, Moslem Mohamadi:
CDEBMTE: Creation of Diverse Ensemble Based on Manipulation of Training Examples. DCAI 2012: 113-120 - [c14]Hamid Parvin, Atousa Dahbashi, Sajad Parvin, Behrouz Minaei-Bidgoli:
Improving Persian Text Classification and Clustering Using Persian Thesaurus. DCAI 2012: 493-500 - [c13]Hamid Parvin, Sajad Parvin, Zahra Rezaei, Moslem Mohamadi:
Classifier Ensemble Framework Based on Clustering. DCAI 2012: 743-750 - [c12]Hosein Alizadeh, Hamid Parvin, Sajad Parvin, Zahra Rezaei, Moslem Mohamadi:
A Max Metric to Evaluate a Cluster. HAIS (1) 2012: 255-266 - [c11]Hamid Parvin, Moslem Mohamadi, Sajad Parvin, Zahra Rezaei, Behrouz Minaei:
Nearest Cluster Classifier. HAIS (1) 2012: 267-275 - [c10]Hamid Parvin, Hosein Alizadeh, Sajad Parvin, Behzad Maleki:
A Heuristic Diversity Production Approach. ICCSA (3) 2012: 647-656 - [c9]Hamid Parvin, Sajad Parvin, Zahra Rezaei, Moslem Mohamadi:
A Heuristically Perturbation of Dataset to Achieve a Diverse Ensemble of Classifiers. MCPR 2012: 197-206 - [c8]Hamid Parvin, Sajad Parvin:
Unsupervised Linkage Learner Based on Local Optimums. MCPR 2012: 255-264 - [c7]Hamid Parvin, Sara Ansari, Sajad Parvin:
A Diversity Production Approach in Ensemble of Base Classifiers. MICAI (1) 2012: 51-60 - [c6]Hamid Parvin, Sajad Parvin:
A Robust Classifier Ensemble for Improving the Performance of Classification. MICAI (Special Sessions) 2012: 52-57 - [c5]Hamid Parvin, Sajad Parvin:
Effective Diagnosis of Breast Cancer. MICAI (Special Sessions) 2012: 66-70 - [c4]Hamid Parvin, Sara Ansari, Sajad Parvin:
Proposing a New Method for Non-relative Imbalanced Dataset. SOCO 2012: 297-306 - 2011
- [c3]Hamid Parvin, Behrouz Minaei-Bidgoli, Sajad Parvin:
A Scalable Heuristic Classifier for Huge Datasets: A Theoretical Approach. CIARP 2011: 380-390 - [c2]Hamid Parvin, Behrouz Minaei-Bidgoli, Sajad Parvin:
An Accumulative Points/Votes Based Approach for Feature Selection. CIARP 2011: 399-408 - [c1]Hamid Parvin, Behrouz Minaei, Sajad Parvin:
A Metric to Evaluate a Cluster by Eliminating Effect of Complement Cluster. KI 2011: 246-254
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-09 13:19 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:
