Consecutive Support: Better Be Close!
| dc.creator | de Graaf, Edgar | |
| dc.creator | de Graaf, Jeannette | |
| dc.creator | Kosters, Walter A. | |
| dc.date | 2006-06-06 | |
| dc.date.accessioned | 2026-07-07T07:13:01Z | |
| dc.date.available | 2026-07-07T07:13:01Z | |
| dc.description | We propose a new measure of support (the number of occur- rences of a pattern), in which instances are more important if they occur with a certain frequency and close after each other in the stream of trans- actions. We will explain this new consecutive support and discuss how patterns can be found faster by pruning the search space, for instance using so-called parent support recalculation. Both consecutiveness and the notion of hypercliques are incorporated into the Eclat algorithm. Synthetic examples show how interesting phenomena can now be discov- ered in the datasets. The new measure can be applied in many areas, ranging from bio-informatics to trade, supermarkets, and even law en- forcement. E.g., in bio-informatics it is important to find patterns con- tained in many individuals, where patterns close together in one chro- mosome are more significant. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0606024 | |
| dc.identifier | http://arxiv.org/abs/cs/0606024 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/112287 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | Databases | |
| dc.title | Consecutive Support: Better Be Close! | |
| dc.type | text |