A polynomial time computable metric between points sets

DOI10.1007/PL00013304MaRDI QIDQ5941750zbMATH OpenOpenAlexFDO

Authors Jan Ramon

Publication date 26 August 2001

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00013304

zbMATH Keywords

machine learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Computational complexity on computable metric spaces
• On equivalences, metrics, and polynomial time
• Maintaining the minimal distance of a point set in polylogarithmic time
• Computability of Subsets of Metric Spaces
• An algorithm for computing cutpoints in finite metric spaces
• On complexity of metric spaces
• A polynomial-time computable curve whose interior has a nonrecursive measure
• Computable metrization
• Computational complexity of fixed points and intersection points
• Approximation complexity of metric dimension problem

Cited in

(11)

• Maintaining the minimal distance of a point set in polylogarithmic time
• Distance measures for point sets and their computation
• Relational IBL in classical music
• Distances between sets based on set commonality
• Distance semantics for database repair
• Computational methods for database repair by signed formulae
• Four-layer distance metric and distance-based kernel functions for inductive logic programming
• scientific article; zbMATH DE number 2062646 (Why is no real title available?)
• Learning with Kernels and Logical Representations
• Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
• A polynomial-time computable curve whose interior has a nonrecursive measure

This page was built for publication: A polynomial time computable metric between points sets

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