Fazli Can

Fazli Can

Auto-generated profile, based on publicly available information

Fazli Can

Bilkent University, Ankara, Türkiye

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 February 2020 in ACM Computing Surveys
Verified
Journal Article
Open access
DKDilek Küçük
Dilek Küçük
FCFazli Can
Fazli Can
Automatic elicitation of semantic information from natural language texts is an important research problem with many practical application areas. Especially after the recent proliferation of online content through channels such as social media sites, news portals, and forums; solutions to problems such as sentiment analysis, sarcasm/controversy/veracity/rumour/fake news detection, and argument mining gained increasing impact and significance, revealed with large volumes of related scientific publications. In this article, we tackle an important problem from the same family and present a survey of stance detection in social media posts and (online) regular texts. Although stance detection is defined in different ways in different application settings, the most common definition is “automatic classification of the stance of the producer of a piece of text, towards a target, into one of these three classes: { Favor , Against , Neither }.” Our survey includes definitions of related problems and concepts, classifications of the proposed approaches so far, descriptions of the relevant datasets and tools, and related outstanding issues. Stance detection is a recent natural language processing topic with diverse application areas, and our survey article on this newly emerging topic will act as a significant resource for interested researchers and practitioners.

9 January 2019 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
HBHamed Bonab
Hamed Bonab
FCFazli Can
Fazli Can
The number of component classifiers chosen for an ensemble greatly impacts the prediction ability. In this paper, we use a geometric framework for a priori determining the ensemble size, which is applicable to most of the existing batch and online ensemble classifiers. There are only a limited number of studies on the ensemble size examining majority voting (MV) and weighted MV (WMV). Almost all of them are designed for batch-mode, hardly addressing online environments. Big data dimensions and resource limitations, in terms of time and memory, make the determination of ensemble size crucial, especially for online environments. For the MV aggregation rule, our framework proves that the more strong components we add to the ensemble, the more accurate predictions we can achieve. For the WMV aggregation rule, our framework proves the existence of an ideal number of components, which is equal to the number of class labels, with the premise that components are completely independent of each other and strong enough. While giving the exact definition for a strong and independent classifier in the context of an ensemble is a challenging task, our proposed geometric framework provides a theoretical explanation of diversity and its impact on the accuracy of predictions. We conduct a series of experimental evaluations to show the practical value of our theorems and existing challenges.

20 November 2020 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
ÖGÖmer Gözüaçık
Ömer Gözüaçık
FCFazli Can
Fazli Can

4 December 2007 in Journal of the American Society for Information Science and Technology
Verified
Journal Article
Closed access
PDF file
FCFazli Can
Fazli Can
SKSeyit Kocberber
Seyit Kocberber
EBErman Balcik
Erman Balcik
CKCihan Kaynak
Cihan Kaynak
HOH. Cagdas Ocalan
H. Cagdas Ocalan
OVOnur M. Vursavas
Onur M. Vursavas

17 July 2022 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
EGEge Berkay Gulcan
Ege Berkay Gulcan
FCFazli Can
Fazli Can

23 January 2018 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
HBHamed R. Bonab
Hamed R. Bonab
FCFazli Can
Fazli Can
Designing adaptive classifiers for an evolving data stream is a challenging task due to the data size and its dynamically changing nature. Combining individual classifiers in an online setting, the ensemble approach, is a well-known solution. It is possible that a subset of classifiers in the ensemble outperforms others in a time-varying fashion. However, optimum weight assignment for component classifiers is a problem, which is not yet fully addressed in online evolving environments. We propose a novel data stream ensemble classifier, called Geometrically Optimum and Online-Weighted Ensemble (GOOWE), which assigns optimum weights to the component classifiers using a sliding window containing the most recent data instances. We map vote scores of individual classifiers and true class labels into a spatial environment. Based on the Euclidean distance between vote scores and ideal-points, and using the linear least squares (LSQ) solution, we present a novel, dynamic, and online weighting approach. While LSQ is used for batch mode ensemble classifiers, it is the first time that we adapt and use it for online environments by providing a spatial modeling of online ensembles. In order to show the robustness of the proposed algorithm, we use real-world datasets and synthetic data generators using the Massive Online Analysis (MOA) libraries. First, we analyze the impact of our weighting system on prediction accuracy through two scenarios. Second, we compare GOOWE with eight state-of-the-art ensemble classifiers in a comprehensive experimental environment. Our experiments show that GOOWE provides improved reactions to different types of concept drift compared to our baselines. The statistical tests indicate a significant improvement in accuracy, with conservative time and memory requirements.