Sciweavers

70 search results - page 12 / 14
» Optimal reconstruction might be hard
Sort
View
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 10 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
SAC
2005
ACM
14 years 3 months ago
Performance analysis framework for large software-intensive systems with a message passing paradigm
The launch of new features for mobile phones is increasing and the product life cycle symmetrically decreasing in duration as higher levels of sophistication are reached. Therefor...
Christian Del Rosso
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 10 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
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 10 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
STOC
2005
ACM
129views Algorithms» more  STOC 2005»
14 years 10 months ago
Learning with attribute costs
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...
Haim Kaplan, Eyal Kushilevitz, Yishay Mansour