메뉴 건너뛰기




Volumn , Issue , 2012, Pages 120-125

DIFSoN: Discovering influential friends from social networks

Author keywords

Applications on social networks; computational aspects of social networks; influential person; knowledge discovery and data mining; social network computing

Indexed keywords

COMPUTATIONAL MODEL; INFLUENTIAL PERSON; KNOWLEDGE DISCOVERY AND DATA MININGS; KNOWLEDGE-SHARING; SOCIAL COMPUTING; SOCIAL ENTITIES; SOCIAL NETWORKS; USER CHARACTERISTICS;

EID: 84874068223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CASoN.2012.6412389     Document Type: Conference Paper
Times cited : (9)

References (18)
  • 1
    • 0001882616 scopus 로고
    • Fast algorithms for mining association rules in large databases
    • R. Agrawal & R. Srikant, "Fast algorithms for mining association rules in large databases," in Proc. VLDB 1994, pp. 487-499.
    • (1994) Proc. VLDB , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 2
    • 80052717540 scopus 로고    scopus 로고
    • Finding and matching communities in social networks using data mining
    • S. Alsaleh, R. Nayak & Y. Xu, "Finding and matching communities in social networks using data mining," in Proc. ASONAM 2011, pp. 389-393.
    • (2011) Proc. ASONAM , pp. 389-393
    • Alsaleh, S.1    Nayak, R.2    Xu, Y.3
  • 3
    • 84856188456 scopus 로고    scopus 로고
    • Unveiling hidden patterns to find social relevance
    • E.-A. Baatarjav & R. Dantu, "Unveiling hidden patterns to find social relevance," in Proc. IEEE SocialCom 2011, pp. 242-249.
    • (2011) Proc. IEEE SocialCom , pp. 242-249
    • Baatarjav, E.-A.1    Dantu, R.2
  • 4
    • 84858044308 scopus 로고    scopus 로고
    • Maximizing product adoption in social networks
    • S. Bhagat, A. Goyal & L.V.S. Lakshmanan, "Maximizing product adoption in social networks," in Proc. ACM WSDM 2012, pp. 603-612.
    • (2012) Proc. ACM WSDM , pp. 603-612
    • Bhagat, S.1    Goyal, A.2    Lakshmanan, L.V.S.3
  • 5
    • 84856097545 scopus 로고    scopus 로고
    • Finding strong groups of friends among friends in social networks
    • J.J. Cameron, C.K.-S. Leung & S.K. Tanbeer, "Finding strong groups of friends among friends in social networks," in Proc. SCA 2011, pp. 824-831.
    • (2011) Proc. SCA , pp. 824-831
    • Cameron, J.J.1    Leung, C.K.-S.2    Tanbeer, S.K.3
  • 6
    • 78650315426 scopus 로고    scopus 로고
    • A brief survey on deanonymization attacks in online social networks
    • X. Ding, L. Zhang, Z. Wan & M. Gu, "A brief survey on deanonymization attacks in online social networks," in Proc. CASoN 2010, pp. 611-615.
    • (2010) Proc. CASoN , pp. 611-615
    • Ding, X.1    Zhang, L.2    Wan, Z.3    Gu, M.4
  • 7
    • 77958172297 scopus 로고    scopus 로고
    • Virus propagation modeling in Facebook
    • W. Fan & K.H. Yeung, "Virus propagation modeling in Facebook," in Proc. ASONAM 2010, pp. 331-335.
    • (2010) Proc. ASONAM , pp. 331-335
    • Fan, W.1    Yeung, K.H.2
  • 8
    • 84865104073 scopus 로고    scopus 로고
    • QK-means: A clustering technique based on community detection and K-means for deployment of cluster head nodes
    • L.N. Ferreira, A.R. Pinto & L. Zhao, "QK-means: a clustering technique based on community detection and K-means for deployment of cluster head nodes," in Proc. IJCNN 2012.
    • (2012) Proc. IJCNN
    • Ferreira, L.N.1    Pinto, A.R.2    Zhao, L.3
  • 9
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han, J. Pei & Y. Yin, "Mining frequent patterns without candidate generation," in Proc. ACM SIGMOD 2000, pp. 1-12.
    • (2000) Proc. ACM SIGMOD , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 10
    • 84055199793 scopus 로고    scopus 로고
    • Forcoa.NET: An interactive tool for exploring the significance of authorship networks in DBLP data
    • Z. Horak, M. Kudelka, V. Snasel, A. Abraham & H. Rezankova, "Forcoa.NET: an interactive tool for exploring the significance of authorship networks in DBLP data," in Proc. CASoN 2011, pp. 261-266.
    • (2011) Proc. CASoN , pp. 261-266
    • Horak, Z.1    Kudelka, M.2    Snasel, V.3    Abraham, A.4    Rezankova, H.5
  • 12
    • 78649257625 scopus 로고    scopus 로고
    • Exploring social networks: A frequent pattern visualization approach
    • C.K.-S. Leung & C.L. Carmichael, "Exploring social networks: a frequent pattern visualization approach," in Proc. IEEE SocialCom 2010, pp. 419-424.
    • (2010) Proc. IEEE SocialCom , pp. 419-424
    • Leung, C.K.-S.1    Carmichael, C.L.2
  • 13
    • 79960301265 scopus 로고    scopus 로고
    • Visual analytics of social networks: Mining and visualizing co-authorship networks
    • C.K.-S. Leung, C.L. Carmichael & E.W. Teh, "Visual analytics of social networks: mining and visualizing co-authorship networks," in Proc. HCII-FAC 2011, pp. 335-345.
    • (2011) Proc. HCII-FAC , pp. 335-345
    • Leung, C.K.-S.1    Carmichael, C.L.2    Teh, E.W.3
  • 14
  • 15
    • 84860854462 scopus 로고    scopus 로고
    • Community detection in incomplete information networks
    • W. Lin, X. Kong, P.S. Yu, Q. Wu, Y. Jia & C. Li, "Community detection in incomplete information networks," in Proc. WWW 2012, pp. 341-350.
    • (2012) Proc. WWW , pp. 341-350
    • Lin, W.1    Kong, X.2    Yu, P.S.3    Wu, Q.4    Jia, Y.5    Li, C.6
  • 16
    • 80054068407 scopus 로고    scopus 로고
    • Tadvise: A twitter assistant based on twitter lists
    • P. Nasirifard & C. Hayes, "Tadvise: a twitter assistant based on twitter lists," in Proc. SocInfo 2011, pp. 153-160.
    • (2011) Proc. SocInfo , pp. 153-160
    • Nasirifard, P.1    Hayes, C.2
  • 17
    • 84866033813 scopus 로고    scopus 로고
    • A framework for summarizing and analyzing twitter feeds
    • X. Yang, A. Ghoting, Y. Ruan & S. Parthasarathy, "A framework for summarizing and analyzing twitter feeds," in Proc. ACM KDD 2012, pp. 370-378.
    • (2012) Proc. ACM KDD , pp. 370-378
    • Yang, X.1    Ghoting, A.2    Ruan, Y.3    Parthasarathy, S.4
  • 18
    • 84880087434 scopus 로고    scopus 로고
    • WFIM: Weighted frequent itemset mining with a weight range and a minimum weight
    • U. Yun & J.J. Leggett, "WFIM: weighted frequent itemset mining with a weight range and a minimum weight," in Proc. SIAM SDM 2005, pp. 636-640.
    • (2005) Proc. SIAM SDM , pp. 636-640
    • Yun, U.1    Leggett, J.J.2


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