FCV₁: A new fast greedy covering algorithm

DOI10.1007/BF02946625MaRDI QIDQ1130177zbMATH OpenOpenAlexFDO

Authors Bin Chen, Yong Hong

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)

Recommendations

• On Partial Covers, Reducts and Decision Rules
• On Partial Covers, Reducts and Decision Rules with Weights
• A New Efficient Heuristic for the Minimum Set Covering Problem
• An O(m n) algorithm for regular set-covering problems
• Improved performance of the greedy algorithm for partial cover

Cites work

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

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

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