Outputs (2)

Using Proximity Graph Cut for Fast and Robust Instance-Based Classification in Large Datasets (2021)
Journal Article
Protasov, S., & Khan, A. M. (2021). Using Proximity Graph Cut for Fast and Robust Instance-Based Classification in Large Datasets. Complexity, 2021, Article 2011738. https://doi.org/10.1155/2021/2011738

K-nearest neighbours (kNN) is a very popular instance-based classifier due to its simplicity and good empirical performance. However, large-scale datasets are a big problem for building fast and compact neighbourhood-based classifiers. This work pres... Read More about Using Proximity Graph Cut for Fast and Robust Instance-Based Classification in Large Datasets.

A Novel Contract Theory-Based Incentive Mechanism for Cooperative Task-Offloading in Electrical Vehicular Networks (2021)
Journal Article
Kazmi, S. M., Dang, T. N., Yaqoob, I., Manzoor, A., Hussain, R., Khan, A., Hong, C. S., & Salah, K. (2022). A Novel Contract Theory-Based Incentive Mechanism for Cooperative Task-Offloading in Electrical Vehicular Networks. IEEE Transactions on Intelligent Transportation Systems, 23(7), 8380-8395. https://doi.org/10.1109/TITS.2021.3078913

The proliferation of compute-intensive services in next-generation vehicular networks will impose an unprecedented computation demand to meet stringent latency and resource requirements. Vehicular edge or fog computing has been a widely adopted solut... Read More about A Novel Contract Theory-Based Incentive Mechanism for Cooperative Task-Offloading in Electrical Vehicular Networks.