메뉴 건너뛰기




Volumn 8443 LNAI, Issue PART 1, 2014, Pages 126-138

Inferring strange behavior from connectivity pattern in social networks

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; LOCKS (FASTENERS); SOCIAL NETWORKING (ONLINE);

EID: 84901261504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-06608-0_11     Document Type: Conference Paper
Times cited : (65)

References (17)
  • 1
    • 77949360833 scopus 로고    scopus 로고
    • Fraud detection in telecommunications: History and lessons learned
    • Becker, R.A., Volinsky, C., Wilks, A.R.: Fraud detection in telecommunications: History and lessons learned. Technometrics 52(1) (2010)
    • (2010) Technometrics , vol.52 , Issue.1
    • Becker, R.A.1    Volinsky, C.2    Wilks, A.R.3
  • 5
    • 74049087026 scopus 로고    scopus 로고
    • Community detection in graphs
    • Fortunato, S.: Community detection in graphs. Physics Reports 486(3), 75-174 (2010)
    • (2010) Physics Reports , vol.486 , Issue.3 , pp. 75-174
    • Fortunato, S.1
  • 6
    • 84861732705 scopus 로고    scopus 로고
    • Dense subgraph extraction with application to community detection
    • Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. IEEE Transactions on Knowledge and Data Engineering 24(7), 1216-1230 (2012)
    • (2012) IEEE Transactions on Knowledge and Data Engineering , vol.24 , Issue.7 , pp. 1216-1230
    • Chen, J.1    Saad, Y.2
  • 8
    • 84893603294 scopus 로고    scopus 로고
    • Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors
    • Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. Springer, Heidelberg
    • Günnemann, S., Boden, B., Färber, I., Seidl, T.: Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS, vol. 7818, pp. 261-275. Springer, Heidelberg (2013)
    • (2013) LNCS , vol.7818 , pp. 261-275
    • Günnemann, S.1    Boden, B.2    Färber, I.3    Seidl, T.4
  • 9
    • 0037058980 scopus 로고    scopus 로고
    • The average distances in random graphs with given expected degrees
    • Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proceedings of the National Academy of Sciences 99(25), 15879-15882 (2002)
    • (2002) Proceedings of the National Academy of Sciences , vol.99 , Issue.25 , pp. 15879-15882
    • Chung, F.1    Lu, L.2
  • 10
    • 41349117788 scopus 로고    scopus 로고
    • Finding community structure in very large networks
    • Clauset, A., Newman, M.E., Moore, C.: Finding community structure in very large networks. Physical Review E 70(6), 066111 (2004)
    • (2004) Physical Review e , vol.70 , Issue.6 , pp. 066111
    • Clauset, A.1    Newman, M.E.2    Moore, C.3
  • 14
    • 79956333190 scopus 로고    scopus 로고
    • Eigen-Spokes: Surprising patterns and scalable community chipping in large graphs
    • Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. Springer, Heidelberg
    • Prakash, B.A., Sridharan, A., Seshadri, M., Machiraju, S., Faloutsos, C.: Eigen-Spokes: Surprising patterns and scalable community chipping in large graphs. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010. LNCS, vol. 6119, pp. 435-448. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6119 , pp. 435-448
    • Prakash, B.A.1    Sridharan, A.2    Seshadri, M.3    Machiraju, S.4    Faloutsos, C.5


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.