Identifying highly relevant entries in datasets: a relevance-based classification

DOI10.1007/S00357-025-09513-6MaRDI QIDQ6889697zbMATH OpenFDO

Authors Fernando Delbianco, Fernando Tohmé

Publication date 4 December 2025

Published in Journal of Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00357-025-09513-6

zbMATH Keywords

synthetic dataShapleyconformal predictionindividualized inference

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites work

• A multi-resolution theory for approximating infinite-\(p\)-zero-\(n\): transitional inference, individualized predictions, and a world without bias-variance tradeoff
• Architectures engender crises: the emergence of power laws in social networks
• Beyond subjective and objective in statistics
• Confidence distribution, the frequentist distribution estimator of a parameter: a review
• Do prior information on performance of individual classifiers for fusion of probabilistic classifier outputs matter?
• Encyclopedia of distances
• Estimating Individual Treatment Effect in Observational Data Using Random Forest Methods
• Explainable deep learning: a field guide for the uninitiated
• Explaining neural scaling laws
• High-dimensional clustering via random projections
• Individualized Group Learning
• Judicious judgment meets unsettling updating: dilation, sure loss and Simpson's paradox
• Model Selection and the Principle of Minimum Description Length
• Sparse classification: a scalable discrete optimization perspective
• Statistical paradises and paradoxes in big data. I: Law of large populations, big data paradox, and the 2016 US presidential election
• The Shapley value for cooperative games under precedence constraints

This page was built for publication: Identifying highly relevant entries in datasets: a relevance-based classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889697)