Ramakrishnan Srikant

Last updated
Ramakrishnan Srikant
Ramakrishnan Srikant.jpg
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.rsrikant.com

Ramakrishnan Srikant is a Google Fellow at Google.

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]

Related Research Articles

<span class="mw-page-title-main">Association rule learning</span> Method for discovering interesting relations between variables in databases

Association rule learning is a rule-based machine learning method for discovering interesting relations between variables in large databases. It is intended to identify strong rules discovered in databases using some measures of interestingness. In any given transaction with a variety of items, association rules are meant to discover the rules that determine how or why certain items are connected.

Apriori is an algorithm for frequent item set mining and association rule learning over relational databases. It proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as those item sets appear sufficiently often in the database. The frequent item sets determined by Apriori can be used to determine association rules which highlight general trends in the database: this has applications in domains such as market basket analysis.

<span class="mw-page-title-main">Héctor García-Molina</span> Mexican computer scientist (1954-2019)

Héctor García-Molina was a Mexican-American computer scientist and Professor in the Departments of Computer Science and Electrical Engineering at Stanford University. He was the advisor to Google co-founder Sergey Brin from 1993 to 1997 when Brin was a computer science student at Stanford.

SIGKDD, representing the Association for Computing Machinery's (ACM) Special Interest Group (SIG) on Knowledge Discovery and Data Mining, hosts an influential annual conference.

Jiawei Han is a Chinese-American computer scientist and writer. He currently holds the position of Michael Aiken Chair Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign. His research focuses on data mining, text mining, database systems, information networks, data mining from spatiotemporal data, Web data, and social/information network data.

<span class="mw-page-title-main">Tomasz Imieliński</span> Polish-American computer scientist (born 1954)

Tomasz Imieliński is a Polish-American computer scientist, most known in the areas of data mining, mobile computing, data extraction, and search engine technology. He is currently a professor of computer science at Rutgers University in New Jersey, United States.

Hans-Peter Kriegel is a German computer scientist and professor at the Ludwig Maximilian University of Munich and leading the Database Systems Group in the Department of Computer Science. He was previously professor at the University of Würzburg and the University of Bremen after habilitation at the Technical University of Dortmund and doctorate from Karlsruhe Institute of Technology.

<span class="mw-page-title-main">Foster Provost</span>

Foster Provost is an American computer scientist, information systems researcher, and Professor of Data Science and Information Systems and Ira Rennert Professor of Entrepreneurship at New York University's Stern School of Business. He is also the Director for the Data Science and AI Initiative at Stern's Fubon Center for Technology, Business and Innovation. Professor Provost has a Bachelor of Science from Duquesne University in physics and mathematics and a Master of Science and Ph.D. in computer science from the University of Pittsburgh.

Rakesh Agrawal is a computer scientist who until recently was a Technical Fellow at the Microsoft Search Labs. Rakesh is well known for developing fundamental data mining concepts and technologies and pioneering key concepts in data privacy, including Hippocratic Database, Sovereign Information Sharing, and Privacy-Preserving Data Mining. IBM's commercial data mining product, Intelligent Miner, grew out of his work. His research has been incorporated into other IBM products, including DB2 Mining Extender, DB2 OLAP Server and WebSphere Commerce Server, and has influenced several other commercial and academic products, prototypes and applications. His other technical contributions include Polyglot object-oriented type system, Alert active database system, Ode, Alpha, Nest distributed system, transaction management, and database machines.

<span class="mw-page-title-main">Usama Fayyad</span> American computer scientist

Usama M. Fayyad is an American-Jordanian data scientist and co-founder of KDD conferences and ACM SIGKDD association for Knowledge Discovery and Data Mining. He is a speaker on Business Analytics, Data Mining, Data Science, and Big Data. He recently left his role as the Chief Data Officer at Barclays Bank.

Philip S. Yu is an American computer scientist and professor of information technology at the University of Illinois at Chicago. He is a prolific author, holds over 300 patents, and is known for his work in the field of data mining.

<span class="mw-page-title-main">Martin L. Kersten</span> Dutch computer scientist (born 1953)

Martin L. Kersten was a computer scientist with research focus on database architectures, query optimization and their use in scientific databases. He was an architect of the MonetDB system, an open-source column store for data warehouses, online analytical processing (OLAP) and geographic information systems (GIS). He has been (co-) founder of several successful spin-offs of the Centrum Wiskunde & Informatica (CWI).

<span class="mw-page-title-main">Gregory Piatetsky-Shapiro</span> American computer scientist

Gregory I. Piatetsky-Shapiro is a data scientist and the co-founder of the KDD conferences, and co-founder and past chair of the Association for Computing Machinery SIGKDD group for Knowledge Discovery, Data Mining and Data Science. He is the founder and president of KDnuggets, a discussion and learning website for Business Analytics, Data Mining and Data Science.

Discovering communities in a network, known as community detection/discovery, is a fundamental problem in network science, which attracted much attention in the past several decades. In recent years, with the tremendous studies on big data, another related but different problem, called community search, which aims to find the most likely community that contains the query node, has attracted great attention from both academic and industry areas. It is a query-dependent variant of the community detection problem. A detailed survey of community search can be found at ref., which reviews all the recent studies

Arthur Zimek is a professor in data mining, data science and machine learning at the University of Southern Denmark in Odense, Denmark.

An associative classifier (AC) is a kind of supervised learning model that uses association rules to assign a target value. The term associative classification was coined by Bing Liu et al., in which the authors defined a model made of rules "whose right-hand side are restricted to the classification class attribute".

Frequent pattern discovery is part of knowledge discovery in databases, Massive Online Analysis, and data mining; it describes the task of finding the most frequent and relevant patterns in large datasets. The concept was first introduced for mining transaction databases. Frequent patterns are defined as subsets that appear in a data set with frequency no less than a user-specified or auto-determined threshold.

<span class="mw-page-title-main">Gautam Das (computer scientist)</span> Indian computer scientist

Gautam Das is a computer scientist in the field of databases research. He is an ACM Fellow and IEEE Fellow.

<span class="mw-page-title-main">Hui Xiong</span> Chinese data scientist

Hui Xiong is a data scientist. He is a distinguished professor at Rutgers University and a distinguished guest professor at the University of Science and Technology of China (USTC).

Volker Markl is a German computer scientist and database systems researcher.

References

  1. Ramakrishnan Srikant ACM Fellows 2014
  2. Fast algorithms for mining association rules
  3. "Google Scholar".
  4. "VLDB 10 years Awards".
  5. Mining Sequential Patterns
  6. "ICDE Influential Paper Awards".
  7. Order-Preserving Encryption for Numeric Data
  8. "2014 SIGMOD Test of Time Award – SIGMOD Website".
  9. "Ramakrishnan Srikant".
  10. "SIGKDD Innovation Award | Sig KDD". www.kdd.org. Archived from the original on 2012-05-26.
  11. Ramakrishnan Srikant ACM Fellows 2014