Sciweavers

51 search results - page 8 / 11
» Frequent Sub-graph Mining on Edge Weighted Graphs
Sort
View
KAIS
2008
119views more  KAIS 2008»
14 years 9 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
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
15 years 9 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
WWW
2007
ACM
15 years 10 months ago
Measuring credibility of users in an e-learning environment
Learning Villages (LV) is an E-learning platform for people's online discussions and frequently citing postings of one another. In this paper, we propose a novel method to ra...
Wei Wei, Jimmy Ho-Man Lee, Irwin King
SDM
2012
SIAM
278views Data Mining» more  SDM 2012»
12 years 12 months ago
Legislative Prediction via Random Walks over a Heterogeneous Graph
In this article, we propose a random walk-based model to predict legislators’ votes on a set of bills. In particular, we first convert roll call data, i.e. the recorded votes a...
Jun Wang, Kush R. Varshney, Aleksandra Mojsilovic
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
15 years 10 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é