The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
According to the features of sparse data source while mining association rules, the paper designs a special linked-list unit and two strategies to store data in matrix. A novel algorithm, called SMM (Sparse-Matrix Mining), is proposed to find large item sets from sparse matrix. SMM maps database into a binary sparse matrix and stores compressed data into a linked-list, from which to find large item...
The problem of mining frequent itemsets plays an essential role in mining association rules, but it is not necessary to mine all frequent itemsets, instead it is sufficient to mine the set of frequent closed itemsets, which is much smaller than the set of all frequent itemsets. In this paper, we present an efficient algorithm, FCI-Miner, for mining all frequent closed itemsets. It based on the improved...
Most existing algorithms for mining frequent closed itemsets have to check whether a newly generated itemset is a frequent closed itemset by using the subset checking technique. To do this, a storing structure is required to keep all known frequent itemsets and candidates. It takes additional processing time and memory space for closure checking. To remedy this problem, an efficient approach called...
An algorithm of association rules mining based on binary has been introduced to solve two problems that how to easily generate candidate frequent itemsets and fast compute support. However the basic notion of presented algorithms in generating candidate itemsets is still similar to Apriori. In some degree the efficiency of these algorithms is very confined, and so this paper proposes two different...
In order to overcome the drawbacks of apriori algorithm for mining frequent itemsets, TIMV (Three-dimensional Itemsets Matrix and Vectors) algorithm was proposed, which used three -dimensional itemsets matrix and vectors, and broke through the bottom-up framework of Apriori. Only needed one pass to scan the database and did not create candidate itemsets, we could gain all the frequent itemsets. Furthermore,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.