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 56 for “"Itemsets"”.

  1. 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)

  2. Mining frequent itemsets using advanced partition approach /

    … 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 mined in …

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

  3. High Utility Itemsets Identification in Big Data

    … large candidate sets while finding high utility itemsets, the major focus is to reduce the computational time significantly with the introduction of pruning strategies. Another aspect of high utility itemset mining is to compute the large dataset. There are very few algorithms that can handle a …

    unlv Repository record for High Utility Itemsets Identification in Big Data (opens in a new tab) Download PDF for High Utility Itemsets Identification in Big Data (opens in a new tab)

  4. 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)

  5. 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)

  6. Taxonomy-Based Pruning in Generalized Frequent Itemsets Mining

    … 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 concept level, …

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

  7. 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)

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

    … in which users are only interested in frequent itemsets that satisfy user-specified aggregate constraints. This leads to constrained mining of uncertain data. Moreover, floods of uncertain data can be produced in many other situations. This leads to stream mining of uncertain data. In this M.Sc. …

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

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

    … 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 study, we …

    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)

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

    … 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 association …

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

  11. Získávání znalostí z textových dat

    … je založena na množinách položek tzv. "metoda itemsets". Tato metoda rozšiřuje oblast aplikace Apriori algoritmu určeného původně ke zpracování transakčních databází a generování frekventovaných množin položek. Práce se rovněž zabývá možností modifikace vlastního Apriori algoritmu pro potřeby …

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

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

    … types of occurrence structure than with frequent itemsets. The concept can also be easily applied to tree types of pattern. Furthermore, by applying minimum description length in pattern selection for low-entropy sets it is shown experimentally that in most cases the collections of selected …

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

  13. Efficient Relational Feature Engineering

    … tables. Joint distributions are satisfied using itemsets based on our novel Items2Data algorithm. Items2Data can generate syn-thetic boolean datasets with joint distributions by satisfying a set of itemsets. We find useful conditions within the NP-Hard problem where a satisfying dataset can be …

    auckland-ms Repository record for Efficient Relational Feature Engineering (opens in a new tab)

  14. Mining Connected Frequent Boolean Expressions

    … frequently in a set of transactions. These itemsets are called Frequent Itemsets (FBE). Connected FBE (CFBE) are a group of items that not only classify as FBE but they are also connected in a graph/network. The nodes in this graph are the items and the edges between them indicate …

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

  15. Approximate Parallel High Utility Itemset Mining

    High utility itemset mining discovers itemsets whose utility is above a given threshold, where utilities measure the importance of itemsets. In high utility itemset mining, memory and time performance limitations cause scalability issues, when the dataset is very large. In this thesis, the problem …

    york Repository record for Approximate Parallel High Utility Itemset Mining (opens in a new tab)

  16. Knowledge discovery techniques for transactional data model

    … novel and useful ways of extracting clusters and itemsets from transactional data. Transactional Data model is widely used in a variety of applications. In cluster analysis the goal is to find clusters of similar transactions in the data with the collective properties of each cluster being unique. …

    iastate Repository record for Knowledge discovery techniques for transactional data model (opens in a new tab)

  17. Scaling data mining activities on very large datasets

    … To address the manageability of frequent itemsets, a concise disk-based representation, with a set of querying techniques, is proposed. This work has been preliminarly validated in the Semantic Web domain, to identify semantic relationships from textual collections with a semi-automatic …

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

  18. Rare pattern mining from noisy data

    … I introduce the mining of approximately rare itemsets to discover rare patterns with data in the presence of noise. To mine approximately rare itemsets, an ARI-growth algorithm is proposed. Computational results show ARI-growth is an order of magnitude faster than an Apriori approach. Memory …

    manitoba Repository record for Rare pattern mining from noisy data (opens in a new tab)

  19. Strategy and methodology for enterprise data warehouse development. Integrating data mining and social networking techniques for identifying different communities within the data warehouse.

    … tables as items. Then, we mine closed frequent itemsets of tables; these itemsets include tables that are mostly accessed together and hence should be treated as one unit in storage and retrieval for better overall performance. We utilize social network construction and analysis to find …

    bradford Repository record for Strategy and methodology for enterprise data warehouse development. Integrating data mining and social networking techniques for identifying different communities within the data warehouse. (opens in a new tab)

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

    … 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 our …

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

Page 1 of 3