-
1
-
-
10944272139
-
Friends and neighbors on the web
-
Adamic, L. A., & Adar, E. (2003). Friends and neighbors on the web. Social Networks, 25.
-
(2003)
Social Networks
, pp. 25
-
-
Adamic, L.A.1
Adar, E.2
-
3
-
-
67651164565
-
A random walks perspective on maximizing satisfaction and profit
-
Brand, M. (2005). A Random Walks Perspective on Maximizing Satisfaction and Profit. SIAM'05.
-
(2005)
SIAM'05
-
-
Brand, M.1
-
4
-
-
0001733453
-
Comparison of methods for positional analysis: Structural and general equivalences
-
Faust, K. (1988). Comparison of methods for positional analysis: Structural and general equivalences. Social Networks.
-
(1988)
Social Networks
-
-
Faust, K.1
-
6
-
-
0002827622
-
A new status index derived from sociometric analysis
-
Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika.
-
(1953)
Psychometrika
-
-
Katz, L.1
-
7
-
-
0033726520
-
The small-world phenomenon: An algorithmic perspective
-
Kleinberg, J. (2000). The Small-World Phenomenon: An Algorithmic Perspective. STOC.
-
(2000)
STOC
-
-
Kleinberg, J.1
-
8
-
-
18744398132
-
The link prediction problem for social networks
-
Liben-Nowell, D., & Kleinberg, J. (2003). The link prediction problem for social networks. CIKM'03.
-
(2003)
CIKM'03
-
-
Liben-Nowell, D.1
Kleinberg, J.2
-
9
-
-
84898061133
-
Empirical bernstein bounds and sample-variance penalization
-
Maurer, A., & Pontil, M. (2009). Empirical bernstein bounds and sample-variance penalization. Conference on Learning Theory.
-
(2009)
Conference on Learning Theory
-
-
Maurer, A.1
Pontil, M.2
-
13
-
-
38049143752
-
Latent space approaches to social network analysis
-
Raftery, A. E., and Handcock., M. S., & Hoff, P. D. (2002). Latent space approaches to social network analysis. J. Amer. Stat. Assoc., 15, 460.
-
(2002)
J. Amer. Stat. Assoc.
, vol.15
, pp. 460
-
-
Raftery, A.E.1
Handcock, M.S.2
Hoff, P.D.3
-
14
-
-
0036187561
-
Social networks: From the web to the enterprise
-
Raghavan, P. (2002). Social networks: From the web to the enterprise. IEEE Internet Computing.
-
(2002)
IEEE Internet Computing
-
-
Raghavan, P.1
-
15
-
-
80053203488
-
A tractable approach to finding closest truncated-commute-time neighbors in large graphs
-
Sarkar, P., & Moore, A. (2007). A tractable approach to finding closest truncated-commute-time neighbors in large graphs. Proc. UAI.
-
(2007)
Proc. UAI
-
-
Sarkar, P.1
Moore, A.2
-
16
-
-
34248386387
-
Crimelink explorer: Using domain knowledge to facilitate automated crime association analysis
-
Schroeder, J., and Xu., J. J., & Chen, H. (2003). Crimelink explorer: Using domain knowledge to facilitate automated crime association analysis. ISI (pp. 168-180).
-
(2003)
ISI
, pp. 168-180
-
-
Schroeder, J.1
Xu, J.J.2
Chen, H.3
|