Sciweavers

725 search results - page 95 / 145
» A Generalization of Repetition Threshold
Sort
View
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 9 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 9 months ago
BLOSOM: a framework for mining arbitrary boolean expressions
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishna...
SIGMOD
2009
ACM
177views Database» more  SIGMOD 2009»
14 years 8 months ago
ORDEN: outlier region detection and exploration in sensor networks
Sensor networks play a central role in applications that monitor variables in geographic areas such as the traffic volume on roads or the temperature in the environment. A key fea...
Conny Franke, Michael Gertz
SIGMOD
2008
ACM
126views Database» more  SIGMOD 2008»
14 years 8 months ago
On efficient top-k query processing in highly distributed environments
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most ...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang