Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sharat Chikkerur

dblp:84/5368 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Biometric security · 70% Privacy and data protection · 30%
Artificial intelligence
1 paper
Learning theory · 77% Efficient and distributed learning · 23%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
online learning
0.212013
Ad click prediction: a view from the trenches · KDD 2013
Recommender systems
click-through rate prediction
0.212013
Ad click prediction: a view from the trenches · KDD 2013
Privacy and data protection
biometric privacy
0.112007
Generating Cancelable Fingerprint Templates · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Biometric security › biometric template protection
cancelable biometrics
0.112007
Generating Cancelable Fingerprint Templates · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Biometric security › biometric template protection
fingerprint template protection
0.112007
Generating Cancelable Fingerprint Templates · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Machine learning › Efficient and distributed learning
large-scale learning
0.012013
Ad click prediction: a view from the trenches · KDD 2013
Biometric security
biometric authentication
0.012007
Generating Cancelable Fingerprint Templates · IEEE Trans. Pattern Anal. Mach. Intell. 2007

Methods — techniques the papers use, named apart from their topics

per-coordinate learning rates · 0.3FTRL-proximal · 0.3surface folding · 0.1polar transformation · 0.1minutiae transformation · 0.1cartesian transformation · 0.1
YearPublicationVenuePosition
2013 Ad click prediction: a view from the trenches
abstract
Predicting ad click-through rates (CTR) is a massive-scale learning problem that is central to the multi-billion dollar online advertising industry. We present a selection of case studies and topics drawn from recent experiments in the setting of a deployed CTR prediction system. These include improvements in the context of traditional supervised learning based on an FTRL-Proximal online learning algorithm (which has excellent sparsity and convergence properties) and the use of per-coordinate learning rates.
H. Brendan McMahan, Gary Holt, D. Sculley, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, Sharat Chikkerur, Martin Wattenberg, Arnar Mar Hrafnkelsson, Tom Boulos, Jeremy Kubica
KDD11
2007 Generating Cancelable Fingerprint Templates
abstract
Biometrics-based authentication systems offer obvious usability advantages over traditional password and token-based authentication schemes. However, biometrics raises several privacy concerns. A biometric is permanently associated with a user and cannot be changed. Hence, if a biometric identifier is compromised, it is lost forever and possibly for every application where the biometric is used. Moreover, if the same biometric is used in multiple applications, a user can potentially be tracked from one application to the next by cross-matching biometric databases. In this paper, we demonstrate several methods to generate multiple cancelable identifiers from fingerprint images to overcome these problems. In essence, a user can be given as many biometric identifiers as needed by issuing a new transformation "key." The identifiers can be cancelled and replaced when compromised. We empirically compare the performance of several algorithms such as Cartesian, polar, and surface folding transformations of the minutiae positions. It is demonstrated through multiple experiments that we can achieve revocability and prevent cross-matching of biometric databases. It is also shown that the transforms are noninvertible by demonstrating that it is computationally as hard to recover the original biometric identifier from a transformed version as by randomly guessing. Based on these empirical results and a theoretical analysis we conclude that feature-level cancelable biometric construction is practicable in large biometric deployments.
Nalini K. Ratha, Sharat Chikkerur, Jonathan H. Connell, Ruud M. Bolle
IEEE Trans. Pattern Anal. Mach. Intell.2
2007 Fingerprint enhancement using STFT analysis
Sharat Chikkerur, Alexander N. Cartwright, Venu Govindaraju
Pattern Recognit.1