Sciweavers

40 search results - page 5 / 8
» Top-k Correlative Graph Mining.
Sort
View
PKDD
2010
Springer
155views Data Mining» more  PKDD 2010»
13 years 5 months ago
Latent Structure Pattern Mining
Pattern mining methods for graph data have largely been restricted to ground features, such as frequent or correlated subgraphs. Kazius et al. have demonstrated the use of elaborat...
Andreas Maunz, Christoph Helma, Tobias Cramer, Ste...
PKDD
2009
Springer
184views Data Mining» more  PKDD 2009»
14 years 2 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
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 7 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
KAIS
2008
119views more  KAIS 2008»
13 years 7 months ago
An information-theoretic approach to quantitative association rule mining
Abstract. Quantitative Association Rule (QAR) mining has been recognized an influential research problem over the last decade due to the popularity of quantitative databases and th...
Yiping Ke, James Cheng, Wilfred Ng