Sciweavers

352 search results - page 9 / 71
» Non-derivable itemset mining
Sort
View
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
13 years 5 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
14 years 1 months ago
TRIAS - An Algorithm for Mining Iceberg Tri-Lattices
In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies. ...
Robert Jäschke, Andreas Hotho, Christoph Schm...
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
14 years 12 days ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
CIKM
2005
Springer
14 years 1 months ago
Frequent pattern discovery with memory constraint
We explore in this paper a practicably interesting mining task to retrieve frequent itemsets with memory constraint. As opposed to most previous works that concentrate on improvin...
Kun-Ta Chuang, Ming-Syan Chen
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
14 years 8 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho