Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
9,624
MAXIMAL FREQUENT ITEMSET GENERATION USING SEGMENTATION APPROACH
"... ABSTRACT Finding frequent itemsets in a data source is a fundamental operation behind Association Rule Mining. Generally, many algorithms use either the bottom-up or top-down approaches for finding these frequent itemsets. When the length of frequent itemsets to be found is large, the traditional a ..."
Abstract
- Add to MetaCart
algorithms find all the frequent itemsets from 1-length to n-length, which is a difficult process. This problem can be solved by mining only the Maximal Frequent Itemsets (MFS). Maximal Frequent Itemsets are frequent itemsets which have no proper frequent superset. Thus, the generation of only maximal
An Improved Frequent Itemset Generation Algorithm Based On Correspondence
"... Association rules play a very vital role in the present day market that especially involves generation of maximal frequent itemsets in an efficient way. The efficiency of association rule is determined by the number of database scans required to generate the frequent itemsets. This in turn is propor ..."
Abstract
- Add to MetaCart
Association rules play a very vital role in the present day market that especially involves generation of maximal frequent itemsets in an efficient way. The efficiency of association rule is determined by the number of database scans required to generate the frequent itemsets. This in turn
Tabular Method For Frequent Itemset Generation In Large Database
"... Mining for association rules involves extracting pat-terns from large database and inferring useful information from these. This has been described as an important mining problem in large database of sales transactions. The Apriori algorithm has been implemented for mining association rules for quit ..."
Abstract
- Add to MetaCart
of the algorithm present in the literature. They also require scanning of the entire database at least or almost twice in the worst case.In existing work, partition algorithm is a well-known algorithm for generating frequent itemsets, in which the data is partitioned randomly. And then Tid list data representation
R.: Visual Interface for Online Watching of Frequent Itemset Generation in Apriori and Eclat
- In Proc. IEEE International Conference on Machine Learning and Applications
, 2005
"... This paper describes an interactive graphical user interface tool called Visual Apriori that can be used to study two famous frequent itemset generation algorithms, namely, Apriori and Eclat. Understanding the functional behavior of these two algorithms is critical for students taking a data mining ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This paper describes an interactive graphical user interface tool called Visual Apriori that can be used to study two famous frequent itemset generation algorithms, namely, Apriori and Eclat. Understanding the functional behavior of these two algorithms is critical for students taking a data mining
A Performance Based Transposition Algorithm for Frequent Itemsets Generation
"... Association Rule Mining (ARM) technique is used to discover the interesting association or correlation among a large set of data items. It plays an important role in generating frequent itemsets from large databases. Many industries are interested in developing the association rules from their datab ..."
Abstract
- Add to MetaCart
Association Rule Mining (ARM) technique is used to discover the interesting association or correlation among a large set of data items. It plays an important role in generating frequent itemsets from large databases. Many industries are interested in developing the association rules from
A DIC-based Distributed Algorithm for Frequent Itemset Generation
"... Abstract — A distributed algorithm based on Dynamic Item-set Counting (DIC) for generation of frequent itemsets is presented by us. DIC represents a paradigm shift from Apriori-based algorithms in the number of passes of the database hence reducing the total time taken to obtain the frequent itemset ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract — A distributed algorithm based on Dynamic Item-set Counting (DIC) for generation of frequent itemsets is presented by us. DIC represents a paradigm shift from Apriori-based algorithms in the number of passes of the database hence reducing the total time taken to obtain the frequent
Association against Dissociation: some pragmatic considerations for Frequent Itemset generation under Fixed and Variable Thresholds Sukomal
"... Sukomal_r at isical.ac.in aditya at isical.ac.in Traditionally, support is considered to be the standard measure for frequent itemset generation in Association Rule mining. This paper provides a new measure called togetherness where dissociation among items is also considered as a parameter in the f ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Sukomal_r at isical.ac.in aditya at isical.ac.in Traditionally, support is considered to be the standard measure for frequent itemset generation in Association Rule mining. This paper provides a new measure called togetherness where dissociation among items is also considered as a parameter
CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets
, 2000
"... Association mining may often derive an undesirably large set of frequent itemsets and association rules. Recent studies have proposed an interesting alternative: mining frequent closed itemsets and their corresponding rules, which has the same power as association mining but substantially reduces th ..."
Abstract
-
Cited by 312 (28 self)
- Add to MetaCart
the number of rules to be presented. In this paper, we propose an efficient algorithm, CLOSET, for mining closed itemsets, with the development of three techniques: (1) applying a compressed, frequent pattern tree FP-tree structure for mining closed itemsets without candidate generation, (2) developing a
Discovering Frequent Closed Itemsets for Association Rules
, 1999
"... In this paper, we address the problem of finding frequent itemsets in a database. Using the closed itemset lattice framework, we show that this problem can be reduced to the problem of finding frequent closed itemsets. Based on this statement, we can construct efficient data mining algorithms by lim ..."
Abstract
-
Cited by 410 (14 self)
- Add to MetaCart
In this paper, we address the problem of finding frequent itemsets in a database. Using the closed itemset lattice framework, we show that this problem can be reduced to the problem of finding frequent closed itemsets. Based on this statement, we can construct efficient data mining algorithms
Dynamic Itemset Counting and Implication Rules for Market Basket Data
, 1997
"... We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling. We in ..."
Abstract
-
Cited by 615 (6 self)
- Add to MetaCart
We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling. We
Results 1 - 10
of
9,624
