Search Results for author: Matej Petković

Found 10 papers, 6 papers with code

MLFMF: Data Sets for Machine Learning for Mathematical Formalization

1 code implementation NeurIPS 2023 Andrej Bauer, Matej Petković, Ljupčo Todorovski

The collection includes the largest Lean~4 library Mathlib, and some of the largest Agda libraries: the standard library, the library of univalent mathematics Agda-unimath, and the TypeTopology library.

Benchmarking Recommendation Systems +1

P(Expression|Grammar): Probability of deriving an algebraic expression with a probabilistic context-free grammar

no code implementations1 Dec 2022 Urh Primožič, Ljupčo Todorovski, Matej Petković

We then present specific grammars for generating linear, polynomial, and rational expressions, where algorithms for calculating the probability of a given expression exist.

regression Symbolic Regression

ReliefE: Feature Ranking in High-dimensional Spaces via Manifold Embeddings

1 code implementation23 Jan 2021 Blaž Škrlj, Sašo Džeroski, Nada Lavrač, Matej Petković

The utility of ReliefE for high-dimensional data sets is ensured by its implementation that utilizes sparse matrix algebraic operations.

Multi-Label Classification Vocal Bursts Intensity Prediction

Ensemble- and Distance-Based Feature Ranking for Unsupervised Learning

1 code implementation23 Nov 2020 Matej Petković, Dragi Kocev, Blaž Škrlj, Sašo Džeroski

In this work, we propose two novel (groups of) methods for unsupervised feature ranking and selection.

Clustering

Feature Ranking for Semi-supervised Learning

no code implementations10 Aug 2020 Matej Petković, Sašo Džeroski, Dragi Kocev

This poses a variety of challenges for the existing machine learning methods: coping with dataset with a large number of examples that are described in a high-dimensional space and not all examples have labels provided.

Classification General Classification +3

Fuzzy Jaccard Index: A robust comparison of ordered lists

2 code implementations5 Aug 2020 Matej Petković, Blaž Škrlj, Dragi Kocev, Nikola Simidjievski

In real-life, and in particular high-dimensional domains, where only a small percentage of the whole feature space might be relevant, a robust and confident feature ranking leads to interpretable findings as well as efficient computation and good predictive performance.

BIG-bench Machine Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.