The Set Cover Problem is a research issue in computer science with a lot of applications e.g. in machine learning, data mining and information retrieval. It is about selecting as few sets as possible from a collection that cover some universe. The aim of this project is to compare two approaches - a deterministic one and a statistical - and to rate them by concerns of coverage rate and computation time.
-
Notifications
You must be signed in to change notification settings - Fork 0
dramsauer/Text-Coverage-Problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Text Set Cover Problem - Statistical and Deterministic approaches in comparison with simmulated-annealing and greedy algorithms.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published