Frequent Knot Discovery
| dc.creator | Geerts, Floris | |
| dc.date | 2004-10-16 | |
| dc.date.accessioned | 2026-07-25T16:51:02Z | |
| dc.description | We explore the possibility of applying the framework of frequent pattern mining to a class of continuous objects appearing in nature, namely knots. We introduce the frequent knot mining problem and present a solution. The key observation is that a database consisting of knots can be transformed into a transactional database. This observation is based on the Prime Decomposition Theorem of knots. | |
| dc.description | 7 pages, 2 figures, recreational data mining | |
| dc.identifier | https://arxiv.org/abs/cs/0410038 | |
| dc.identifier | http://arxiv.org/abs/cs/0410038 | |
| dc.identifier.uri | https://dspace.dare.co.zw/handle/123456789/43576 | |
| dc.subject | Databases | |
| dc.title | Frequent Knot Discovery | |
| dc.type | text |