{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T01:34:51Z","timestamp":1774316091339,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319458137","type":"print"},{"value":"9783319458144","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45814-4_26","type":"book-chapter","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T02:23:54Z","timestamp":1473992634000},"page":"316-328","source":"Crossref","is-referenced-by-count":11,"title":["B-mine: Frequent Pattern Mining and Its Application to Knowledge Discovery from Social Networks"],"prefix":"10.1007","author":[{"given":"Fan","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Carson K.","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,17]]},"reference":[{"key":"26_CR1","unstructured":"Aggarwal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of VLDB, pp. 487\u2013399 (1994)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/978-3-319-11116-2_56","volume-title":"Web Technologies and Applications","author":"A Cuzzocrea","year":"2014","unstructured":"Cuzzocrea, A., Jiang, F., Lee, W., Leung, C.K.: Efficient frequent itemset mining from dense data streams. In: Chen, L., Jia, Y., Sellis, T., Liu, G. (eds.) APWeb 2014. LNCS, vol. 8709, pp. 593\u2013601. Springer, Heidelberg (2014)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Leung, C.K., Carmichael, C.L.: Exploring social networks: a frequent pattern visualization approach. In: Proceedings of IEEE SocialCom, pp. 419\u2013424 (2010)","DOI":"10.1109\/SocialCom.2010.67"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","first-page":"335","volume-title":"Foundations of Augmented Cognition","author":"CK-S Leung","year":"2011","unstructured":"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. LNCS (LNAI), vol. 6780, pp. 335\u2013345. Springer, Heidelberg (2011)"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Leung, C.K., Jiang, F., Pazdor, A.G.M., Peddle, A.M.: Parallel social network mining for interesting \u2018following\u2019 patterns. Concurrency Comput. Pract. Experience (2016). doi: 10.1002\/cpe.3773","DOI":"10.1002\/cpe.3773"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s13278-014-0154-z","volume":"4","author":"CK Leung","year":"2014","unstructured":"Leung, C.K., Tanbeer, S.K., Cameron, J.J.: Interactive discovery of influential friends from social networks. Soc. Netw. Anal. Min. 4(1), 13 (2014). doi: 10.1007\/s13278-014-0154-z . Article no. 154","journal-title":"Soc. Netw. Anal. Min."},{"issue":"2","key":"26_CR8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.3233\/KES-160332","volume":"20","author":"CK Leung","year":"2016","unstructured":"Leung, C.K., Tanbeer, S.K., Cuzzocrea, A., Braun, P., MacKinnon, R.K.: Interactive mining of diverse social entities. KES J. 20(2), 97\u2013111 (2016)","journal-title":"KES J."},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/978-3-319-25255-1_52","volume-title":"Web Technologies and Applications","author":"JC Lin","year":"2015","unstructured":"Lin, J.C., Gan, W., Fournier-Viger, P., Hong, T.: Mining weighted frequent itemsets with the recency constraint. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds.) APWeb 2015. LNCS, vol. 9313, pp. 635\u2013646. Springer, Heidelberg (2015)"},{"key":"26_CR10","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-mine: hyper-structure mining of frequent patterns in large databases. In: Proceedings of IEEE ICDM, pp. 441\u2013448 (2001)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Rahman, Q.M., Fariha, A., Mandal, A., Ahmed, C.F., Leung, C.K.: A sliding window-based algorithm for detecting leaders from social network action streams. In: Proceedings of IEEE\/WIC\/ACM WI-IAT, vol. 1, pp. 133\u2013136 (2015)","DOI":"10.1109\/WI-IAT.2015.24"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-642-35386-4_18","volume-title":"Social Informatics","author":"M Schaal","year":"2012","unstructured":"Schaal, M., O\u2019Donovan, J., Smyth, B.: An analysis of topical proximity in the Twitter social graph. In: Aberer, K., Flache, A., Jager, W., Liu, L., Tang, J., Gu\u00e9ret, C. (eds.) SocInfo 2012. LNCS, vol. 7710, pp. 232\u2013245. Springer, Heidelberg (2012)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Shenoy, P., Bhalotia, J.R., Bawa, M., Shah, D.: Turbo-charging vertical mining of large databases. In: Proceedings of ACM SIGMOD, pp. 22\u201333 (2000)","DOI":"10.1145\/342009.335376"},{"issue":"2\u20133","key":"26_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1080\/10919392.2014.896715","volume":"24","author":"SK Tanbeer","year":"2014","unstructured":"Tanbeer, S.K., Leung, C.K., Cameron, J.J.: Interactive mining of strong friends from social networks and its applications in e-commerce. J. Organ. Comput. Electron. Commer. (JOCEC) 24(2\u20133), 157\u2013173 (2014)","journal-title":"J. Organ. Comput. Electron. Commer. (JOCEC)"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-47887-6_34","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"K Wang","year":"2002","unstructured":"Wang, K., Tang, L., Han, J., Liu, J.: Top down FP-growth for association rule mining. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 334\u2013340. Springer, Heidelberg (2002)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1007\/978-3-319-25255-1_63","volume-title":"Web Technologies and Applications","author":"W Tong","year":"2015","unstructured":"Tong, W., Leung, C.K., Liu, D., Yu, J.: Probabilistic frequent pattern mining by PUH-Mine. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds.) APWeb 2015. LNCS, vol. 9313, pp. 768\u2013780. Springer, Heidelberg (2015)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-642-37453-1_18","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Xu","year":"2013","unstructured":"Xu, H., Yang, Y., Wang, L., Liu, W.: Node classification in social network via a factor graph model. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS (LNAI), vol. 7818, pp. 213\u2013224. Springer, Heidelberg (2013)"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Yang, X., Ghoting, A., Ruan, Y., Parthasarathy, S.: A framework for summarizing and analyzing Twitter feeds. In: Proceedings of ACM KDD, pp. 370\u2013378 (2012)","DOI":"10.1145\/2339530.2339591"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Yuan, Q., Cong, G., Ma, Z., Sun, A., Magnenat-Thalmann, N.: Who, where, when and what: discover spatio-temporal topics for Twitter users. In: Proceedings of ACM KDD, pp. 605\u2013613 (2013)","DOI":"10.1145\/2487575.2487576"},{"issue":"3","key":"26_CR20","first-page":"372","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki, M.J.: Scalable algorithms for association mining. IEEE TKDE 12(3), 372\u2013390 (2000)","journal-title":"IEEE TKDE"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","first-page":"55","volume-title":"Web Technologies and Applications","author":"Y Zhang","year":"2015","unstructured":"Zhang, Y., Pang, J.: Distance and friendship: a distance-based model for link prediction in social networks. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds.) APWeb 2015. LNCS, vol. 9313, pp. 55\u201366. Springer, Heidelberg (2015)"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45814-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T15:34:37Z","timestamp":1568388877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45814-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319458137","9783319458144"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45814-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}