Education:
2013:  PhD Candidate, Computer Science University of Southern California, LA, CA, USA.
 
2009–2013: 
Bachelor of Engineering (Hons) Computer Science Birla Institute of Technology and Science, Pilani Rajasthan, India
Cumulative GPA (10 scale): 8.88
Key Courses: Probability and Statistics, Discrete Structures for Computer Science, Microprocessor Programming and Interfacing, Machine Learning, Theory of Computation, Data Structures and Algorithms, Operating Systems, Digital Electronics and Computer Organization, Computer Networks, Database Systems, Advanced Computer Organization, Programming Language and Compiler Construction, Data Mining, Advanced Data Mining.


2009: 
Senior Secondary School All India Senior School Certificate Examination, AISSCE Kendriya Vidyalaya No. 1 Ishapore (CBSE, New Delhi) Marks Obtained: 94.4 % Courses: Physics, Chemistry, Mathematics, Computer Science, English.


2007: 
Secondary School All India Secondary School Examination, AISSE Kendriya Vidyalaya No. 1 Ishapore (CBSE, New Delhi) Marks Obtained: 94.8 % Courses: Science, Mathematics, English, Social Science, Hindi. 


Academic Achievements and Awards:
 2nd best poster award: S. Ghosh, G. Korlam, A. Srivastava, N. Ganguly. “Effects of a Soft Cutoff on Number of Links in the Twitter Online Social Network” (Poster). Microsoft Research India, TechVista 2011.
 Indian National Mathematical Olympiad 2008 Awardee (Given to around 30 students each year all over India) and attended International Mathematical Olympiad (IMO) Training Camp
 Kishore Vaigyanik Protsahan Yojna (KVPY) Scholar in 20082009. (Fellowship awarded by Department of Science and Technology, Government of India to around 120 students all over India, each year)
 Received Institute Meritcumneed Scholarship from 2009 till date from Birla Institute of Technology and Science, Pilani, India.
Research Experience:
Internships:
Jan 2013 March 2013  Research Assistant, Dalhousie University, Halifax, Canada
 Evaluation of topic extraction (word clustering) algorithms
 Developed a topic extraction algorithm that allows simple user interaction.


May 2012Jul 2012: 
Research Assistant, Dalhousie University, Halifax, Canada Text mining using onemode projection graphs
 Developed an algorithm for graph based clustering of document using thresholding on onemode projection graph that can be used along with other clustering algorithms like modularity optimization.
 Developed a simple graph based topic extraction algorithm and proposed five evaluation metrics to evaluate different aspects of topics/word clusters using the labels associated with documents.
 Developed an algorithm for multilabel classification using neighbors in the onemode projection graph of documents.

May 2011Jul 2011: 
Summer Intern, Central Electronics Engineering Research Institute (CEERI), Pilani, India
 Improvement of the SVM Algorithm for Emotion Recognition: Generalized an earlier work on training linear SVM along with Gabor filters for image classification without information loss to nonlinear SVMs.
Gestalt Grouping in Computer Vision: Studied the application of psychology of Gestalt grouping in Computer Vision. 
 May 2010Jul 2010:  Summer Intern, Indian Institute of Technology, Kharagpur, India Modeling complex networks
 Twitter network: Developed the analytical framework to model the Twitter network by formulating and solving network growth model, and proposed a utility function to assess soft cutoff.
 Study of evolving real life bipartite networks (collaboration networks): Studied the degreedistribution of projection graphs of a bipartite networks with one fixed and one infinitely growing set, by forming an analogy with Polya’s urn scheme.

Papers and Projects at BITS Pilani:
2012 
Improving the efficiency of SVM in emotion recognition using Genetic Algorithm. Done for the fulfillment of the course: 'Study Oriented Project' 
2012 
Modeling the popularity of a search keyword in file sharing systems like DC++. Paper selected for presentation in APOGEE, the technical fest of BITS, Pilani.

2012 
Optimal Information Flow in BITS friendship Networks: Built a network of students from data collected from facebook and applied Complex Network Analysis. Project selected for presentation in APOGEE, the technical fest of BITS, Pilani.

2010 
An Approach to the Lonely Runner Conjecture: Some analysis on the Lonely Runner Conjecture Paper selected for presentation in APOGEE, the technical fest of BITS, Pilani.

  Other relevant activities at BITS Pilani:  Delivered a talk on 'Complex Network Analysis' as the Turing Talk of the semester (Each semester one student from Computer Science is selected to deliver a talk). A review on the talk can be found here.
 Member of MLSIG (Machine Learning Special Interest Group), which aims at promoting and enhancing the knowledge in Machine Learning through discussion of papers, algorithms and their implementation.
Computer skills:
OS 
Linux/Unix, Windows, DOS 
Programming 
C/C++, Matlab, VB, Verilog 
Scripting/Web languages  HTML, Javascript, PHP, Python 
Typography

LaTeX, Microsoft Office, Open Office 

