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 20 of 32 for “"Frequent itemsets"”.

  1. Mining frequent itemsets using advanced partition approach /

    … rule mining algorithm which generates the frequent itemsets in a single pass over the database is implemented. The algorithm mainly uses two approaches for association rule mining over data stored in multiple relations in one or more databases: The Partition approach, where the data is …

    ttu Repository record for Mining frequent itemsets using advanced partition approach / (opens in a new tab)

  2. Text Categorization Based on Apriori Algorithm's Frequent Itemsets

    Automatic Text categorization is the task of assigning an electronic document to one or more categories, based on its contents. There are many known techniques to efficiently solve categorization problems. Typically these techniques fall into two distinct methodologies which are either logic based …

    unlv Repository record for Text Categorization Based on Apriori Algorithm's Frequent Itemsets (opens in a new tab) Download PDF for Text Categorization Based on Apriori Algorithm's Frequent Itemsets (opens in a new tab)

  3. Taxonomy-Based Pruning in Generalized Frequent Itemsets Mining

    … important. Data mining includes two main parts: frequent itemsets mining and association rules mining. And frequent itemsets mining plays an essential role between them. Our thesis is focused on frequent itemsets mining. Previous studies on frequent itemsets mining is at single or multiple …

    concordia Download PDF for Taxonomy-Based Pruning in Generalized Frequent Itemsets Mining (opens in a new tab)

  4. Efficiently mining frequent itemsets from very large databases

    Efficient algorithms for mining frequent itemsets are crucial for mining association rules and for other data mining tasks. Methods for mining frequent itemsets and for iceberg data cube computation have been implemented using a prefix-tree structure, known as a FP-tree, for storing compressed …

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

  5. Mining frequent itemsets from uncertain data: extensions to constrained mining and stream mining

    Most studies on frequent itemset mining focus on mining precise data. However, there are situations in which the data are uncertain. This leads to the mining of uncertain data. There are also situations in which users are only interested in frequent itemsets that satisfy user-specified aggregate …

    manitoba Repository record for Mining frequent itemsets from uncertain data: extensions to constrained mining and stream mining (opens in a new tab)

  6. Near closed frequent itemsets to accelerate the generation of association rules in a data stream environment

    … built using various techniques such as closed frequent itemsets, tree data structures, itemsets pruning, and statistical sampling. We have developed Near Closed Nodes algorithms, which can be applied to algorithms for mining association rules that utilised closed itemsets structure. In this …

    auckland-tech Repository record for Near closed frequent itemsets to accelerate the generation of association rules in a data stream environment (opens in a new tab)

  7. Using and extending itemsets in data mining : query approximation, dense itemsets, and tiles

    Frequent itemsets are one of the best known concepts in data mining, and there is active research in itemset mining algorithms. An itemset is frequent in a database if its items co-occur in sufficiently many records. This thesis addresses two questions related to frequent itemsets. The first …

    aalto Repository record for Using and extending itemsets in data mining : query approximation, dense itemsets, and tiles (opens in a new tab)

  8. Scaling data mining activities on very large datasets

    … with specific emphasis on association rule and frequent itemset mining. In particular, it proposes a scalable itemset mining approach relying on (i) a persistent (disk-based) representation of the transactional data, (ii) ad-hoc data retrieval techniques, and (iii)~strategies for the integration …

    poli-torino Repository record for Scaling data mining activities on very large datasets (opens in a new tab)

  9. Efficient mining and maintenance of association rules in large datasets

    … discover meaningful patterns and rules. Mining frequent itemsets plays an essential role in many data mining tasks, which attempts to find interesting associations or correlations among a large set of data items. Efficient discovery of frequent large itemsets and its dual problem of mining …

    concordia Download PDF for Efficient mining and maintenance of association rules in large datasets (opens in a new tab)

  10. A Sampling-Based Framework for Parallel Mining Frequent Patterns

    We implemented parallel algorithms for mining frequent itemsets, sequential patterns and closed-sequential patterns following our framework. A comprehensive performance study has been conducted in our experiments on both synthetic and real-world datasets. The experimental results have shown that …

    uiuc Repository record for A Sampling-Based Framework for Parallel Mining Frequent Patterns (opens in a new tab)

  11. Extending data mining techniques for frequent pattern discovery: Trees, low-entropy sets, and crossmining

    The idea of frequent pattern discovery is to find frequently occurring events in large databases. Such data mining techniques can be useful in various domains. For instance, in recommendation and e-commerce systems frequently occurring product purchase combinations are essential in user preference …

    aalto Repository record for Extending data mining techniques for frequent pattern discovery: Trees, low-entropy sets, and crossmining (opens in a new tab)

  12. Mining Connected Frequent Boolean Expressions

    In this paper, we are finding Connected Frequent Boolean Expressions from cancer dataset [14] and protein protein interaction network [14] to discover group of dysregulated genes. Frequent Itemset Mining is a process of finding different sets of items that occur together frequently in a set of …

    ndsu Repository record for Mining Connected Frequent Boolean Expressions (opens in a new tab)

  13. Frequent Itemset Mining with tidyclust in R

    … ECLAT algorithms into tidyclust, with a focus on frequent itemset mining. Unlike traditional clustering models, frequent itemsets produce groupings of column variables, rather than cluster labels or partitions of observations. To address this, a novel clustering approach is proposed: items …

    calpoly Repository record for Frequent Itemset Mining with tidyclust in R (opens in a new tab)

  14. Mining Time-Changing Data Streams

    … one of the most popular stream mining tasks, frequent itemsets mining, is also presented in this thesis. All the proposed techniques are implemented and empirically studied. Experimental results show that the proposed techniques can achieve promising performance for detecting changes and …

    waterloo Repository record for Mining Time-Changing Data Streams (opens in a new tab)

  15. Distributed association rule mining using an in-memory cluster computer framework

    … the past two decades to efficiently identify frequent patterns. In general, these methods fall into two broad categories: Apriori-based and growth-based. Since the number of potential frequent itemsets is exponential with respect to the number of distinct items, the resources required for …

    missouri Repository record for Distributed association rule mining using an in-memory cluster computer framework (opens in a new tab)

  16. Ζητήματα ομοιότητας στην εξόρυξη γνώσης: Μεθοδολογίες και τεχνικές

    … for the most popular pattern types, namely frequent itemsets, decision trees and clusters. More specifically, for the case of frequent itemset patterns, we study how the mining parameters affect the dissimilarity assessment process. For the case of decision tree patterns, we propose a …

    greece Repository record for Ζητήματα ομοιότητας στην εξόρυξη γνώσης: Μεθοδολογίες και τεχνικές (opens in a new tab)

  17. Advances in Mining Binary Data: Itemsets as Summaries

    Mining frequent itemsets is one of the most popular topics in data mining. Itemsets are local patterns, representing frequently cooccurring sets of variables. This thesis studies the use of itemsets to give information about the whole dataset. We show how to use itemsets for answering queries, that …

    aalto Repository record for Advances in Mining Binary Data: Itemsets as Summaries (opens in a new tab)

  18. LARGE-SCALE DATA ANALYSIS OF GENE EXPRESSION MAPS OBTAINED BY VOXELATION

    … show that the detected association rules (frequent itemsets of gene functions) make sense biologically. By inspecting the obtained clusters and the genes having the same frequent itemsets of functions, interesting clues were discovered that provide valuable insight to biological scientists. …

    temple Repository record for LARGE-SCALE DATA ANALYSIS OF GENE EXPRESSION MAPS OBTAINED BY VOXELATION (opens in a new tab)

  19. Document analysis by means of data mining techniques

    … in the subject of transactional data (e.g., frequent itemset mining), to textual documents. Frequent itemset mining is a widely exploratory technique to discover hidden correlations that frequently occur in the source data. Although its application to transactional data is well-established, …

    poli-torino Repository record for Document analysis by means of data mining techniques (opens in a new tab)

  20. Distributed frequent hierarchical pattern mining for robust and efficient large-scale association discovery

    Frequent pattern mining is a classic data mining technique, generally applicable to a wide range of application domains, and a mature area of research. The fundamental challenge arises from the combinatorial nature of frequent itemsets, scaling exponentially with respect to the number of unique …

    missouri Repository record for Distributed frequent hierarchical pattern mining for robust and efficient large-scale association discovery (opens in a new tab)

Page 1 of 2