-
Notifications
You must be signed in to change notification settings - Fork 1
/
index.html
91 lines (83 loc) · 6.95 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><title>Abhinav Mukund Kulkarni</title></head><body>
<h2>Abhinav Mukund Kulkarni</h2>E-mail: abhinav.kulkarni insert "at" sign uci.edu
<h3>About Me</h3>
I am a Masters student in school of <a href="http://www.ics.uci.edu">Information and Computer Science</a> at <a href="http://www.uci.edu">University of California, Irvine</a>.
<br>
My research interests are in the areas bordering on both Computer
Science and Applied Statistics such as Machine Learning and Text Mining.<br><br>
I completed my undergraduate education from <a href="http://www.nitt.edu">National Institute of Technology, Tiruchirapally, India</a> in 2009.
<br>
I worked in the <a href="http://www.microsoft.com/en-in/msidc/OnlineServiceDivision/bing.aspx">Online Services Devision of Microsoft Inc., Hyderabad, India</a>
for a little less than two years before deciding to leave for further
education. Please refer to my resume for my work at Microsoft.<br>
<br>
<h3>Coursework</h3>(Some of the links require valid university login)<br>
<b><u>Fall 2011:</u></b> <a href="https://eee.uci.edu/11f/37900">Intermediate Statistics A</a>,
<a href="http://www.ics.uci.edu/%7Ewelling/teaching/ICS273Afall11/ICS273Afall11.html">Machine Learning</a>,
<a href="http://www.ics.uci.edu/%7Eeppstein/261/">Data Structures</a>
<br>
<b><u>Winter 2012:</u></b> <a href="http://www.ics.uci.edu/%7Edgillen/STAT200B/Statistics_200B.html">Intermediate Statistics B</a>,
<a href="https://eee.uci.edu/12w/37920">Statistical Methodology and Data Analysis II</a>,
<a href="http://www.ics.uci.edu/%7Esmyth/courses/cs274/">Probabilistic Learning</a>,
<a href="http://www.ics.uci.edu/%7Elopes/teaching/cs221W12/index.html">Information Retrieval</a>
<br>
<b><u>Spring 2012:</u></b> <a href="https://eee.uci.edu/12s/37930">Statistical Computing</a>,
<a href="http://sli.ics.uci.edu/Classes/2012S-274b">Graphical Models</a>,
<a href="http://www.ics.uci.edu/%7Ealexv/250A/lectures.htm">Computer Architecture</a><br>
<span style="font-weight: bold; text-decoration: underline;">Fall 2012:</span> <a href="https://grape.ics.uci.edu/wiki/public/wiki/cs222-2012-fall">Principles of Data Management</a>, <a href="https://eee.uci.edu/12f/37920">Statistical Methodology and Data Analysis I</a><br>
<b><u>Winter 2013:</u></b> <a href="https://eee.uci.edu/13w/37925">Bayesian Statistics</a><br>
<br>
<h3>Master's Thesis</h3>
I am currently being advised by <a href="http://www.ics.uci.edu/%7Eihler/">Prof. Alex Ihler</a> for a Master's thesis. We are working on designing efficient machine learning models to evaluate Go boards and predict final territory by using local patterns and couplings between adjacent stones in the Go board.<br>
<br>
Background: According to <a href="http://en.wikipedia.org/wiki/Go_%28game%29"> Wikipedia entry for Go</a>, the game originated in China around 2,500 years back. The end goal of the game is to capture maximum possible territory. Despite its simple rules, Go has thwarted many attempts to automate it because of computational complexity and as a result traditional techniques such as alpha-beta pruning cannot be employed. <a href="http://books.nips.cc/papers/files/nips17/NIPS2004_0747.pdf">Some</a> <a href="http://dl.acm.org/citation.cfm?id=1143954">work</a> <a href="http://users.cecs.anu.edu.au/~ssanner/Papers/crfgo.pdf">has</a> been done to construct machine learning models that learn coupling between adjacent stones and make use of neighbouring terriory of a stone position.
<br>
<h3>Research Work</h3>
<span style="font-weight: bold; text-decoration: underline;">Complexity Evolution of Software Projects:</span> In the summer and Fall of 2012 I worked with <a href="http://www.ics.uci.edu/%7Elopes/">Prof. Crista Lopes</a>
on the problem of analyzing open-source Java projects of varying types
and sizes to understand how they evolved over time (i.e. over multiple
releases). Currently we identify software concerns and aspects as
latent topics using <a href="http://en.wikipedia.org/wiki/Latent_Dirichlet_allocation">LDA</a>
and draw different matrices regarding project complexity using entropies of distributions of topic
and source code files. We were able to identify a general trend in the development of the projects by employing a simple linear regression model. Standard statistical techniques can be used to identify outlying software projects so they can be closely
studied to identify what went different in the management of those projects.
This study is continuation of an earlier work, details about which can
be found in <a href="http://dl.acm.org/citation.cfm?id=1449807">this paper</a>.<br>
<br>
More details about this project and related source code can be found on <a href="https://github.com/abhinavkulkarni/topic-modeling">GitHub</a>.
<h3><a>Projects</a></h3>
<h4><a>HHP Health Prize </a><a href="http://www.heritagehealthprize.com/c/hhp/">(Link)</a></h4>
I, part of a team of three, worked on a <a href="http://www.kaggle.com/">Kaggle</a>
project to identify patients who would be admitted to hospitals given
medical history of previous years. We implemented various
classification and prediction algorithms to get an estimate. The
compition is still on and carries a prize pool of $3 million.
<br>
<h4>PNAS Chemistry Corpus Analysis</h4>
We did analysis of <a href="http://www.pnas.org">PNAS</a>
Chemistry corpus from over two decades. Our hypothesis was that research
in Chemistry, unlike other physical sciences such as Physics and
Mathematics, is conducted in much smaller groups and scope
of collaboration is limited, in most cases, to other people in same
affiilated institutes. We found evidence that suggests our hypothesis.
<br>
<h3>Resume</h3>
<a href="Resume.pdf">PDF</a>
<h3>Follow Me</h3>
You can follow me on LinkedIn, Facebook, Twitter and Quora.
<br>
<br>
<a href="http://www.linkedin.com/pub/abhinav-kulkarni/15/105/980"><img style="border: 0px solid ; width: 63px; height: 60px;" alt="Linkedin Profile" src="linkedin.jpeg"></a> <a href="https://www.facebook.com/abhinav.kulkarni"><img style="border: 0px solid ; width: 58px; height: 52px;" alt="Facebook Profile" src="facebook.jpeg"></a> <a href="http://www.quora.com/Abhinav-M-Kulkarni"><img style="border: 0px solid ; width: 50px; height: 50px;" alt="Quora Profile" src="quora.jpeg"></a> <a href="https://twitter.com/#%21/kulkarniabhinav"><img style="border: 0px solid ; width: 75px; height: 49px;" alt="Twitter Profile" src="twitter.jpeg"></a><br>
<br>
<hr>
<br>
<address>
<a href="http://www.ics.uci.edu/">
Information and Computer Science</a><br>
<a href="http://www.uci.edu/">University of California, Irvine</a><br>
Irvine, CA 92697-3425
</address>
Last modified: 15 Apr 2012
<a href="http://www.seologic.com/webmaster-tools/counters"><img alt="Free Hit Counters" src="http://counter.seologic.com/webmaster-tools/hit-counter?count=0&cs=1&url=http://www.ics.uci.edu/%7Eamkulkar/" border="0"></a>
</body></html>