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 66 for “"frequent patterns"”.

  1. Mining frequent patterns from uncertain data with MapReduce

    Frequent pattern mining from uncertain data allows data analysts to mine frequent patterns from probabilistic databases, within which each item is associated with an existential probability representing the likelihood of the presence of the item in the transaction. When compared with precise data, …

    manitoba Repository record for Mining frequent patterns from uncertain data with MapReduce (opens in a new tab)

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

  3. Discover, recycle and reuse frequent patterns in association rule mining

    … an extended framework of mining and recycling frequent patterns for association rule mining is given. Within the framework, several technical problems are addressed. First, a novel frequent pattern algorithm is proposed to mine microarray datasets with large number of columns and small number …

    nus Repository record for Discover, recycle and reuse frequent patterns in association rule mining (opens in a new tab) Download file for Discover, recycle and reuse frequent patterns in association rule mining (opens in a new tab)

  4. Design of Support Measures for Counting Frequent Patterns in Graphs

    … popularity of graph datasets has grown rapidly. Frequent subgraph mining (FSM) from graphs becomes an important subject in computer science research. In this dissertation, we study single-graph as an effective model to represent information and its related graph mining techniques. In frequent …

    usf Repository record for Design of Support Measures for Counting Frequent Patterns in Graphs (opens in a new tab)

  5. Analyzing frequent patterns in data streams using a dynamic compact stream pattern algorithm

    … online applications, devices and sources. Mining frequent patterns from these streams of data is now an important research topic in the field of data mining and knowledge discovery. The traditional approach of mining data may not be appropriate for a large volume of data stream environment where …

    salford Download PDF for Analyzing frequent patterns in data streams using a dynamic compact stream pattern algorithm (opens in a new tab)

  6. Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs

    … and its related graph mining techniques. In frequent pattern mining in a single-graph setting, there are two main problems: support measure and search scheme. In this paper, we propose a novel framework for constructing support measures that brings together existing minimum-image-based and …

    usf Repository record for Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs (opens in a new tab)

  7. Tree model guided (TMG) enumeration as the basis for mining frequent patterns from XML documents

    … consists of two important problems, namely frequent patterns discovery and rule construction. The former task is considered to be a more challenging problem to solve. Because of its importance and application in a number of data mining tasks, it has become the focus of many studies. A …

    uts Repository record for Tree model guided (TMG) enumeration as the basis for mining frequent patterns from XML documents (opens in a new tab)

  8. New approaches to weighted frequent pattern mining

    Researchers have proposed frequent pattern mining algorithms that are more efficient than previous algorithms and generate fewer but more important patterns. Many techniques such as depth first/breadth first search, use of tree/other data structures, top down/bottom up traversal and …

    tamu Repository record for New approaches to weighted frequent pattern mining (opens in a new tab)

  9. Mining patterns in complex data

    … techniques to analyze such complex records. Frequent pattern mining, a data mining technique, is widely used in data analysis and decision support. However, previous work has focused primarily on mining patterns from categorical data, numerical data, and sequence data. Very little attention …

    nus Repository record for Mining patterns in complex data (opens in a new tab) Download file for Mining patterns in complex data (opens in a new tab)

  10. Algorithms for multi-level frequent pattern minning

    … the functionality provided 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 …

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

  11. Interactive pattern mining of neuroscience data

    … identification and exploration of interesting patterns. The objective of this thesis in text mining area is to find compact but high quality frequent patterns from text documents related to neuroscience field. We try to prove that interactive sampling algorithm is efficient in terms of time …

    iupui Repository record for Interactive pattern mining of neuroscience data (opens in a new tab)

  12. Frequent pattern mining of uncertain data streams

    … To discover useful knowledge in the form of frequent patterns from streams of uncertain data, algorithms have been developed to use the sliding window model for processing and mining data streams. However, for some applications, the landmark window model and the time-fading model are more …

    manitoba Repository record for Frequent pattern mining of uncertain data streams (opens in a new tab)

  13. GENERIC FRAMEWORKS FOR INTERACTIVE PERSONALIZED INTERESTING PATTERN DISCOVERY

    The traditional frequent pattern mining algorithms generate an exponentially large number of patterns of which a substantial portion are not much significant for many data analysis endeavours. Due to this, the discovery of a small number of interesting patterns from the exponentially large number …

    purdue-thes Repository record for GENERIC FRAMEWORKS FOR INTERACTIVE PERSONALIZED INTERESTING PATTERN DISCOVERY (opens in a new tab)

  14. Mining and analysis of real-world graphs

    … analysis can be applied in recognition of frequent patterns among the connected components in a large graph, such as social networks, where visual analysis is almost impossible. Frequent patterns illuminate statistically important subgraphs that are usually small enough to analyze visually. …

    must-thes Repository record for Mining and analysis of real-world graphs (opens in a new tab)

  15. DPLearn: an effective but concise learning framework based on discriminative patterns

    … proposed to improve the accuracy using selected frequent patterns, where many efforts were paid to prune a huge number of non-discriminative frequent patterns. On the other hand, tree-based models have shown strong abilities on many learning tasks since they can easily build high-order …

    uiuc Repository record for DPLearn: an effective but concise learning framework based on discriminative patterns (opens in a new tab)

  16. Frequent Pattern Finding in Integrated Biological Networks

    … into a computational problem which finds frequent patterns in integrated graphs. The whole framework was then successfully implemented as the software package BLUNT, which includes a parallelized version.</p> <p>To evaluate the biological significance of the work, several large datasets …

    utk-theses Repository record for Frequent Pattern Finding in Integrated Biological Networks (opens in a new tab)

  17. Pattern mining under different conditions

    … which usually hides in significant but not frequent patterns. However, existing itemset mining algorithms are designed for very frequent patterns. Furthermore, scientists need to repeat an experiment many times to ensure reproducibility. A series of datasets are generated at once, waiting …

    lmu-germany Repository record for Pattern mining under different conditions (opens in a new tab)

  18. Discovering frequent weak XML patterns

    <P>PROBLEMS TO DISCOVER FREQUENT PATTERNS FROM A LARGE XML REPOSITORY HAVE ATTRACTED INCREASING RESEARCH ATTENTIONS IN RECENT YEARS. SUCH PROBLEMS BELONG TO THE CATEGORY OF UNORDERED AND INDUCED SUBTREE MINING PROBLEM FOR WHICH NO EFFICIENT AND COMPLETE ALGORITHM HAS BEEN PROPOSED SO FAR. IN THIS …

    nus Repository record for Discovering frequent weak XML patterns (opens in a new tab) Download file for Discovering frequent weak XML patterns (opens in a new tab)

  19. Seeing the forest for the trees: tree-based uncertain frequent pattern mining

    Many frequent pattern mining algorithms operate on precise data, where each data point is an exact accounting of a phenomena (e.g., I have exactly two sisters). Alas, reasoning this way is a simplification for many real world observations. Measurements, predictions, environmental factors, human …

    manitoba Repository record for Seeing the forest for the trees: tree-based uncertain frequent pattern mining (opens in a new tab)

  20. Mining Frequent Coherent Patterns from Weighted Graphs

    … networks. Such experiments may find interesting patterns that helps us to understand the unknown relationship within the network. Sometimes the size of the input networks are so big that it needs an efficient algorithm to overcome the time and space complexities. In this paper we modify an …

    ndsu Repository record for Mining Frequent Coherent Patterns from Weighted Graphs (opens in a new tab)

Page 1 of 4