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 11 of 11 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. Efficiently mining frequent itemsets from very large databases

    … computation have been implemented using a prefix-tree structure, known as a FP-tree, for storing compressed frequency information. Numerous experimental results have demonstrated that these algorithms perform extremely well. In this thesis we present a novel FP-array technique that greatly reduces …

    concordia Download PDF for Efficiently mining frequent itemsets from very large databases (opens in a new tab)

  3. Daugiamačių sekų šablonų analizė /

    … an algorithm, that is capable of doing that. FP-Tree, that is used to store critical (for example, often repeated) data, was described. FP-Growth algorithm, that can analyze FP-Tree structure and give frequent pattern set as a result, was presented. MD-PS-FPG algorithm – a combination of …

    vilnius Repository record for Daugiamačių sekų šablonų analizė / (opens in a new tab)

  4. Clustering Spam Emails Using Hadoop and FP-Trees

    … al., revolves around using a data model called FP-Tree. We have implemented it in a practical system. We also made the algorithm harness the storage and processing capabilities of Hadoop, a distributed computing framework. The algorithm was also improved to produce less but more dissimilar …

    carleton Repository record for Clustering Spam Emails Using Hadoop and FP-Trees (opens in a new tab)

  5. Algorithms for multi-level frequent pattern minning

    … by data mining, frequent pattern mining (FPM) has become one of the most popular research areas. Methods such as Apriori and FP-growth have been shown to work efficiently in order to discover useful association rules. However, these methods are usually restricted to a single concept level. …

    concordia Download PDF for Algorithms for multi-level frequent pattern minning (opens in a new tab)

  6. 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 Download PDF for A new strategy for case-based reasoning retrieval using classification based on association (opens in a new tab)

  7. Novel Techniques for Efficient and Effective Subgroup Discovery

    … concept, a generic extension of the well-known FP-tree data structure is introduced. The modified data structure stores intermediate condensed data representations, which depend on the chosen model class, in the nodes of the trees. This allows the application for many popular model classes. …

    wurz-thes Repository record for Novel Techniques for Efficient and Effective Subgroup Discovery (opens in a new tab)

  8. 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) Download PDF for A study of novice programmer performance and programming pedagogy. (opens in a new tab)

  9. Dolování asociačních pravidel

    … AprioriItemSet a metoda s využitím FP-stromu. Testování probíhalo nad různými objemy dat a s různými hodnotami minimální podpory a spolehlivosti. Aplikace je implementována v objektově orientovaném jazyce C# a jako zdroj dat slouží relační databáze na MS SQL Server 2008.

    brno-tech Repository record for Dolování asociačních pravidel (opens in a new tab)

  10. Získávání znalostí z datových skladů

    … na hledání frekventovaných množin jsou Apriori a FP-strom. Systém umožňuje variantní nastavení parametrů dolování a byly provedeny ověřovací výkonnostní testy. Z pohledu podpory hledání asociačních pravidel se výsledná aplikace jeví robustnější než existující porovnávané systémy SAS a Oracle Data …

    brno-tech Repository record for Získávání znalostí z datových skladů (opens in a new tab)

  11. Získávání frekventovaných vzorů z proudu dat

    … práce popisuje dva algoritmy: Lossy Counting a FP-stream. Součástí je také efektivní implementace těchto algoritmů v jazyce C# a jejich porovnání na základě měření.

    brno-tech Repository record for Získávání frekventovaných vzorů z proudu dat (opens in a new tab)