Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hakan Ezgi Kiziloz

dblp:138/1040 · DBLP profile ↗
← Back
14ranked-venue papers
5as first author
5since 2021 · last 2022
0000-0002-4815-9024ORCID · verified

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

Artificial intelligence and machine learning · 9 · 2 first-author · 5 since 2021Human-computer interaction and ubiquitous computing · 3 · 2 first-authorComputer networks · 1 · 1 first-authorSecurity and privacy · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Authentication and access control · 100%
Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control
human interactive proofs
0.212016
Leveraging human computation for pure-text Human Interaction Proofs · Int. J. Hum. Comput. Stud. 2016
Authentication and access control › human interactive proofs › CAPTCHA
text-based CAPTCHA
0.212016
Leveraging human computation for pure-text Human Interaction Proofs · Int. J. Hum. Comput. Stud. 2016
Collaborative and social computing
human computation
0.112016
Leveraging human computation for pure-text Human Interaction Proofs · Int. J. Hum. Comput. Stud. 2016

Methods — techniques the papers use, named apart from their topics

human computation · 0.5
YearPublicationVenuePosition
2022 Boosting Initial Population in Multiobjective Feature Selection with Knowledge-Based Partitioning
abstract
The quality of features is one of the main factors that affect classification performance. Feature selection aims to remove irrelevant and redundant features from data in order to increase classification accuracy. However, identifying these features is not a trivial task due to a large search space. Evolutionary algorithms have been proven to be effective in many optimization problems, including feature selection. These algorithms require an initial population to start their search mechanism, and a poor initial population may cause getting stuck in local optima. Diversifying the initial population is known as an effective approach to overcome this issue; yet, it may not suffice as the search space grows exponentially with increasing feature sizes. In this study, we propose an enhanced initial population strategy to boost the performance of the feature selection task. In our proposed method, we ensure the diversity of the initial population by partitioning the candidate solutions according to their selected number of features. In addition, we adjust the chances of features being selected into a candidate solution regarding their information gain values, which enables wise selection of features among a vast search space. We conduct extensive experiments on many benchmark datasets retrieved from UCI Machine Learning Repository. Moreover, we apply our algorithm on a real-world, large-scale dataset, i.e., Stanford Sentiment Treebank. We observe significant improvements after the comparisons with three off-the-shelf initialization strategies.
Ayça Deniz, Hakan Ezgi Kiziloz
IJCNN2
2022 Predicting the severity of COVID-19 patients using a multi-threaded evolutionary feature selection algorithm
abstract
Abstract The COVID‐19 pandemic has huge effects on the global community and an extreme burden on health systems. There are more than 185 million confirmed cases and 4 million deaths as of July 2021. Besides, the exponential rise in COVID‐19 cases requires a quick prediction of the patients' severity for better treatment. In this study, we propose a Multi‐threaded Genetic feature selection algorithm combined with Extreme Learning Machines (MG‐ELM) to predict the severity level of the COVID‐19 patients. We conduct a set of experiments on a recently published real‐world dataset. We reprocess the dataset via feature construction to improve the learning performance of the algorithm. Upon comprehensive experiments, we report the most impactful features and symptoms for predicting the patients' severity level. Moreover, we investigate the effects of multi‐threaded implementation with statistical analysis. In order to verify the efficiency of MG‐ELM, we compare our results with traditional and state‐of‐the‐art techniques. The proposed algorithm outperforms other algorithms in terms of prediction accuracy.
Ayça Deniz, Hakan Ezgi Kiziloz, Ender Sevinç, Tansel Dökeroglu
Expert Syst. J. Knowl. Eng.2
2022 A comprehensive survey on recent metaheuristics for feature selection
Tansel Dökeroglu, Ayça Deniz, Hakan Ezgi Kiziloz
Neurocomputing3
2021 Classifier ensemble methods in feature selection
Hakan Ezgi Kiziloz
Neurocomputing1
2021 A robust multiobjective Harris' Hawks Optimization algorithm for the binary classification problem
Tansel Dökeroglu, Ayça Deniz, Hakan Ezgi Kiziloz
Knowl. Based Syst.3
2020 Feature Selection with Dynamic Classifier Ensembles
abstract
With the advance in technology, the volume of available data grows massively. Therefore, feature selection has become an essential preprocessing step to extract valuable information. Feature selection is the task of reducing the number of features by removing redundant features from data while preserving the classification accuracy. It is a multiobjective problem as there are two objectives. In general, multiobjective selection algorithms with machine learning techniques are utilized to find the most promising feature subsets; however, classification performances of these machine learning techniques are analyzed separately. In this study, we propose a new multiobjective selection model that dynamically searches for the best ensemble of five classifiers to extract the best representative feature subsets. We present the experiment results on 12 well-known datasets. The results show that the proposed method performs significantly better than all the machine learning techniques when they are executed separately. Moreover, the proposed method outperforms two existing ensemble algorithms, namely AdaBoost and Gradient Boosting.
Hakan Ezgi Kiziloz, Ayça Deniz
SMC1
2020 Boosting gender identification using author preference
Tayfun Küçükyilmaz, Ayça Deniz, Hakan Ezgi Kiziloz
Pattern Recognit. Lett.3
2019 On initial population generation in feature subset selection
Ayça Deniz, Hakan Ezgi Kiziloz
Expert Syst. Appl.2
2018 How Safe Is Safety Number? A User Study on SIGNAL's Fingerprint and Safety Number Methods for Public Key Verification
Kemal Bicakci, Enes Altuncu, Muhammet Sakir Sahkulubey, Hakan Ezgi Kiziloz, Yusuf Uzunay
ISC4
2018 Novel multiobjective TLBO algorithms for the feature subset selection problem
Hakan Ezgi Kiziloz, Ayça Deniz, Tansel Dökeroglu, Ahmet Cosar
Neurocomputing1
2017 Robust multiobjective evolutionary feature subset selection algorithm for binary classification using machine learning techniques
Ayça Deniz, Hakan Ezgi Kiziloz, Tansel Dökeroglu, Ahmet Cosar
Neurocomputing2
2017 A Closer Look at Pure-Text Human-Interaction Proofs
abstract
Human-interaction proofs (HIPs) are used to mitigate automated attacks. Security and usability have always been a critical problem for HIPs, especially when “accessibility” is a system requirement. Pure-text HIPs are more favorable from the usability perspective, but they are not secure. Audio HIPs usually cannot reliably distinguish attacks from legitimate use; they are either easy, and can be automatically solved, or hard, even for humans. In this study, we first compare the usability of a currently used pure-text HIP service, textCAPTCHA, against Google's reCAPTCHA. After analyzing the results, we propose a new HIP system (SMARTCHA). In this system, by using human computation we generate around 21 000 HIP tests. We conduct a user study among 31 visually impaired users to compare SMARTCHA against the latest version of audio reCAPTCHA HIPs. The study results show that SMARTCHA takes less time and is more enjoyable to solve, which suggests that pure-text HIPs could be a promising solution for secure, usable, and accessible HIPs.
Hakan Ezgi Kiziloz, Kemal Bicakci
IEEE Trans. Hum. Mach. Syst.1
2016 Leveraging human computation for pure-text Human Interaction Proofs
Kemal Bicakci, Hakan Ezgi Kiziloz
Int. J. Hum. Comput. Stud.2
2015 Towards making accessible human-interaction proofs more secure and usable
abstract
Human-Interaction Proof (HIP) systems are widely used to prevent malicious acts of abusers. Legitimate users, however, are not satisfied with their ease of use. The response of Google to the complaints of difficulty in solving audio reCAPTCHAs was to introduce a much simpler version. But now we are back at the position where we have an accessible and usable but insecure solution. In this work, we propose a pure-text HIP system as an attempt to satisfy accessibility, security, usability requirements altogether. We conduct a user study involving 31 blind or partially sighted users which compares the usability of our pure-text HIP system (SMARTCHA) against Google's new audio reCAPTCHA. The results of the user study show that visually impaired users enjoy solving SMARTCHA more and prefer it against audio reCAPTCHA.
Hakan Ezgi Kiziloz, Kemal Bicakci
ISCC1