FCV\(_1\): A new fast greedy covering algorithm

DOI10.1007/BF02946625zbMath0903.68155OpenAlexW2078356048MaRDI QIDQ1130177

Yong Hong, Bin Chen

Publication date: 14 December 1998

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

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

zbMATH Keywords

greedy set-covering algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Cites Work

• Very simple classification rules perform well on most commonly used datasets
• AE1: An extension matrix approximate method for the general covering problem

This page was built for publication: FCV\(_1\): A new fast greedy covering algorithm