Abstract
The emergence of Web-based communities and hosted services such as social networking sites has facilitated collaboration and knowledge sharing between users. Hence, it has become important to mine this vast pool of data in social networks, which are generally made of users linked by some specific interdependency such as friendship. For any user, some groups of his friends are more significant than others. In this paper, we propose a tree-based algorithm to mine social networks to help these users to distinguish their significant friend groups from all the friends in their social networks.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994, pp. 487–499 (1994)
Cameron, J.J., Leung, C.K.-S., Tanbeer, S.K.: Finding strong groups of friends among friends in social networks. In: IEEE DASC (SCA) 2011, pp. 824–831 (2011)
Carrington, P.J., Scott, J., Wasserman, S. (eds.): Models and Methods in Social Network Analysis. Cambridge University Press (2005)
Fan, W., Yeung, K.H.: Virus propagation modeling in Facebook. In: ASONAM 2010, pp. 331–335 (2010)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM SIGMOD 2000, pp. 1–12 (2000)
Lee, W., Lee, J.J.-H., Song, J.J., Eom, C.S.-H.: Maximum reliable tree for social network search. In: IEEE DASC (CSN) 2011, pp. 1243–1249 (2011)
Leung, C.K.-S., Carmichael, C.L.: Exploring social networks: a frequent pattern visualization approach. In: IEEE SocialCom 2010, pp. 419–424 (2010)
Leung, C.K.-S., Carmichael, C.L., Teh, E.W.: Visual Analytics of Social Networks: Mining and Visualizing Co-authorship Networks. In: Schmorrow, D.D., Fidopiastis, C.M. (eds.) FAC 2011, HCII 2011. LNCS (LNAI), vol. 6780, pp. 335–345. Springer, Heidelberg (2011)
Li, Y.-C., Yeh, J.-S., Chang, C.-C.: Isolated items discarding strategy for discovering high utility itemsets. DKE 64(1), 198–217 (2008)
Liu, H., Yu, P.S., Agarwal, N., Suel, T.: Guest editors’ introduction: social computing in the blogosphere. IEEE Internet Computing 14(2), 12–14 (2010)
Liu, Y., Liao, W.-k., Choudhary, A.K.: A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689–695. Springer, Heidelberg (2005)
Obradovic, D., Pimenta, F., Dengel, A.: Mining shared social media links to support clustering of blog articles. In: CASoN 2011, pp. 181–184 (2011)
Pennacchiotti, M., Popescu, A.-M.: Democrats, republicans and starbucks afficionados: user classification in Twitter. In: ACM KDD 2011, pp. 430–438 (2011)
Tang, C., Ross, K., Saxena, N., Chen, R.: What’s in a Name: A Study of Names, Gender Inference, and Gender Behavior in Facebook. In: Xu, J., Yu, G., Zhou, S., Unland, R. (eds.) DASFAA Workshops 2011. LNCS, vol. 6637, pp. 344–356. Springer, Heidelberg (2011)
Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press (1994)
Weng, J., Lim, E.-P., Jiang, J., He, Q.: TwitterRank: finding topic-sensitive influential twitterers. In: ACM WSDM 2010, pp. 261–270 (2010)
Xu, G., Zong, Y., Pan, R., Dolog, P., Jin, P.: On Kernel Information Propagation for Tag Clustering in Social Annotation Systems. In: König, A., Dengel, A., Hinkelmann, K., Kise, K., Howlett, R.J., Jain, L.C. (eds.) KES 2011, Part II. LNCS (LNAI), vol. 6882, pp. 505–514. Springer, Heidelberg (2011)
Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: SDM 2004, pp. 482–486 (2004)
Ye, S., Wu, S.F.: Measuring Message Propagation and Social Influence on Twitter.com. In: Bolc, L., Makowski, M., Wierzbicki, A. (eds.) SocInfo 2010. LNCS, vol. 6430, pp. 216–231. Springer, Heidelberg (2010)
Yumoto, T., Sumiya, K.: Measuring Attention Intensity to Web Pages Based on Specificity of Social Tags. In: Yoshikawa, M., Meng, X., Yumoto, T., Ma, Q., Sun, L., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 6193, pp. 264–273. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leung, C.KS., Tanbeer, S.K. (2012). Mining Social Networks for Significant Friend Groups. In: Yu, H., Yu, G., Hsu, W., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29023-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-29023-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29022-0
Online ISBN: 978-3-642-29023-7
eBook Packages: Computer ScienceComputer Science (R0)