Sciweavers

3629 search results - page 455 / 726
» A More Efficient Use of Delta-CRLs
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
16 years 7 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
POPL
2006
ACM
16 years 7 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
PODS
2007
ACM
225views Database» more  PODS 2007»
16 years 6 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...