Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"FP-tree"”.

  1. FP-tree Based Spatial Co-location Pattern Mining

    … pattern mining paradigm. In particular, a FP-tree based co-location mining framework and an algorithm called FP-CM, for FP-tree based co-location miner, are proposed. It is proved that FP-CM is complete, correct, and only requires a small constant number of database scans. The experimental …

    unt Repository record for FP-tree Based Spatial Co-location Pattern Mining (opens in a new tab)

  2. A new strategy for case-based reasoning retrieval using classification based on association

    … CARs to generate an optimum frequent pattern tree (FP-tree) which holds a val-ue of each node. The possible advantage offered is that more efficient results can be gained, when SBR returns uncertain answers. In addition, CBRAR has been evaluated using two sources of CBR frameworks - Jcolibri …

    salford Repository record for A new strategy for case-based reasoning retrieval using classification based on association (opens in a new tab)

  3. A study of novice programmer performance and programming pedagogy.

    … first sub-study was a novel application of the FP-Tree algorithm to determine if novice programmers demonstrated predictable patterns of behaviour. This was the first study to data mine programming behavioural characteristics rather than the learner’s background information such as age and …

    uwtsd Repository record for A study of novice programmer performance and programming pedagogy. (opens in a new tab)