Summary
Ramakrishnan Srikant is a Google Fellow at Google.
Ramakrishnan Srikant | |
|---|---|
 | |
| Alma mater | University of Wisconsin |
| Awards | ACM Fellow (2014) [1] |
| Scientific career | |
| Fields | Computer Science |
| Institutions | IBM, Google |
| Thesis | Fast Algorithms for Mining Association Rules and Sequential Patterns (1996) |
| Doctoral advisor | Rakesh Agrawal Jeffrey Naughton |
| Website | www |
His primary field of research is Data Mining. His 1994 paper, Fast algorithms for mining association rules,[2] co-authored with Rakesh Agrawal has acquired over 27000 citations as per Google Scholar[3] as of July 2014, and is thus one of the most cited papers in the area of Data Mining. It won the VLDB 10-year award in 2004.[4] His 1995 paper, Mining Sequential Patterns,[5] also co-authored with Rakesh Agrawal, was awarded the ICDE Influential Paper Award in 2008,[6] and his 2004 paper, Order-Preserving Encryption for Numeric Data,[7] co-authored with Rakesh Agrawal, Jerry Kiernan and Yirong Xu, won the 2014 SIGMOD Test of Time Award.[8]
Srikant is a winner of the Grace Murray Hopper Award[9] and was also awarded the SIGKDD Innovation Award in the year 2006.[10]
He was elected to Fellow of ACM (2014) for contributions to knowledge discovery and data mining.[11]
References edit
- ^ Ramakrishnan Srikant ACM Fellows 2014
- ^ Fast algorithms for mining association rules
- ^ "Google Scholar".
- ^ "VLDB 10 years Awards".
- ^ Mining Sequential Patterns
- ^ "ICDE Influential Paper Awards".
- ^ Order-Preserving Encryption for Numeric Data
- ^ "2014 SIGMOD Test of Time Award – SIGMOD Website".
- ^ "Ramakrishnan Srikant".
- ^ "SIGKDD Innovation Award | Sig KDD". www.kdd.org. Archived from the original on 2012-05-26.
- ^ Ramakrishnan Srikant ACM Fellows 2014