Sciweavers

74 search results - page 13 / 15
» The complexity of mining maximal frequent itemsets and maxim...
Sort
View
WWW
2004
ACM
14 years 8 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
KDD
2009
ACM
221views Data Mining» more  KDD 2009»
14 years 8 months ago
Migration motif: a spatial - temporal pattern mining approach for financial markets
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee,...
ICDT
2001
ACM
124views Database» more  ICDT 2001»
14 years 9 days ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 8 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
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...