Sciweavers

98 search results - page 20 / 20
» Parallel Mining of Maximal Frequent Itemsets from Databases
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 5 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
SAC
2010
ACM
13 years 11 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
KDD
2006
ACM
127views Data Mining» more  KDD 2006»
14 years 5 months ago
Recommendation method for extending subscription periods
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
Tomoharu Iwata, Kazumi Saito, Takeshi Yamada