Kshiteesh Hegde

San Jose, CA

Previously, I was part of Dr. Malik Magdon-Ismail’s Learning From Data Lab at Rensselaer where I got my PhD. I also have an MS in Computer Science from University of Minnesota.

Some of my research interests include machine learning on networks, object detection and segmentation using deep learning, and learning from tabular data. Feel free to reach out to me to talk about any of these topics or more!

_{^{Disclaimer: All opinions expressed here (and anywhere else) are solely my own.}}

news

Nov 9, 2023	I’ll be part of the technical program committee for IJCNN 2024!
Jul 24, 2023	I’ll be serving as a reviewer and session chair for IEEE MILCOM 2023!
Jun 28, 2023	I’ll be part of the technical program committee for CIKM 2023!

selected publications

The intrinsic scale of networks is small

Malik Magdon-Ismail, and Kshiteesh Hegde

In Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2019
Network Signatures from Image Representation of Adjacency Matrices: Deep/Transfer Learning for Subgraph Classification

Kshiteesh Hegde, Malik Magdon-Ismail, Ram Ramanathan, and 1 more author

2018
Recommendations For Streaming Data

Karthik Subbian, Charu Aggarwal, and Kshiteesh Hegde

In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, 2016

Abs

Recommender systems have become increasingly popular in recent years because of the broader popularity of many web-enabled electronic commerce applications. However, most recommender systems today are designed in the context of an offline setting. The online setting is, however, much more challenging because the existing methods do not work very effectively for very large-scale systems. In many applications, it is desirable to provide real-time recommendations in large-scale scenarios. The main problem in applying streaming algorithms for recommendations is that the in-core storage space for memory-resident operations is quite limited. In this paper, we present a probabilistic neighborhood-based algorithm for performing recommendations in real-time. We present experimental results, which show the effectiveness of our approach in comparison to state-of-the-art methods.