Sciweavers

47 search results - page 3 / 10
» kdd 1999
Sort
View
KDD
1999
ACM
117views Data Mining» more  KDD 1999»
13 years 9 months ago
Identifying Distinctive Subsequences in Multivariate Time Series by Clustering
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
Tim Oates
KDD
1999
ACM
147views Data Mining» more  KDD 1999»
13 years 9 months ago
Text Mining: Finding Nuggets in Mountains of Textual Data
Text mining appliesthe sameanalytical functions of datamining to the domainof textual information, relying on sophisticatedtext analysis techniques that distill information from f...
Jochen Dörre, Peter Gerstl, Roland Seiffert
KDD
1999
ACM
217views Data Mining» more  KDD 1999»
13 years 9 months ago
An Efficient Algorithm to Update Large Itemsets with Early Pruning
We present an efficient algorithm (UWEP) for updating large itemsets when new transactions are added to the set of old transactions. UWEP employs a dynamic lookahead strategy in u...
Necip Fazil Ayan, Abdullah Uz Tansel, M. Erol Arku...
ISI
2008
Springer
13 years 5 months ago
Analysis of cyberactivism: A case study of online free Tibet activities
In this paper, we study the problem of anomaly detection in high-dimensional network streams. We have developed a new technique, called Stream Projected Ouliter deTector (SPOT), t...
Tianjun Fu, Hsinchun Chen
ISI
2008
Springer
13 years 3 months ago
Anomaly detection in high-dimensional network data streams: A case study
In this paper, we study the problem of anomaly detection in high-dimensional network streams. We have developed a new technique, called Stream Projected Ouliter deTector (SPOT), t...
Ji Zhang, Qigang Gao, Hai H. Wang