Javad Hamidzadeh

dblp:118/6773 · DBLP profile ↗
← Back
24ranked-venue papers
12as first author
9since 2021 · last 2025
0000-0001-6493-0539ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 20 · 11 first-author · 5 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Feature selection by utilizing kernel-based fuzzy rough set and entropy-based non-dominated sorting genetic algorithm in multi-label data
Javad Hamidzadeh, Zahra Mehravaran, Ahad Harati
Knowl. Inf. Syst.1
2025 Dempster-shafer deep capsule attention model (DDCAM)
Zahra Mehravaran, Ahmad Navid Ghanizadeh, Javad Hamidzadeh, Ahad Harati
Multim. Tools Appl.3
2024 Protecting the privacy of social network data using graph correction
Amir Dehaki Toroghi, Javad Hamidzadeh
Knowl. Inf. Syst.2
2024 Handling class imbalance and overlap with a Hesitation-based instance selection method
Mona Moradi, Javad Hamidzadeh
Knowl. Based Syst.2
2024 Feature selection based on correlation label and B-R belief function (FSCLBF) in multi-label data
Zahra Mehravaran, Javad Hamidzadeh, Reza Monsefi
Soft Comput.2
2023 A domain adaptation method by incorporating belief function in twin quarter-sphere SVM
Mona Moradi, Javad Hamidzadeh
Knowl. Inf. Syst.2
2021 Weighted support vector machine using fuzzy rough set theory
Somaye Moslemnejad, Javad Hamidzadeh
Soft Comput.2
2021 Ensemble classification for intrusion detection via feature extraction based on deep Learning
Maryam Yousefnezhad, Javad Hamidzadeh, Mohammad Aliannejadi
Soft Comput.2
2021 Feature selection by using chaotic cuckoo optimization algorithm with levy flight, opposition-based learning and disruption operator
Mahsa kelidari, Javad Hamidzadeh
Soft Comput.2
2020 Enhancing data analysis: uncertainty-resistance method for handling incomplete data
Javad Hamidzadeh, Mona Moradi
Appl. Intell.1
2020 Combined weighted multi-objective optimizer for instance reduction in two-class imbalanced data problem
Javad Hamidzadeh, Niloufar Kashefi, Mona Moradi
Eng. Appl. Artif. Intell.1
2020 Incremental one-class classifier based on convex-concave hull
Javad Hamidzadeh, Mona Moradi
Pattern Anal. Appl.1
2020 Clustering data stream with uncertainty using belief function theory and fading function
Javad Hamidzadeh, Reyhaneh Ghadamyari
Soft Comput.1
2020 Feature selection by using privacy-preserving of recommendation systems based on collaborative filtering and mutual trust in social networks
Somayeh Moghaddam Zadeh Kashani, Javad Hamidzadeh
Soft Comput.2
2019 Identification of uncertainty and decision boundary for SVM classification training using belief function
Javad Hamidzadeh, Somaye Moslemnejad
Appl. Intell.1
2019 Belief-based chaotic algorithm for support vector data description
Javad Hamidzadeh, Neda Namaei
Soft Comput.1
2018 Improved one-class classification using filled function
Javad Hamidzadeh, Mona Moradi
Appl. Intell.1
2018 Incremental one-class classification on stationary data stream using two-quarter sphere
abstract
Abstract Data stream is a sequence of data that has unique features. In many data streams, data from one concept is available, and detection of other types of data in data stream is an essential task. One‐class classification is a famous approach to data classification when data from one class is accessible. The principal task of one‐class classification is separating input data in two different parts: target and outlier data. One of the main challenges concerning data classification on the stationary data streams is the response time, which causes negative effects on effective runtime. Most classifiers, that have been proposed on Rd feature space, solve a quadratic problem for classification that leads to extreme runtime increase. In this paper, an incremental one‐class classification on stationary data streams is proposed using two‐quarter sphere (IOCTQ) in order to achieve lower computation cost of classification time, and a linear optimization problem is solved. IOCTQ divides one data classification problem into two data classifiers, and each data point will be individually classified in one‐quarter sphere. The two‐quarter spheres can be run parallel. The results of the experiments have been compared with state‐of‐the‐art methods and show superiority of the IOCTQ method in classification accuracy and time complexity.
Mohammad Hadi Ghomanjani, Javad Hamidzadeh
Expert Syst. J. Knowl. Eng.2
2018 Detection of Web site visitors based on fuzzy rough sets
Javad Hamidzadeh, Mahdieh Zabihimayvan, Reza Sadeghi
Soft Comput.1
2018 Automatic support vector data description
Reza Sadeghi, Javad Hamidzadeh
Soft Comput.2
2016 New Hermite orthogonal polynomial kernel and combined kernels in Support Vector Machine classifier
Vahid Hooshmand Moghaddam, Javad Hamidzadeh
Pattern Recognit.2
2015 IRAHC: Instance Reduction Algorithm using Hyperrectangle Clustering
Javad Hamidzadeh, Reza Monsefi, Hadi Sadoghi Yazdi
Pattern Recognit.1
2014 LMIRA: Large Margin Instance Reduction Algorithm
Javad Hamidzadeh, Reza Monsefi, Hadi Sadoghi Yazdi
Neurocomputing1
2012 DDC: distance-based decision classifier
Javad Hamidzadeh, Reza Monsefi, Hadi Sadoghi Yazdi
Neural Comput. Appl.1