Results 261 to 270 of about 648,662 (306)
Some of the next articles are maybe not open access.

Semantic annotation of frequent patterns

ACM Transactions on Knowledge Discovery from Data, 2007
Using frequent patterns to analyze data has been one of the fundamental approaches in many data mining applications. Research in frequent pattern mining has so far mostly focused on developing efficient algorithms to discover various kinds of frequent patterns, but little attention has been paid to the important next step—interpreting the discovered ...
Qiaozhu Mei   +4 more
openaire   +1 more source

Generating Closed Frequent Itemsets with the Frequent Pattern List

2010 2nd International Workshop on Database Technology and Applications, 2010
An approach is proposed to discover closed frequent itemsets with a simple linear list structure called the Frequent Pattern List(FPL) in transaction database. The approach selects representation patterns from candidate itemsets to reduce combinational space of frequent patterns.
Qin Li, Sheng Chang
openaire   +1 more source

Mining Maximal Frequent Itemsets with Frequent Pattern List

Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), 2007
Mining frequent itemsets is a major aspect of association rule research. However, the mining of the complete of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of maximal frequent itemsets.
Jin Qian, Feiyue Ye
openaire   +1 more source

Sampling Ensembles for Frequent Patterns

2005
A popular solution to improving the speed and scalability of association rule mining is to do the algorithm on a random sample instead of the entire database. But it is at the expense of the accuracy of answers. In this paper, we present a sampling ensemble approach to improve the accuracy for a given sample size.
Caiyan Jia, Ruqian Lu
openaire   +1 more source

Mining Frequent Patterns with Incremental Updating Frequent Pattern Tree

2006 6th World Congress on Intelligent Control and Automation, 2006
Mining frequent patterns has been studied popularly in data mining research. However, very little work has been done on maintenance of mined frequent patterns. For the real useful frequent patterns, one must continually adjust a minimum support threshold. Expensive and repeated database scans were done.
null Qunxiong Zhu, null Xiaoyong Lin
openaire   +1 more source

Balancing the Analysis of Frequent Patterns

2014
A main challenge in pattern mining is to focus the discovery on high-quality patterns. One popular solution is to compute a numerical score on how well each discovered pattern describes the data. The best rating patterns are then the most analyzed by the data expert.
Giacometti, Arnaud   +2 more
openaire   +2 more sources

Mining image frequent patterns based on a frequent pattern list in image databases

The Journal of Supercomputing, 2019
The 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, 2008
Mining 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   +1 more source

Mining Supplemental Frequent Patterns

2008
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transaction database. With given minimum support (min_sup) and minimum share support (min_share_sup), each SFP includes a core frequent pattern (BFP) used to draw other frequent or ...
Yintian Liu   +4 more
openaire   +1 more source

Constrained frequent pattern mining

ACM SIGKDD Explorations Newsletter, 2002
It 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   +1 more source

Home - About - Disclaimer - Privacy