My friends call me Deb
Large Scale Social Media Data Analytics, Machine Learning and Data Mining techniques, Deep Learning, Bayesian Learning, Text Analytics, Indexing techniques, Data Visualization.
Room 2780 WEB building
72 S. Central Campus Drive
School of Computing, University of Utah
Salt Lake City, UT 84112
Master of Technology
Computer Science & Engineering
GPA: 8.67/10.0 (Rank: 3)
Bachelor of Technology (Rank < 10)
Computer Science & Engineering
Advisor: Prof. Feifei Li
University of Utah
Natural Language Processing, Data Mining
University of Utah
Data Platform Team: Exceeds Expectation for year 2014
With the widespread growth of various social network tools and platforms, analyzing and understanding societal response and crowd reaction to important and emerging social issues and events through social media data is increasingly an important problem. However, there are numerous challenges towards realizing this goal effectively and efficiently, due to the unstructured and noisy nature of social media data. The large volume of the underlying data also presents a fundamental challenge. Furthermore, in many application scenarios, it is often interesting, and in some cases critical, to discover patterns and trends based on geographical and/or temporal partitions, and keep track of how they will change overtime. This brings up the interesting problem of spatio-temporal sentiment analysis from large-scale social media data. This paper investigates this problem through a data science project called ``US Election 2016, What Twitter Says’‘. The objective is to discover sentiment on twitter towards either the democratic or the republican party at US county and state levels over any arbitrary temporal intervals, using a large collection of geotagged tweets from a period of 6 months leading up to the US presidential election in 2016. Our results demonstrate that by integrating and developing a combination of machine learning and data management techniques, it is possible to do this at scale with effective outcomes. The results of our project have the potential to be adapted towards solving and influencing other interesting social issues such as building neighborhood happiness and health indicators.
OBJECTIVES: Contextual factors can influence health through exposures to health-promoting and risk-inducing factors. The aim of this study was to (1) build, from geotagged Twitter and Yelp data, a national food environment database and (2) to test associations between state food environment indicators and health outcomes. STUDY DESIGN: This is a cross-sectional study based upon secondary analyses of publicly available data. METHODS: Using Twitter's Streaming Application Programming Interface (API), we collected and processed 4,041,521 food-related, geotagged tweets between April 2015 and March 2016. Using Yelp's Search API, we collected data on 505,554 unique food-related businesses. In linear regression models, we examined associations between food environment characteristics and state-level health outcomes, controlling for state-level differences in age, percent non-Hispanic white, and median household income. RESULTS: A one standard deviation increase in caloric density of food tweets was related to higher all-cause mortality (+46.50 per 100,000), diabetes (+0.75%), obesity (+1.78%), high cholesterol (+1.40%), and fair/poor self-rated health (2.01%). More burger Yelp listings were related to higher prevalence of diabetes (+0.55%), obesity (1.35%), and fair/poor self-rated health (1.12%). More alcohol tweets and Yelp bars and pub listings were related to higher state-level binge drinking and heavy drinking, but lower mortality and lower percent reporting fair/poor self-rated health. Supplemental analyses with county-level social media indicators and county health outcomes resulted in finding similar but slightly attenuated associations compared to those found at the state level. CONCLUSIONS: Social media can be utilized to create indicators of the food environment that are associated with area-level mortality, health behaviors, and chronic conditions.
Grid computing is a high performance computing environment to fulfill large-scale computational demands. It can integrate computational as well as storage resources from different networks and geographically dispersed organizations into a high performance computational & storage platform. It is used to solve complex computational-intensive problems, and also provide solution to storage-intensive applications with connected storage resources. Scheduling of user jobs properly on the heterogeneous resources is an important task in a grid computing environment. The main goal of scheduling is to maximize resource utilization, minimize waiting time of jobs, reduce energy consumption, minimize cost to the user after satisfying constraints of jobs and resources. We can trade off between the required level of quality of service, the deadline and the budget of user. In this paper, we propose a Multi-objective Evolution-based Dynamic Scheduler in Grid. Our scheduler have used Multi-objective optimization technique using Genetic algorithm with pareto front approach to find efficient schedules. It explores the search space vividly to avoid stagnation and generate near optimal solution. We propose that our scheduler provides a better grip on most features of grid from perspective of grid owner as well as user. Dynamic grid environment has forced us to make it a real time dynamic scheduler. A job grouping technique is proposed for grouping fine-grained jobs and for ease of computation. Experimentation on different data sets and on various parameters revealed effectiveness of multi- objective scheduling criteria and extraction of performance from grid resource.
In many applications of similarity searching in databases, a set of similar queries appear more frequently. Since it is rare that a query point with its associated parameters (range or number of nearest neighbors) will repeat exactly, intelligent caching mechanisms are required to efficiently answer such queries. In addition, the performance of non-repeating and non-cached queries should not suffer too much either. In this paper, we propose RCached-tree, belonging to the family of R-trees, that aims to solve this problem. In every internal node of the tree up to a certain level, a portion of the space is reserved for storing popular queries and their solutions. For a new query that is encompassed by a cached query, this enables bypassing the traversal of lower levels of the subtree corresponding to the node as the answers can be obtained directly from the result set of the cached query. The struc- ture adapts itself to varying query patterns; new popular queries replace the old cached ones that are not popular any more. Queries that are not popular as well as insertions, deletions and updates are handled in the same manner as in a general R-tree. Experiments show that the RCached-tree can outperform R-tree and other such structures by a signif- icant margin when the proportion of popular queries is 20% or more by reserving 30-40% of the internal nodes as cache.
Though RFID provides automatic object identification, yet it is vulnerable to various security threats that put consumer and organization privacy at stake. In this work, we have considered some existing security protocols of RFID system and analyzed the possible security threats at each level. We have modified those parts of protocol that have security loopholes and thus finally proposed a modified four-level security model that has the potential to provide fortification against security threats.
Spatio-temporal Sentiment Analysis Project estorm.org analyzed the sentiment of common people on US Election. It gained a lot of media coverage. (2016)
| | | | | | | | | | | and many more..
Building a National Neighborhood Dataset From Geotagged Twitter Data for Indicators of Happiness, Diet, and Physical Activity. JMIR 2016. Amassed a lot of media attention.
| | | | | | | | | |
Ranked 3rd out of 39 M.Tech students of CSE department in Indian of Institute Technology, Kanpur M.Tech (2011-2013)
Secured All India Rank 228 in GATE 2012 among 1.56 lakh participants of Computer Science & Information Technology department. (2011-2012)
Achieved All India Rank of 7 in Indian Space Research Organization (ISRO) recruitment exam. (2011-2012)
Secured All India Rank 223 in GATE 2011 among 1.36 lakh participants of Computer Science & Information Technology department. (2010-2011)
Amongst top 10 student of CSE department in Institute of Engineering Management, Kolkata, and awarded academic excellence for performance in B.Tech (2007-2011)
Acknowledged as the Best Project by the course professor for “Boosting performance of popular queries” which was done as part of CS618 (Indexing and Searching of Databases) course. (2011-2012)
Got 2nd Rank in Project Fair in Bits to Bytes 2008, in Most Economic Autonomous Line Follower Robot and 3rd position in Dzyan IEM Techfest 2008 in Roborally event.
Awarded 2nd prize for academic excellence in school in Class XII
Awarded 1st prize for academic excellence in school in Class XI
Awarded academic excellence certificate in district level for performance in Board Exam