Results 261 to 270 of about 3,318,937 (295)
Some of the next articles are maybe not open access.
Frequent tree pattern mining: A survey
Intelligent Data Analysis, 2010The use of non-linear data structures is becoming more and more common in many data mining scenarios. Trees, in particular, have drawn the attention of researchers as the simplest of non-linear data structures. Many tree mining algorithms have been proposed in the literature and this paper surveys some of the recent work that has been performed in this
Aída Jiménez +2 more
openaire +1 more source
Multi-level Frequent Pattern Mining
2009Frequent pattern mining (FPM) has become one of the most popular data mining approaches for the analysis of purchasing patterns. Methods such as Apriori and FP-growth have been shown to work efficiently in this setting. However, these techniques are typically restricted to a single concept level.
Todd Eavis, Xi Zheng
openaire +2 more sources
Mining Frequent Patterns From Sequences
Proceedings of the 2013 2nd International Conference on Intelligent System and Applied Material, 2011Pattern mining is a popular issue in biological sequence analysis. In this paper, we propose new definitions related to the pattern frequency, where gaps are mined instead of specified. We develop algorithm with polynomial complexities. Patterns can grow from both sides, and Apriori property holds.
null Junyan Zhang, null Fan Min
openaire +1 more source
Parallel Mining of Frequent Subtree Patterns
2020Mining frequent subtree patterns in a tree database (or, forest) is useful in domains such as bioinformatics and mining semi-structured data. We consider the problem of mining embedded subtrees in a database of rooted, labeled, and ordered trees. We compare two existing serial mining algorithms, PrefixTreeSpan and TreeMiner, and adapt them for parallel
Wenwen Qu +5 more
openaire +1 more source
Distributed approximate mining of frequent patterns
Proceedings of the 2005 ACM symposium on Applied computing, 2005This paper discusses a novel communication effcient distributed algorithm for approximate mining of frequent patterns from transactional databases. The proposed algorithm consists in the distributed exact computation of locally frequent itemsets and an effective method for inferring the local support of locally unfrequent itemsets.
SILVESTRI, Claudio, ORLANDO, Salvatore
openaire +5 more sources
Mining Frequent Composite Service Patterns
2008 Seventh International Conference on Grid and Cooperative Computing, 2008Service mining is an important technology which could help service composition. This paper mainly studied the problem of mining frequent composite services from the log of the composition-oriented service discovery system. First, a composite service representation method based on n-tuple was proposed.
Hui Meng +4 more
openaire +2 more sources
Frequent Pattern Mining in Attributed Trees
2013Frequent pattern mining is an important data mining task with a broad range of applications. Initially focused on the discovery of frequent itemsets, studies were extended to mine structural forms like sequences, trees or graphs. In this paper, we introduce a new data mining method that consists in mining new kind of patterns in a collection of ...
Claude Pasquier +3 more
openaire +2 more sources
Methods for Mining Frequent Sequential Patterns
2003We consider the problem of finding frequent subsequences in sequential data. We examine three algorithms using a trie with K levels. The O(K2n) breadth-first (BF) algorithm inserts a pattern into the trie at level k only if level k-1 has been completed.
Linhui Jiang, Howard J. Hamilton
openaire +2 more sources