Sciweavers

49 search results - page 10 / 10
» Learning DNF from Random Walks
Sort
View
ICDM
2009
IEEE
211views Data Mining» more  ICDM 2009»
14 years 2 days ago
Discovering Organizational Structure in Dynamic Social Network
—Applying the concept of organizational structure to social network analysis may well represent the power of members and the scope of their power in a social network. In this pap...
Jiangtao Qiu, Zhangxi Lin, Changjie Tang, Shaojie ...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 5 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
ECML
2004
Springer
13 years 10 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
IWLCS
2001
Springer
13 years 10 months ago
Explorations in LCS Models of Stock Trading
In previous papers we have described the basic elements for building an economic model consisting of a group of artificial traders functioning and adapting in an environment conta...
Sonia Schulenburg, Peter Ross