Results 221 to 230 of about 659,665 (262)
Some of the next articles are maybe not open access.
Mining image frequent patterns based on a frequent pattern list in image databases
The Journal of Supercomputing, 2019The goal of image mining is to find the useful information hidden in image databases. The 9DSPA-Miner approach uses the Apriori strategy to mine the image database, where each image is represented by the 9D-SPA representation. It presents a reasoning method to reason the unknown spatial relation that satisfies the spatial consistency.
Ye-In Chang +4 more
openaire +1 more source
An Efficient Approach for Mining Frequent Patterns Based on Traversing a Frequent Pattern Tree
2008 International Conference on Computer Science and Software Engineering, 2008Mining frequent patterns is an important task for knowledge discovery, which discovers the groups of items appearing always together excess of a user specified threshold. A famous algorithm for mining frequent patterns is FP-Growth which constructs a structure called FP-tree and recursively mines frequent patterns from this structure by building ...
Show-Jane Yen +3 more
openaire +2 more sources
Mining Frequent Ordered Patterns
2005Mining frequent patterns has been studied popularly in data mining research. All of previous studies assume that items in a pattern are unordered. However, the order existing between items must be considered in some applications. In this paper, we first give the formal model of ordered patterns and discuss the problem of mining frequent ordered ...
Zhi-Hong Deng 0001 +3 more
openaire +1 more source
On Closed Constrained Frequent Pattern Mining
Fourth IEEE International Conference on Data Mining (ICDM'04), 2005Constrained frequent patterns and closed frequent patterns are two paradigms aimed at reducing the set of extracted patterns to a smaller, more interesting, subset. Although a lot of work has been done with both these paradigms, there is still confusion around the mining problem obtained by joining closed and constrained frequent patterns in a unique ...
Bonchi F, Lucchese C
openaire +3 more sources
Constrained frequent pattern mining
ACM SIGKDD Explorations Newsletter, 2002It has been well recognized that frequent pattern mining plays an essential role in many important data mining tasks. However, frequent pattern mining often generates a very large number of patterns and rules, which reduces not only the efficiency but also the effectiveness of mining.
Jian Pei 0001, Jiawei Han 0001
openaire +2 more sources
On computing condensed frequent pattern bases
2002 IEEE International Conference on Data Mining, 2002. Proceedings., 2003Frequent pattern mining has been studied extensively. However, the effectiveness and efficiency of this mining is often limited, since the number of frequent patterns generated is often too large. In many applications it is sufficient to generate and examine only frequent patterns with support frequency in close-enough approximation instead of in full ...
Pei, Jian +3 more
openaire +3 more sources
MRFP: Discovery Frequent Patterns Using MapReduce Frequent Pattern Growth
2016 International Conference on Network and Information Systems for Computers (ICNISC), 2016In this paper, a novelty of a new method has been presented. MRFP-Growth is implementing to solve the problem of discovering frequent patterns with massive datasets. Most of the frequent patterns algorithms are unable to manipulate with the large datasets, our scheme implement FP-Growth method under MapReduce framework in Hadoop platform to decrease ...
Arkan A. G. Al-Hamodi, Songfeng Lu
openaire +1 more source
Essential Patterns: A Perfect Cover of Frequent Patterns
2005The extraction of frequent patterns often yields extremely voluminous results which are difficult to handle. Computing a concise representation or cover of the frequent pattern set is thus an interesting alternative investigated by various approaches. The work presented in this article fits in such a trend. We introduce the concept of essential pattern
Alain Casali +2 more
openaire +1 more source
The Combinations of Frequent Pattern Tree and Candidate Generation for Mining Frequent Patterns
2008 Second International Conference on Future Generation Communication and Networking Symposia, 2008Many approaches have been proposed for mining frequent pattern. However, either the search space or memory space is huge, such that the performance for the previous approach degrades when the database is massive or the threshold for mining frequent patterns is low. In this paper, we propose an algorithm for mining frequent patterns.
Show-Jane Yen +3 more
openaire +1 more source
Discovering Frequent Patterns to Bootstrap Trust
2013When a new agent enters to an open multiagent system, bootstrapping its trust becomes a challenge because of the lack of any direct or reputational evidence. To get around this problem, existing approaches assume the same a priori trust for all newcomers.
Murat Sensoy +2 more
openaire +2 more sources