Sciweavers

582 search results - page 78 / 117
» Info-fuzzy algorithms for mining dynamic data streams
Sort
View
BROADNETS
2004
IEEE
15 years 8 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
ICDM
2003
IEEE
240views Data Mining» more  ICDM 2003»
15 years 9 months ago
Clustering of Time Series Subsequences is Meaningless: Implications for Previous and Future Research
Given the recent explosion of interest in streaming data and online algorithms, clustering of time series subsequences, extracted via a sliding window, has received much attention...
Eamonn J. Keogh, Jessica Lin, Wagner Truppel
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 4 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
KDD
2009
ACM
223views Data Mining» more  KDD 2009»
16 years 5 months ago
Collaborative filtering with temporal dynamics
Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are ...
Yehuda Koren
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
16 years 5 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer