Sciweavers

990 search results - page 99 / 198
» An efficient data structure for network anomaly detection
Sort
View
KDD
2009
ACM
181views Data Mining» more  KDD 2009»
14 years 4 months ago
An exploration of climate data using complex networks
To discover patterns in historical data, climate scientists have applied various clustering methods with the goal of identifying regions that share some common climatological beha...
Karsten Steinhaeuser, Nitesh V. Chawla, Auroop R. ...
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 9 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
TVCG
2011
100views more  TVCG 2011»
13 years 4 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber
CP
2007
Springer
14 years 1 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
ECCV
2010
Springer
13 years 11 months ago
A coarse-to-fine taxonomy of constellations for fast multi-class object detection
In order for recognition systems to scale to a larger number of object categories building visual class taxonomies is important to achieve running times logarithmic in the number o...