Hakan Ferhatosmanoglu

Hakan Ferhatosmanoglu

Auto-generated profile, based on publicly available information

Hakan Ferhatosmanoglu

University of Warwick

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
11 July 2018 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
FBFuat Basik
Fuat Basik
BGBugra Gedik
Bugra Gedik
HFHakan Ferhatosmanoglu
Hakan Ferhatosmanoglu
KWKun-Lung Wu
Kun-Lung Wu
Faster and more cost-efficient, crowdsourced delivery is needed to meet the growing customer demands of many industries. In this work, we introduce a new crowdsourced delivery platform that takes fairness towards workers into consideration, while maximizing the task completion ratio. Since redundant assignments are not possible in delivery tasks, we first introduce a 2-phase assignment model that increases the reliability of a worker to complete a given task. To realize the effectiveness of our model in practice, we present both offline and online versions of our proposed algorithm called F-Aware. Given a task-to-worker bipartite graph, F-Aware assigns each task to a worker that maximizes fairness, while allocating tasks to use worker capacities as much as possible. We present an evaluation of our algorithms with respect to running time, task completion ratio, as well as fairness and assignment ratio. Experiments show that F-Aware runs around $10^7\times$ faster than the TAR-optimal solution and assigns 96.9% of the tasks that can be assigned by it. Moreover, it is shown that, F-Aware is able to provide a much fair distribution of tasks to workers than the best competitor algorithm.

12 April 2017 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
EYEmre Yilmaz
Emre Yilmaz
HFHakan Ferhatosmanoglu
Hakan Ferhatosmanoglu
EAErman Ayday
Erman Ayday
RARemzi Can Aksoy
Remzi Can Aksoy
Computer Engineering Department, Bilkent University, Ankara, Turkey.(email:emre.yilmaz@cs.bilkent.edu.tr)

18 March 2020 in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
Verified
Journal Article
Open access
MLMan Luo
Man Luo
BDBowen Du
Bowen Du
KKKonstantin Klemmer
Konstantin Klemmer
HZHongming Zhu
Hongming Zhu
HFHakan Ferhatosmanoglu
Hakan Ferhatosmanoglu
HWHongkai Wen
Hongkai Wen
The future of urban mobility is expected to be shared and electric. It is not only a more sustainable paradigm that can reduce emissions, but can also bring societal benefits by offering a more affordable on-demand mobility option to the general public. Many car sharing service providers as well as automobile manufacturers are entering the competition by expanding both their EV fleets and renting/returning station networks, aiming to seize a share of the market and to bring car sharing to the zero emissions level. During their fast expansion, one determinant for success is the ability of predicting the demand of stations as the entire system is growing continuously. There are several challenges in this demand prediction problem: First, unlike most of the existing work which predicts demand only for static systems or at few stages of expansion, in the real world we often need to predict the demand as or even before stations are being deployed or closed, to provide information and decision support. Second, for the new stations to be deployed, there is no historical data available to help the prediction of their demand. Finally, the impact of deploying/closing stations on the other stations in the system can be complex. To address these challenges, we formulate the demand prediction problem in the context of fast expanding electric vehicle sharing systems, and propose a data-driven demand prediction approach which aims to model the expansion dynamics directly from the data. We use a local temporal encoding process to handle the historical data for each existing station, and a dynamic spatial encoding process to take correlations between stations into account with Graph Convolutional Neural Networks (GCN). The encoded features are fed to a multi-scale predictor, which forecasts both the long-term expected demand of the stations and their instant demand in the near future. We evaluate the proposed approach with real-world data collected from a major EV sharing platform for one year. Experimental results demonstrate that our approach significantly outperforms the state of the art, showing up to three-fold performance gain in predicting demand for the expanding EV sharing systems.

12 April 2023 in ACM Transactions on Spatial Algorithms and Systems
Verified
Journal Article
Open access
AHAparajita Haldar
Aparajita Haldar
SWShuang Wang
Shuang Wang
GDGunduz Vehbi Demirci
Gunduz Vehbi Demirci
JOJoe Oakley
Joe Oakley
HFHakan Ferhatosmanoglu
Hakan Ferhatosmanoglu
Current approaches for modeling propagation in networks (e.g., of diseases, computer viruses, rumors) cannot adequately capture temporal properties such as order/duration of evolving connections or dynamic likelihoods of propagation along connections. Temporal models on evolving networks are crucial in applications that need to analyze dynamic spread. For example, a disease spreading virus has varying transmissibility based on interactions between individuals occurring with different frequency, proximity, and venue population density. Similarly, propagation of information having a limited active period, such as rumors, depends on the temporal dynamics of social interactions. To capture such behaviors, we first develop the Temporal Independent Cascade (T-IC) model with a spread function that efficiently utilizes a hypergraph-based sampling strategy and dynamic propagation probabilities. We prove this function to be submodular, with guarantees of approximation quality. This enables scalable analysis on highly granular temporal networks where other models struggle, such as when the spread across connections exhibits arbitrary temporally evolving patterns. We then introduce the notion of “reverse spread” using the proposed T-IC processes, and develop novel solutions to identify both sentinel/detector nodes and highly susceptible nodes. Extensive analysis on real-world datasets shows that the proposed approach significantly outperforms the alternatives in modeling both if and how spread occurs, by considering evolving network topology alongside granular contact/interaction information. Our approach has numerous applications, such as virus/rumor/influence tracking. Utilizing T-IC, we explore vital challenges of monitoring the impact of various intervention strategies over real spatio-temporal contact networks where we show our approach to be highly effective.

1 October 2013 in Proceedings of the VLDB Endowment
Verified
Journal Article
Open access
BEBahaeddin Eravci
Bahaeddin Eravci
HFHakan Ferhatosmanoglu
Hakan Ferhatosmanoglu
We propose a diversity based relevance feedback approach for time series data to improve the accuracy of search results. We first develop the concept of relevance feedback for time series based on dual-tree complex wavelet (CWT) and SAX based approaches. We aim to enhance the search quality by incorporating diversity in the results presented to the user for feedback. We then propose a method which utilizes the representation type as part of the feedback, as opposed to a human choosing based on a preprocessing or training phase. The proposed methods utilize a weighting to handle the relevance feedback of important properties for both single and multiple representation cases. Our experiments on a large variety of time series data sets show that the proposed diversity based relevance feedback improves the retrieval performance. Results confirm that representation feedback incorporates item diversity implicitly and achieves good performance even when using simple nearest neighbor as the retrieval method. To the best of our knowledge, this is the first study on diversification of time series search to improve retrieval accuracy and representation feedback.

21 October 2023
Verified
Conference Paper
Open access
SWShuang Wang
Shuang Wang
BEBahaeddin Eravci
Bahaeddin Eravci
RGRustam Guliyev
Rustam Guliyev
HFHakan Ferhatosmanoglu
Hakan Ferhatosmanoglu
Graph Neural Network (GNN) training and inference involve significant challenges of scalability with respect to both model sizes and number of layers, resulting in degradation of efficiency and accuracy for large and deep GNNs. We present an end-to-end solution that aims to address these challenges for efficient GNNs in resource constrained environments while avoiding the oversmoothing problem in deep GNNs. We introduce a quantization based approach for all stages of GNNs, from message passing in training to node classification, compressing the model and enabling efficient processing. The proposed GNN quantizer learns quantization ranges and reduces the model size with comparable accuracy even under low-bit quantization. To scale with the number of layers, we devise a message propagation mechanism in training that controls layer-wise changes of similarities between neighboring nodes. This objective is incorporated into a Lagrangian function with constraints and a differential multiplier method is utilized to iteratively find optimal embeddings. This mitigates oversmoothing and suppresses the quantization error to a bound. Significant improvements are demonstrated over state-of-the-art quantization methods and deep GNN approaches in both full-precision and quantized models. The proposed quantizer demonstrates superior performance in INT2 configurations across all stages of GNN, achieving a notable level of accuracy. In contrast, existing quantization approaches fail to generate satisfactory accuracy levels. Finally, the inference with INT2 and INT4 representations exhibits a speedup of 5.11 × and 4.70 × compared to full precision counterparts, respectively.