Sciweavers

1277 search results - page 112 / 256
» An Evaluation Approach for Dynamics-Aware Applications Using...
Sort
View
ICDM
2005
IEEE
168views Data Mining» more  ICDM 2005»
14 years 2 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of even...
Panagiotis Papapetrou, George Kollios, Stan Sclaro...
ICDCSW
2011
IEEE
12 years 8 months ago
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
—Computer systems often reach a point at which the relative cost to increase some tunable parameter is no longer worth the corresponding performance benefit. These “knees” t...
Ville Satopaa, Jeannie R. Albrecht, David Irwin, B...
TVCG
2011
132views more  TVCG 2011»
13 years 4 months ago
Point-Based Visualization for Large Hierarchies
—Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose an ef...
Hans-Jörg Schulz, Steffen Hadlak, Heidrun Sch...
KDD
2007
ACM
152views Data Mining» more  KDD 2007»
14 years 9 months ago
Privacy-Preserving Sharing of Horizontally-Distributed Private Data for Constructing Accurate Classifiers
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
Vincent Yan Fu Tan, See-Kiong Ng
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 9 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà