O. Fatih Kilic
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
O. Fatih Kilic has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Huseyin Ozkan
Sabanci University
1 shared publication - Ibrahim Delibalta
Turk Telekom Communications Services Inc., Istanbul, Turkey
1 shared publication Muhammed O. Sayin
1 shared publication- Nuri Denizcan Vanli
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, USA
1 shared publication Suleyman S. Kozat
1 shared publication- Suleyman Serdar Kozat
Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Trkiye
1 shared publication
Latest Publications
- 1 January 2019
- Published by Elsevier in Signal Processing
- Vol. 154, 148-158
Team-optimal online estimation of dynamic parameters over distributed tree networks
- 1 January 2019
- Published by Elsevier in Signal Processing
- Vol. 154, 148-158
Team-optimal online estimation of dynamic parameters over distributed tree networks
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2290-2294
Adaptive hierarchical space partitioning for online classification
We propose an online algorithm for supervised learning with strong performance guarantees under the empirical zero-one loss. The proposed method adaptively partitions the feature space in a hierarchical manner and generates a powerful finite combination of basic models. This provides algorithm to obtain a strong classification method which enables it to create a linear piecewise classifier model that can work well under highly non-linear complex data. The introduced algorithm also have scalable computational complexity that scales linearly with dimension of the feature space, depth of the partitioning and number of processed data. Through experiments we show that the introduced algorithm outperforms the state-of-the-art ensemble techniques over various well-known machine learning data sets.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2290-2294
Adaptive hierarchical space partitioning for online classification
We propose an online algorithm for supervised learning with strong performance guarantees under the empirical zero-one loss. The proposed method adaptively partitions the feature space in a hierarchical manner and generates a powerful finite combination of basic models. This provides algorithm to obtain a strong classification method which enables it to create a linear piecewise classifier model that can work well under highly non-linear complex data. The introduced algorithm also have scalable computational complexity that scales linearly with dimension of the feature space, depth of the partitioning and number of processed data. Through experiments we show that the introduced algorithm outperforms the state-of-the-art ensemble techniques over various well-known machine learning data sets.