Sciweavers

165 search results - page 28 / 33
» Mining Compressed Frequent-Pattern Sets
Sort
View
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 9 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...
KDD
2009
ACM
347views Data Mining» more  KDD 2009»
14 years 9 months ago
Network anomaly detection based on Eigen equation compression
This paper addresses the issue of unsupervised network anomaly detection. In recent years, networks have played more and more critical roles. Since their outages cause serious eco...
Shunsuke Hirose, Kenji Yamanishi, Takayuki Nakata,...
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
14 years 9 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 10 months ago
A Compression Based Distance Measure for Texture
The analysis of texture is an important subroutine in application areas as diverse as biology, medicine, robotics, and forensic science. While the last three decades have seen ext...
Bilson J. L. Campana, Eamonn J. Keogh
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 9 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...