Sciweavers

352 search results - page 38 / 71
» Non-derivable itemset mining
Sort
View
DASFAA
2005
IEEE
171views Database» more  DASFAA 2005»
14 years 1 months ago
Mining Succinct Systems of Minimal Generators of Formal Concepts
Formal concept analysis has become an active field of study for data analysis and knowledge discovery. A formal concept C is determined by its extent (the set of objects that fall...
Guozhu Dong, Chunyu Jiang, Jian Pei, Jinyan Li, Li...
KAIS
2008
114views more  KAIS 2008»
13 years 7 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 5 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
FLAIRS
2003
13 years 9 months ago
An Improved Algorithm for Mining Association Rules Using Multiple Support Values
Almost all the approaches in association rule mining suggested the use of a single minimum support, technique that either rules out all infrequent itemsets or suffers from the bot...
Ioannis N. Kouris, Christos Makris, Athanasios K. ...
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
14 years 9 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke