메뉴 건너뛰기




Volumn , Issue , 2013, Pages 21-26

Finding groups of friends who are significant across multiple domains in social networks

Author keywords

Applications on social networks; Computational aspects of social networks; Knowledge discovery and data mining; Social computing; Social network analysis and mining

Indexed keywords

DATA MINING; SOCIAL SCIENCES COMPUTING;

EID: 84889000405     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CASoN.2013.6622608     Document Type: Conference Paper
Times cited : (17)

References (24)
  • 2
    • 0002221136 scopus 로고    scopus 로고
    • Fast algorithms for mining association rules in large databases
    • R. Agrawal & R. Srikant, "Fast algorithms for mining association rules in large databases" in VLDB 1994, pp. 487-499.
    • VLDB 1994 , pp. 487-499
    • Agrawal, R.1    Srikant, R.2
  • 3
    • 84874086750 scopus 로고    scopus 로고
    • Cross-domain vulnerabilities over social networks
    • c. Bernard, H. Debar, & S. Benayoune, "Cross-domain vulnerabilities over social networks" in CASoN 2012, pp. 8-13.
    • CASoN 2012 , pp. 8-13
    • Bernard, C.1    Debar, H.2    Benayoune, S.3
  • 4
  • 5
    • 84880001890 scopus 로고    scopus 로고
    • Mining frequent itemsets from sparse data streams in limited memory environments
    • J.J. Cameron, A. Cuzzocrea, F Jiang, & C.K.-S. Leung, "Mining frequent itemsets from sparse data streams in limited memory environments" in WAIM 2013 pp. 51-57.
    • WAIM 2013 , pp. 51-57
    • Cameron, J.J.1    Cuzzocrea, A.2    Jiang, F.3    Leung, C.K.-S.4
  • 7
    • 78650315426 scopus 로고    scopus 로고
    • A brief survey on de-anonymization attacks in online social networks
    • X. Ding, L. Zhang, Z. Wan, & M.L. Gu, "A brief survey on de-anonymization attacks in online social networks" in CASoN 2010, pp. 611-615.
    • CASoN 2010 , pp. 611-615
    • Ding, X.1    Zhang, L.2    Wan, Z.3    Gu, M.L.4
  • 8
    • 84884495381 scopus 로고    scopus 로고
    • Stream mining of frequent patterns from delayed batches of uncertain data
    • F Jiang & C.K.-S. Leung, "Stream mining of frequent patterns from delayed batches of uncertain data" in DaWaK 2013, pp. 209-221.
    • DaWaK 2013 , pp. 209-221
    • Jiang, F.1    Leung, C.K.-S.2
  • 9
    • 84874597178 scopus 로고    scopus 로고
    • Finding popular friends in social networks
    • F Jiang, C.K.-S. Leung, & S.K. Tanbeer, "Finding popular friends in social networks" in SCA 2012, pp. 501-508.
    • SCA 2012 , pp. 501-508
    • Jiang, F.1    Leung, C.K.-S.2    Tanbeer, S.K.3
  • 10
    • 0039253846 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation
    • J. Han, J. Pei, & Y. Yin, "Mining frequent patterns without candidate generation" in ACM SIGMOD 2000, pp. 1-12.
    • ACM SIGMOD 2000 , pp. 1-12
    • Han, J.1    Pei, J.2    Yin, Y.3
  • 11
    • 84894205603 scopus 로고    scopus 로고
    • Discovering frequent patterns from uncertain data streams with time-fading and landmark models
    • C.K.-S. Leung, A. Cuzzocrea, & F Jiang, "Discovering frequent patterns from uncertain data streams with time-fading and landmark models" TLDKS, 8, pp. 174-196, 2013.
    • (2013) TLDKS , vol.8 , pp. 174-196
    • Leung, C.K.-S.1    Cuzzocrea, A.2    Jiang, F.3
  • 12
    • 84880032146 scopus 로고    scopus 로고
    • Mining frequent patterns from uncertain data with MapReduce for big data analytics
    • C.K.-S. Leung & Y Hayduk, "Mining frequent patterns from uncertain data with MapReduce for Big Data analytics" in DASFAA 2013, Part I, pp. 440-455.
    • DASFAA 2013 , Issue.PART I , pp. 440-455
    • Leung, C.K.-S.1    Hayduk, Y.2
  • 14
    • 84872797844 scopus 로고    scopus 로고
    • Mining social networks for significant friend groups
    • C.K.-S. Leung & S.K. Tanbeer, "Mining social networks for significant friend groups" in DASFAA 2012 Workshops, pp. 180-192.
    • DASFAA 2012 Workshops , pp. 180-192
    • Leung, C.K.-S.1    Tanbeer, S.K.2
  • 15
    • 84893540013 scopus 로고    scopus 로고
    • PUF-tree: A compact tree structure for frequent pattern mining of uncertain data
    • C.K.-S. Leung & S.K. Tanbeer, "PUF-tree: a compact tree structure for frequent pattern mining of uncertain data" in PAKDD 2013, Part I, pp. 13-25.
    • PAKDD 2013 , Issue.PART I , pp. 13-25
    • Leung, C.K.-S.1    Tanbeer, S.K.2
  • 16
    • 36148952566 scopus 로고    scopus 로고
    • Isolated items discarding strategy for discovering high utility itemsets
    • Y-c. Li, J.-S. Yeh, & C.-C. Chang, "Isolated items discarding strategy for discovering high utility itemsets" DKE, 64(1), pp. 198-217, 2008.
    • (2008) DKE , vol.64 , Issue.1 , pp. 198-217
    • Li, Y.-C.1    Yeh, J.-S.2    Chang, C.-C.3
  • 17
    • 77949547864 scopus 로고    scopus 로고
    • Guest editors' introduction: Social computing in the blogosphere
    • H. Liu, P.S. Yu, N. Agarwal, & T Suel, "Guest editors' introduction: social computing in the blogosphere" IEEE Internet Computing, 14(2), pp. 12-14, 2010.
    • (2010) IEEE Internet Computing , vol.14 , Issue.2 , pp. 12-14
    • Liu, H.1    Yu, P.S.2    Agarwal, N.3    Suel, T.4
  • 18
    • 26944496038 scopus 로고    scopus 로고
    • A two phase algorithm for fast discovery of high utility of itemsets
    • Y Liu, W.-K. Liao, & A. Choudhary, "A two phase algorithm for fast discovery of high utility of itemsets" in PAKDD 2005, pp. 689-695.
    • PAKDD 2005 , pp. 689-695
    • Liu, Y.1    Liao, W.-K.2    Choudhary, A.3
  • 19
    • 84875869542 scopus 로고    scopus 로고
    • Finding diverse friends in social networks
    • S.K. Tanbeer & C.K.-S. Leung, "Finding diverse friends in social networks" in APWeb 2013, pp. 301-309.
    • APWeb 2013 , pp. 301-309
    • Tanbeer, S.K.1    Leung, C.K.-S.2
  • 20
    • 84874068223 scopus 로고    scopus 로고
    • DIFSoN: Discovering influential friends from social networks
    • S.K. Tanbeer, C.K.-S. Leung, & J.J. Cameron, "DIFSoN: Discovering influential friends from social networks" in CASoN 2012, pp. 120-125.
    • CASoN 2012 , pp. 120-125
    • Tanbeer, S.K.1    Leung, C.K.-S.2    Cameron, J.J.3
  • 22
    • 2942590769 scopus 로고    scopus 로고
    • A foundational approach to mining itemset utilities from databases
    • H. Yao, H, J. Hamilton, & C. J. Butz, "A foundational approach to mining itemset utilities from databases" in SDM 2004, pp. 482-486.
    • SDM 2004 , pp. 482-486
    • Yao, H.1    Hamilton, H.J.2    Butz, C.J.3
  • 23
    • 78449274533 scopus 로고    scopus 로고
    • Measuring message propagation and social influence on twitter.com
    • S. Ye & S.F. Wu, "Measuring message propagation and social influence on twitter.com" in SocInfo 2010, pp. 216-231.
    • SocInfo 2010 , pp. 216-231
    • Ye, S.1    Wu, S.F.2
  • 24
    • 84874224966 scopus 로고    scopus 로고
    • LaFT-tree: Perceiving the expansion trace of one's circle of friends in online social networks
    • J. Zhang, C. Wang, J. Wang, & P.S. Yu, "LaFT-tree: perceiving the expansion trace of one's circle of friends in online social networks" in ACM WSDM 2013, pp. 597-606.
    • ACM WSDM 2013 , pp. 597-606
    • Zhang, J.1    Wang, C.2    Wang, J.3    Yu, P.S.4


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