Sciweavers

567 search results - page 102 / 114
» Thresholds for Object-Oriented Measures
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 8 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 months ago
Detecting outliers using transduction and statistical testing
Outlier detection can uncover malicious behavior in fields like intrusion detection and fraud analysis. Although there has been a significant amount of work in outlier detection, ...
Daniel Barbará, Carlotta Domeniconi, James ...
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 8 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 7 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu
SPAA
2009
ACM
14 years 2 months ago
Distributed algorithms for QoS load balancing
We consider a dynamic load balancing scenario in which users allocate resources in a non-cooperative and selfish fashion. The perceived performance of a resource for a user decre...
Heiner Ackermann, Simon Fischer, Martin Hoefer, Ma...