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

Matej Kocián

dblp:245/1827 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0002-0124-9348ORCID · reported

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

Artificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 87% Recommender systems · 13%

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

TopicWeightPapersLastEvidence papers
Information retrieval › ranking › text ranking
document ranking
0.612022
Siamese BERT-Based Model for Web Search Relevance Ranking Evaluated on a New Czech Dataset · AAAI 2022
Information retrieval › retrieval models › neural retrieval
neural ranking model
0.612022
Siamese BERT-Based Model for Web Search Relevance Ranking Evaluated on a New Czech Dataset · AAAI 2022
Information retrieval
retrieval models
0.612022
Siamese BERT-Based Model for Web Search Relevance Ranking Evaluated on a New Czech Dataset · AAAI 2022
Information retrieval
evaluation
0.412019
Vertical Search Blending: A Real-world Counterfactual Dataset · SIGIR 2019
Recommender systems › recommender system evaluation
off-policy evaluation
0.412019
Vertical Search Blending: A Real-world Counterfactual Dataset · SIGIR 2019
Information retrieval › web search
vertical search
0.412019
Vertical Search Blending: A Real-world Counterfactual Dataset · SIGIR 2019

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

transformer · 0.6siamese network · 0.6BERT · 0.6propensity logging · 0.4learning methods · 0.4
YearPublicationVenuePosition
2023 DocILE Benchmark for Document Information Localization and Extraction
Stepán Simsa, Milan Sulc, Michal Uricár, Ahmed Hamdi, Matej Kocián, Matyás Skalický, Jiri Matas, Antoine Doucet, Mickaël Coustaty, Dimosthenis Karatzas
ICDAR (2)6
2022 Siamese BERT-Based Model for Web Search Relevance Ranking Evaluated on a New Czech Dataset
abstract
Web search engines focus on serving highly relevant results within hundreds of milliseconds. Pre-trained language transformer models such as BERT are therefore hard to use in this scenario due to their high computational demands. We present our real-time approach to the document ranking problem leveraging a BERT-based siamese architecture. The model is already deployed in a commercial search engine and it improves production performance by more than 3%. For further research and evaluation, we release DaReCzech, a unique data set of 1.6 million Czech user query-document pairs with manually assigned relevance levels. We also release Small-E-Czech, an Electra-small language model pre-trained on a large Czech corpus. We believe this data will support endeavours both of search relevance and multilingual-focused research communities.
Matej Kocián, Jakub Náplava, Daniel Stancl, Vladimír Kadlec
AAAI1
2019 Using Local Convolutional Units to Defend Against Adversarial Examples
abstract
Deep neural networks are known to be sensitive to adversarial examples - inputs that are created in such a way that they are similar (if viewed by people) to clean inputs, but the neural network has high confidence that they belong to another class. In this paper, we study a new type of neural network unit similar to the convolutional units, but with a more local behavior. The unit is based on the Gaussian radial basis function. We show that if we replace the first convolutional layer in a convolutional network by the new layer (called RBFolutional), we obtain better robustness towards adversarial samples on the MNIST and CIFAR10 datasets, without sacrificing the performance on the clean examples.
Matej Kocián, Martin Pilát
IJCNN1
2019 Vertical Search Blending: A Real-world Counterfactual Dataset
abstract
Blending of search results from several vertical sources became standard among web search engines. Similar scenarios appear in computational advertising, news recommendation, and other interactive systems. As such environments give only partial feedback, the evaluation of new policies conventionally requires expensive online A/B tests. Counterfactual approach is a promising alternative, nevertheless, it requires specific conditions for a valid off-policy evaluation. We release a large-scale, real-world vertical-blending dataset gathered bySeznam.cz web search engine. The dataset contains logged partial feedback with the corresponding propensity and is thus suited for counterfactual evaluation. We provide basic checks for validity and evaluate several learning methods.
Pavel Procházka, Matej Kocián, Jakub Drdák, Jan Vrsovský, Vladimír Kadlec, Jaroslav Kuchar
SIGIR2