Results 171 to 180 of about 739 (208)

Mining Closed Itemsets: A Review

International Journal of Advancements in Computing Technology, 2012
Closed itemset mining is a popular research in data mining. It was proposed to avoid a large number of redundant itemsets in frequent itemset mining. Various algorithms were proposed with efficient strategies to generate closed itemsets. This paper aims to study the existence algorithms used to mine closed itemsets.
openaire   +1 more source

Fast approximation of probabilistic frequent closed itemsets

Proceedings of the 50th Annual Southeast Regional Conference, 2012
In recent years, the concept of and algorithm for mining probabilistic frequent itemsets (PFIs) in uncertain databases, based on possible worlds semantics and a dynamic programming approach for frequency calculations, has been proposed. The frequentness of a given itemset in this scheme can be characterized by the Poisson binomial distribution. Further
Erich A. Peterson, Peiyi Tang
openaire   +1 more source

An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices

Expert Systems with Applications, 2014
Multilevel knowledge in transactional databases plays a significant role in our real-life market basket analysis. Many researchers have mined the hierarchical association rules and thus proposed various approaches. However, some of the existing approaches produce many multilevel and cross-level association rules that fail to convey quality information.
Tahrima Hashem, Chowdhury Farhan Ahmed, Md. Samiullah 0001, Sayma Akther, Byeong-Soo Jeong, Seokhee Jeon   +5 more
openaire   +1 more source

The Closed Keys Base of Frequent Itemsets

2002
In data mining, concise representations are useful and necessary to apprehending voluminous results of data processing. Recently many different concise representations of frequent itemsets have been investigated. In this paper, we present yet another concise representation of frequent itemsets, called the closed keys representation, with the following ...
openaire   +1 more source

CloseMiner: Discovering Frequent Closed Itemsets Using Frequent Closed Tidsets

Fifth IEEE International Conference on Data Mining (ICDM'05), 2006
Complete set of itemsets can be grouped into non-overlapping clusters identified by closed tidsets. Each cluster has only one closed itemset and is the superset of all itemsets with the same support. Number of closed itemsets is identical to the number of clusters.
Ningthoujam Gourakishwar Singh, Sanasam Ranbir Singh, Anjana Kakoti Mahanta   +2 more
openaire   +1 more source

An Optimization to CHARM Algorithm for Mining Frequent Closed Itemsets

2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing, 2015
Frequent itemsets which are quite useful in many applications always suffer from their huge number and information redundancy. Frequent closed itemsets that provide a minimal and lossless presentation of all frequent itemsets are a solution to the problem.
Xin Ye, Feng Wei 0001, Fan Jiang 0005, Shaoyin Cheng   +3 more
openaire   +1 more source

Mining Frequent Closed Itemsets from Distributed Repositories

2007
In this paper we address the problem of mining frequent closed itemsets in a highly distributed setting like a Grid. The extraction of frequent (closed) itemsets is an important problem in Data Mining, and is a very expensive phase needed to extract from a transactional database a reduced set of meaningful association rules, typically used for Market ...
LUCCHESE, Claudio, ORLANDO, Salvatore, R. PEREGO, SILVESTRI, Claudio   +3 more
openaire   +3 more sources

An Improved MapReduce Algorithm for Mining Closed Frequent Itemsets

2016 IEEE International Conference on Software Science, Technology and Engineering (SWSTE), 2016
Mining closed frequent item sets is a key objective in the field of data mining due to its wide range of applications. Given a database of transactions, the task is to find closed subsets which appear frequently in different transactions. This subject has been studied thoroughly, and many efficient algorithms had been presented, however, most of them ...
Yaron Gonen, Ehud Gudes
openaire   +1 more source

Mining Frequent Weighted Closed Itemsets

2013
Mining frequent itemsets plays an important role in mining association rules. One of methods for mining frequent itemsets is mining frequent weighted itemsets (FWIs). However, the number of FWIs is often very large when the database is large. Besides, FWIs will generate a lot of rules and some of them are redundant.
Bay Vo, Nhu-Y Tran, Duong-Ha Ngo
openaire   +1 more source

CWFM: Closed Contingency Weighted Frequent Itemsets Mining

2012
Weighted pattern mining have been studied the importance of items. So far, in weight constraint based pattern mining, the weight has been considered the item's price. The price considered as the weight has a limit. The weight characteristic of weighted pattern mining should be considered case-by-case situation.
Eunkyoung Park, Younghee Kim, Iee Joon Kim, Jae Yeol Yoon, Ji Yeon Lim, Ungmo Kim   +5 more
openaire   +1 more source