2010 FrequentRegularItemsetMining

• (Ruggieri, 2010) ⇒ Salvatore Ruggieri. (2010). “Frequent Regular Itemset Mining.” In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2010). doi:10.1145/1835804.1835840

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%22Frequent+regular+itemset+mining%22+2010
• http://portal.acm.org/citation.cfm?id=1835840&preflayout=flat#citedby

Quotes

Abstract

Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an extension of itemsets, called regular, with an immediate semantics and interpretability, and a conciseness comparable to closed itemsets. Regular itemsets allow for specifying that an item may or may not be present; that any subset of an itemset may be present; and that any non-empty subset of an itemset may be present. We devise a procedure, called RegularMine, for mining a set of regular itemsets that is a concise representation of frequent itemsets. The procedure computes a covering, in terms of regular itemsets, of the frequent itemsets in the class of equivalence of a closed one. We report experimental results on several standard dense and sparse datasets that validate the proposed approach.

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2010 FrequentRegularItemsetMining	Salvatore Ruggieri			Frequent Regular Itemset Mining		KDD-2010 Proceedings		10.1145/1835804.1835840		2010