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

Ömer Kirnap

dblp:204/1366 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 61% Deep learning architectures and training · 30% Representation and self-supervised learning · 9%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › retrieval evaluation
incomplete judgments
0.512021
Estimation of Fair Ranking Metrics with Incomplete Judgments · WWW 2021
Information retrieval › retrieval evaluation
ranking evaluation
0.512021
Estimation of Fair Ranking Metrics with Incomplete Judgments · WWW 2021
Machine learning › Deep learning architectures and training
attention mechanism
0.412020
Self-Attentive Hawkes Process · ICML 2020
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › point process › temporal point process
hawkes process
0.412020
Self-Attentive Hawkes Process · ICML 2020
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
point process
0.412020
Self-Attentive Hawkes Process · ICML 2020

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

unbiased estimation · 1.0sampling · 1.0sinusoidal phase shift · 0.4self-attention · 0.4positional encoding · 0.4
YearPublicationVenuePosition
2021 Estimation of Fair Ranking Metrics with Incomplete Judgments
abstract
There is increasing attention to evaluating the fairness of search system ranking decisions. These metrics often consider the membership of items to particular groups, often identified using protected attributes such as gender or ethnicity. To date, these metrics typically assume the availability and completeness of protected attribute labels of items. However, the protected attributes of individuals are rarely present, limiting the application of fair ranking metrics in large scale systems. In order to address this problem, we propose a sampling strategy and estimation technique for four fair ranking metrics. We formulate a robust and unbiased estimator which can operate even with very limited number of labeled items. We evaluate our approach using both simulated and real world data. Our experimental results demonstrate that our method can estimate this family of fair ranking metrics and provides a robust, reliable alternative to exhaustive or random data annotation.
Ömer Kirnap, Fernando Diaz 0001, Asia J. Biega, Michael D. Ekstrand, Ben Carterette, Emine Yilmaz
WWW1
2020 Self-Attentive Hawkes Process
abstract
Capturing the occurrence dynamics is crucial to predicting which type of events will happen next and when. A common method to do this is through Hawkes processes. To enhance their capacity, recurrent neural networks (RNNs) have been incorporated due to RNNs’ successes in processing sequential data such as languages. Recent evidence suggests that self-attention is more competent than RNNs in dealing with languages. However, we are unaware of the effectiveness of self-attention in the context of Hawkes processes. This study aims to fill the gap by designing a self-attentive Hawkes process (SAHP). SAHP employs self-attention to summarise the influence of history events and compute the probability of the next event. One deficit of the conventional self-attention when applied to event sequences is that its positional encoding only considers the order of a sequence ignoring the time intervals between events. To overcome this deficit, we modify its encoding by translating time intervals into phase shifts of sinusoidal functions. Experiments on goodness-of-fit and prediction tasks show the improved capability of SAHP. Furthermore, SAHP is more interpretable than RNN-based counterparts because the learnt attention weights reveal contributions of one event type to the happening of another type. To the best of our knowledge, this is the first work that studies the effectiveness of self-attention in Hawkes processes.
Qiang Zhang 0026, Aldo Lipani, Ömer Kirnap, Emine Yilmaz
ICML3