-
1
-
-
79952562794
-
Clustering large attributed graphs: A balance between structural and attribute similarities
-
H. Cheng, Y. Zhou, and J. X. Yu. Clustering large attributed graphs: A balance between structural and attribute similarities. TKDD, 5(2):12, 2011.
-
(2011)
TKDD
, vol.5
, Issue.2
, pp. 12
-
-
Cheng, H.1
Zhou, Y.2
Yu, J.X.3
-
4
-
-
84856272029
-
Hcdf: A hybrid community discovery framework
-
K. Henderson, T. Eliassi-Rad, S. Papadimitriou, and C. Faloutsos. Hcdf: A hybrid community discovery framework. In SDM, pages 754-765, 2010.
-
(2010)
SDM
, pp. 754-765
-
-
Henderson, K.1
Eliassi-Rad, T.2
Papadimitriou, S.3
Faloutsos, C.4
-
5
-
-
85026972772
-
Probabilistic latent semantic indexing
-
T. Hofmann. Probabilistic latent semantic indexing. In SIGIR, pages 50-57, 1999.
-
(1999)
SIGIR
, pp. 50-57
-
-
Hofmann, T.1
-
6
-
-
3142728485
-
Central clustering of attributed graphs
-
B. J. Jain and F. Wysotzki. Central clustering of attributed graphs. Machine Learning, 56(1-3):169-207, 2004.
-
(2004)
Machine Learning
, vol.56
, Issue.1-3
, pp. 169-207
-
-
Jain, B.J.1
Wysotzki, F.2
-
7
-
-
0033225865
-
An introduction to variational methods for graphical models
-
M. I. Jordan, Z. Ghahramani, T. Jaakkola, and L. K. Saul. An introduction to variational methods for graphical models. Machine Learning, 37(2):183-233, 1999.
-
(1999)
Machine Learning
, vol.37
, Issue.2
, pp. 183-233
-
-
Jordan, M.I.1
Ghahramani, Z.2
Jaakkola, T.3
Saul, L.K.4
-
9
-
-
40849113633
-
Clustering relational data using attribute and link information
-
J. Neville, M. Adler, and D. Jensen. Clustering relational data using attribute and link information. In Text Mining and Link Analysis Workshop, IJCAI, pages 689-698, 2003.
-
(2003)
Text Mining and Link Analysis Workshop, IJCAI
, pp. 689-698
-
-
Neville, J.1
Adler, M.2
Jensen, D.3
-
10
-
-
42749100809
-
Fast algorithm for detecting community structure in networks
-
M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69:066133, 2004.
-
(2004)
Physical Review E
, vol.69
, pp. 066133
-
-
Newman, M.E.J.1
-
11
-
-
37649028224
-
Finding and evaluating community structure in networks
-
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:066113, 2004.
-
(2004)
Physical Review E
, vol.69
, pp. 066113
-
-
Newman, M.E.J.1
Girvan, M.2
-
14
-
-
0027658862
-
Incremental clustering of attributed graphs
-
D. S. Seong, H. S. Kim, and K. H. Park. Incremental clustering of attributed graphs. IEEE Transactions on Systems, Man and Cybernetics, 23(5):1399-1411, 1993.
-
(1993)
IEEE Transactions on Systems, Man and Cybernetics
, vol.23
, Issue.5
, pp. 1399-1411
-
-
Seong, D.S.1
Kim, H.S.2
Park, K.H.3
-
15
-
-
0036757929
-
Synthesis of function-described graphs and clustering of attributed graphs
-
F. Serratosa, R. Alquézar, and A. Sanfeliu. Synthesis of function-described graphs and clustering of attributed graphs. International Journal of Pattern Recognition and Artificial Intelligence, 16(6):621-656, 2002.
-
(2002)
International Journal of Pattern Recognition and Artificial Intelligence
, vol.16
, Issue.6
, pp. 621-656
-
-
Serratosa, F.1
Alquézar, R.2
Sanfeliu, A.3
-
17
-
-
34748827346
-
Fast random walk with restart and its applications
-
H. Tong, C. Faloutsos, and J.-Y. Pan. Fast random walk with restart and its applications. In ICDM, pages 613-622, 2006.
-
(2006)
ICDM
, pp. 613-622
-
-
Tong, H.1
Faloutsos, C.2
Pan, J.-Y.3
-
18
-
-
77951296086
-
Clustering based on random graph model embedding vertex features
-
H. Zanghi, S. Volant, and C. Ambroise. Clustering based on random graph model embedding vertex features. Pattern Recognition Letters, 31(9):830-836, 2010.
-
(2010)
Pattern Recognition Letters
, vol.31
, Issue.9
, pp. 830-836
-
-
Zanghi, H.1
Volant, S.2
Ambroise, C.3
-
19
-
-
77955045035
-
Graph clustering based on structural/attribute similarities
-
Y. Zhou, H. Cheng, and J. X. Yu. Graph clustering based on structural/attribute similarities. PVLDB, 2(1):718-729, 2009.
-
(2009)
PVLDB
, vol.2
, Issue.1
, pp. 718-729
-
-
Zhou, Y.1
Cheng, H.2
Yu, J.X.3
-
20
-
-
79951739260
-
Clustering large attributed graphs: An efficient incremental approach
-
Y. Zhou, H. Cheng, and J. X. Yu. Clustering large attributed graphs: An efficient incremental approach. In ICDM, pages 689-698, 2010.
-
(2010)
ICDM
, pp. 689-698
-
-
Zhou, Y.1
Cheng, H.2
Yu, J.X.3
|