Sciweavers

11 search results - page 1 / 3
» Graph Sparsification by Effective Resistances
Sort
View
CORR
2008
Springer
50views Education» more  CORR 2008»
13 years 7 months ago
Graph Sparsification by Effective Resistances
Daniel A. Spielman, Nikhil Srivastava
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
13 years 5 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang
ECAI
2008
Springer
13 years 9 months ago
Modeling Collaborative Similarity with the Signed Resistance Distance Kernel
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
Jérôme Kunegis, Stephan Schmidt, Sahi...
ICML
2009
IEEE
14 years 8 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang
HICSS
2006
IEEE
114views Biometrics» more  HICSS 2006»
14 years 1 months ago
A Formal Approach towards Assessing the Effectiveness of Anti-Spam Procedures
Spam e-mails have become a serious technological and economic problem. So far we have been reasonably able to resist spam e-mails and use the Internet for regular communication by...
Guido Schryen