Sciweavers

284 search results - page 3 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 7 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
KDD
2010
ACM
223views Data Mining» more  KDD 2010»
13 years 10 months ago
Frequent regular itemset mining
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...
Salvatore Ruggieri
IEAAIE
2009
Springer
14 years 24 days ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
14 years 11 days ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
IDEAS
2005
IEEE
99views Database» more  IDEAS 2005»
13 years 12 months ago
Distribution-Based Synthetic Database Generation Techniques for Itemset Mining
The resource requirements of frequent pattern mining algorithms depend mainly on the length distribution of the mined patterns in the database. Synthetic databases, which are used...
Ganesh Ramesh, Mohammed Javeed Zaki, William Mania...