Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models

DOI10.1007/s10618-016-0456-zzbMath1416.62541arXiv1606.04278OpenAlexW3125159057WikidataQ60255802 ScholiaQ60255802MaRDI QIDQ1741286

Krzysztof Dembczyński, Willem Waegeman, Bernard De Baets, Michiel Stock

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.04278

zbMATH Keywords

machine learningexact inferencemulti-target predictionprecision at \(K\)top-\(K\) retrieval

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Efficient set-valued prediction in multi-class classification

Cites Work

• On label dependence and loss minimization in multi-label classification
• Combining fuzzy information from multiple systems
• Optimal aggregation algorithms for middleware.
• Efficient regularized least-squares algorithms for conditional ranking on relational data
• Introduction to Information Retrieval
• Multidimensional binary search trees used for associative searching
• Probabilistic Principal Component Analysis
• Learning Theory and Kernel Machines
• The elements of statistical learning. Data mining, inference, and prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact and efficient top-\(K\) inference for multi-target prediction by querying separable linear relational models