Vinay Setty

Vinay Setty

Auto-generated profile, based on publicly available information

Vinay Setty

University of Stavanger

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 January 2012
Verified
Book Chapter
Open access
PDF file
VSVinay Setty
Vinay Setty
MSMaarten van Steen
Maarten van Steen
RVRoman Vitenberg
Roman Vitenberg
SVSpyros Voulgaris
Spyros Voulgaris
We propose PolderCast, a P2P topic-based Pub/Sub system that is (a) fault-tolerant and robust, (b) scalable w.r.t the number of nodes interested in a topic and number of topics that nodes are interested in, and (c) fast in terms of dissemination latency while (d) attaining a low communication overhead. This combination of properties is provided by an implementation that blends deterministic propagation over maintained rings with probabilistic dissemination following a limited number of random shortcuts. The rings are constructed and maintained using gossiping techniques. The random shortcuts are provided by two distinct peer-sampling services: Cyclon generates purely random links while Vicinity produces interest-induced random links. We analyze PolderCast and survey it in the context of existing approaches. We evaluate PolderCast experimentally using real-world workloads from Twitter and Facebook traces. We use widely renowned Scribe [5] as a baseline in a number of experiments. Robustness with respect to node churn is evaluated through traces from the Skype super-peer network. We show that the experimental results corroborate all of the above properties in settings of up to 10K nodes, 10K topics, and 5K topics per-node.

4 November 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
MKMegha Khosla
Megha Khosla
VSVinay Setty
Vinay Setty
AAAvishek Anand
Avishek Anand
There has been significant progress in unsupervised network representation learning (UNRL) approaches over graphs recently with flexible random-walk approaches, new optimization objectives and deep architectures. However, there is no common ground for systematic comparison of embeddings to understand their behavior for different graphs and tasks. We argue that most of the UNRL approaches either model and exploit neighborhood or what we call context information of a node. These methods largely differ in their definitions and exploitation of context. Consequently, we propose a framework that casts a variety of approaches - random walk based, matrix factorization and deep learning based - into a unified context-based optimization function. We systematically group the methods based on their similarities and differences. We study their differences which we later use to explain their performance differences (on downstream tasks). We conduct a large-scale empirical study considering 9 popular and recent UNRL techniques and 11 real-world datasets with varying structural properties and two common tasks - node classification and link prediction. We find that for non-attributed graphs there is no single method that is a clear winner and that the choice of a suitable method is dictated by certain properties of the embedding methods, task and structural properties of the underlying graph. In addition we also report the common pitfalls in evaluation of UNRL methods and come up with suggestions for experimental design and interpretation of results.

29 June 2013
Verified
Conference Paper
Open access
VSVinay Setty
Vinay Setty
GKGunnar Kreitz
Gunnar Kreitz
RVRoman Vitenberg
Roman Vitenberg
MSMaarten van Steen
Maarten van Steen
GUGuido Urdaneta
Guido Urdaneta
SGStaffan Gimåker
Staffan Gimåker
Spotify is a peer-assisted music streaming service that has gained worldwide popularity. Apart from providing instant access to over 20 million music tracks, Spotify also enhances its users' music experience by providing various features for social interaction. These are realized by a system using the widely-adopted pub/sub paradigm. In this paper we provide an interesting case study of a hybrid pub/sub system designed for real-time as well as offline notifications for Spotify users. We firstly describe a multitude of use cases where pub/sub is applied. Secondly, we study the design of its pub/sub system used for matching, disseminating and persisting billions of publications every day. Finally, we study pub/sub traffic collected from the production system, derive characterizations of the pub/sub workload, and show some interesting findings and trends.

26 September 2019
Verified
Conference Paper
Open access
RMRahul Mishra
Rahul Mishra
VSVinay Setty
Vinay Setty

10 July 2024
Verified
Conference Paper
Open access
VSVinay Setty
Vinay Setty
In this paper, we explore the challenges associated with establishing an end-to-end fact-checking pipeline in a real-world context, covering over 90 languages. Our real-world experimental benchmarks demonstrate that fine-tuning Transformer models specifically for fact-checking tasks, such as claim detection and veracity prediction, provide superior performance over large language models (LLMs) like GPT-4, GPT-3.5-Turbo, and Mistral-7b. However, we illustrate that LLMs excel in generative tasks such as question decomposition for evidence retrieval. Through extensive evaluation, we show the efficacy of fine-tuned models for fact-checking in a multilingual setting and complex claims that include numerical quantities.

11 April 2016
Verified
Conference Paper
Open access
PDF file
EKErdal Kuzey
Erdal Kuzey
VSVinay Setty
Vinay Setty
JSJannik Strötgen
Jannik Strötgen
GWGerhard Weikum
Gerhard Weikum
Temporal expressions (TempEx's for short) are increasingly important in search, question answering, information extraction, and more. Techniques for identifying and normalizing explicit temporal expressions work well, but are not designed for and cannot cope with textual phrases that denote named events, such as \"Clinton's term as secretary of state\". This paper addresses the problem of detecting such temponyms, inferring their temporal scopes, and mapping them to events in a knowledge base if present there. We present methods for this kind of temponym resolution, using an entity- and TempEx-oriented document model and the Yago knowledge base for distant supervision. We develop a family of Integer Linear Programs for jointly inferring temponym mappings to the timeline and knowledge base. This enriches the document representation and also extends the knowledge base by obtaining new alias names for events. Experiments with three different corpora demonstrate the viability of our methods.