Sciweavers

731 search results - page 62 / 147
» Taxonomy-superimposed graph mining
Sort
View
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 8 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 4 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
CIKM
2009
Springer
14 years 4 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 4 months ago
Learning Preferences with Hidden Common Cause Relations
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
Kristian Kersting, Zhao Xu
ICDM
2007
IEEE
156views Data Mining» more  ICDM 2007»
14 years 1 months ago
Computing Correlation Anomaly Scores Using Stochastic Nearest Neighbors
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that t...
Tsuyoshi Idé, Spiros Papadimitriou, Michail...