Sciweavers

400 search results - page 55 / 80
» Hard Problem Generation for MKP
Sort
View
CIKM
2006
Springer
15 years 1 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
185
Voted
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
15 years 11 months ago
Direct Discriminative Pattern Mining for Effective Classification
The application of frequent patterns in classification has demonstrated its power in recent studies. It often adopts a two-step approach: frequent pattern (or classification rule) ...
Hong Cheng, Xifeng Yan, Jiawei Han, Philip S. Yu
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
15 years 10 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
15 years 9 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
102
Voted
ISPD
2004
ACM
146views Hardware» more  ISPD 2004»
15 years 2 months ago
Power-aware clock tree planning
Modern processors and SoCs require the adoption of poweroriented design styles, due to the implications that power consumption may have on reliability, cost and manufacturability ...
Monica Donno, Enrico Macii, Luca Mazzoni