merge_kernel_ranged_groups

The goal is to merge KRGs.
Let q and u be two different KRGs from the same candidate sequence.
They can be merged into a group qu = q U u as long as they have an
intersection and qu has a frequency greater than or equal to the minimum
frequency defined by the user.

Implementations of the algorithms present article
Generalized Spatial-Time Sequence Miner, original title
(Castro, Antonio; Borges, Heraldo ; Pacitti, Esther ; Porto, Fabio
; Coutinho, Rafaelli ; Ogasawara, Eduardo . Generalização de Mineração de
Sequências Restritas no Espaço e no Tempo. In: XXXVI SBBD -
Simpósio Brasileiro de Banco de Dados, 2021 <doi:10.5753/sbbd.2021.17891>).

Antonio Castro

gstsm

Generalized Spatial-Time Sequence Miner

Cássio Souza

Jorge Rodrigues

Esther Pacitti

Fábio Porto

Florent Masseglia

Rafaelli Coutinho

Eduardo Ogasawara

Federal Center for Technological Education of Rio de Janeiro 

merge_kernel_ranged_groups function

<dl><dt>c</dt>
<dd>candidate</dd>
<dt>gamma</dt>
<dd>minimum temporal frequency</dd></dl>

Arguments

Merge Kernel Ranged Groups — merge_kernel_ranged_groups

<dl>

<dt>c</dt>
<dd>candidate</dd>


<dt>gamma</dt>
<dd>minimum temporal frequency</dd>

</dl>

Merge Kernel Ranged Groups

merge_kernel_ranged_groups: Merge Kernel Ranged Groups

Description

Usage

Value

Arguments