134 search results - page 17 / 27 » Sliding-Window Filtering: An Efficient Algorithm for Increme... |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
DIS
2006
Springer
13 years 9 months ago
2006
Springer
Knowledge discovery systems are constrained by three main limited resources: time, memory and sample size. Sample size is traditionally the dominant limitation, but in many present...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
KDD
2009
ACM
14 years 5 days ago
2009
ACM
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...