{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:33Z","timestamp":1750306413056,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":21,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1145\/2790798.2790802","type":"proceedings-article","created":{"date-parts":[[2015,9,8]],"date-time":"2015-09-08T12:36:32Z","timestamp":1441715792000},"page":"28-37","source":"Crossref","is-referenced-by-count":8,"title":["Big Social Network Mining for \"Following\" Patterns"],"prefix":"10.1145","author":[{"given":"Fan","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyoji","family":"Kawagoe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carson K.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2790798.2790802-1","doi-asserted-by":"crossref","unstructured":"P. Braun, A. Cuzzocrea, C.K. Leung, R.K. MacKinnon, and S.K. Tanbeer. A tree-based algorithm for mining diverse social entities. Procedia Computer Science, 35, pp. 223--232, 2014.","DOI":"10.1016\/j.procs.2014.08.102"},{"key":"key-10.1145\/2790798.2790802-2","doi-asserted-by":"crossref","unstructured":"J. Dean and S. Ghemawat. MapReduce: simplified data processing on large clusters. Communications of the ACM, 51(1), pp. 107--113, Jan. 2008.","DOI":"10.1145\/1327452.1327492"},{"key":"key-10.1145\/2790798.2790802-3","doi-asserted-by":"crossref","unstructured":"N. Dhahri, C. Trabelsi, and S.B. Yahia. RssE-Miner: a new approach for efficient events mining from social media RSS feeds. In Proc. DaWaK 2012, pp. 253--264. Springer.","DOI":"10.1007\/978-3-642-32584-7_21"},{"key":"key-10.1145\/2790798.2790802-4","unstructured":"Facebook newsroom - company info. http:\/\/newsroom.fb.com\/company-info\/"},{"key":"key-10.1145\/2790798.2790802-5","doi-asserted-by":"crossref","unstructured":"F. Jiang and C.K. Leung. A business intelligence solution for frequent pattern mining on social networks. In Proc. IEEE ICDM Workshops 2014, pp. 789--796.","DOI":"10.1109\/ICDMW.2014.128"},{"key":"key-10.1145\/2790798.2790802-6","doi-asserted-by":"crossref","unstructured":"F. Jiang and C.K. Leung. Mining interesting \"following\" patterns from social networks. In Proc. DaWaK 2014, pp. 308--319. Springer.","DOI":"10.1007\/978-3-319-10160-6_28"},{"key":"key-10.1145\/2790798.2790802-7","doi-asserted-by":"crossref","unstructured":"F. Jiang, C.K. Leung, D. Liu, A.M. Peddle. Discovery of really popular friends from social networks. In Proc. IEEE BDCloud 2014, pp. 342--349.","DOI":"10.1109\/BDCloud.2014.110"},{"key":"key-10.1145\/2790798.2790802-8","doi-asserted-by":"crossref","unstructured":"C.K. Leung, I.J. M. Medina, and S.K. Tanbeer. Analyzing social networks to mine important friends. In G. Xu and L. Li (eds.), Social media mining and social network analysis: emerging research, pp. 90--104.","DOI":"10.4018\/978-1-4666-2806-9.ch006"},{"key":"key-10.1145\/2790798.2790802-9","doi-asserted-by":"crossref","unstructured":"C.K. Leung and S.K. Tanbeer. Mining popular patterns from transactional databases. In Proc. DaWaK 2012, pp. 291--302. Springer.","DOI":"10.1007\/978-3-642-32584-7_24"},{"key":"key-10.1145\/2790798.2790802-10","doi-asserted-by":"crossref","unstructured":"C.K. Leung, S.K. Tanbeer, and J.J. Cameron. Interactive discovery of influential friends from social networks. Social Network Analysis and Mining, 4(1), article 154, 2014.","DOI":"10.1007\/s13278-014-0154-z"},{"key":"key-10.1145\/2790798.2790802-11","doi-asserted-by":"crossref","unstructured":"W. Lin, X. Kong, P.S. Yu, Q. Wu, Y. Jia, and C. Li. Community detection in incomplete information networks. In Proc. WWW 2012, pp. 341--350. ACM Press.","DOI":"10.1145\/2187836.2187883"},{"key":"key-10.1145\/2790798.2790802-12","doi-asserted-by":"crossref","unstructured":"L. Ma, H. Huang, Q. He, K. Chiew, J. Wu, and Y. Che. GMAC: a seed-insensitive approach to local community detection. In Proc. DaWaK 2013, pp. 297--308. Springer.","DOI":"10.1007\/978-3-642-40131-2_26"},{"key":"key-10.1145\/2790798.2790802-13","doi-asserted-by":"crossref","unstructured":"S. Madden. From databases to big data. IEEE Internet Computing, 16(3), pp. 4--6, May--June 2012.","DOI":"10.1109\/MIC.2012.50"},{"key":"key-10.1145\/2790798.2790802-14","doi-asserted-by":"crossref","unstructured":"T.S. Mumu and C.I. Ezeife. Discovering community preference influence network by social network opinion posts mining. In Proc. DaWaK 2014, pp. 136--145. Springer.","DOI":"10.1007\/978-3-319-10160-6_13"},{"key":"key-10.1145\/2790798.2790802-15","doi-asserted-by":"crossref","unstructured":"S.K. Tanbeer, F. Jiang, C.K. Leung, R.K. MacKinnon, and I.J.M. Medina. Finding groups of friends who are significant across multiple domains in social networks. In Proc. CASoN 2013, pp. 21--26. IEEE Computer Society.","DOI":"10.1109\/CASoN.2013.6622608"},{"key":"key-10.1145\/2790798.2790802-16","doi-asserted-by":"crossref","unstructured":"S.K. Tanbeer and C.K. Leung. Finding diverse friends in social networks. In Proc. APWeb 2013, pp. 301--309. Springer.","DOI":"10.1007\/978-3-642-37401-2_31"},{"key":"key-10.1145\/2790798.2790802-17","doi-asserted-by":"crossref","unstructured":"S.K. Tanbeer, C.K. Leung, and J.J. Cameron. Interactive mining of strong friends from social networks and its applications in e-commerce. Journal of Organizational Computing and Electronic Commerce, 24(2--3), pp. 157--173, 2014.","DOI":"10.1080\/10919392.2014.896715"},{"key":"key-10.1145\/2790798.2790802-18","unstructured":"Twitter - about company. https:\/\/about.twitter.com\/company"},{"key":"key-10.1145\/2790798.2790802-19","doi-asserted-by":"crossref","unstructured":"E.H.-C. Wei, Y.S. Koh, and G. Dobbie. Finding maximal overlapping communities. In Proc. DaWaK 2013, pp. 309--316. Springer.","DOI":"10.1007\/978-3-642-40131-2_27"},{"key":"key-10.1145\/2790798.2790802-20","doi-asserted-by":"crossref","unstructured":"S.-H. Yang, A. Kolcz, A. Schlaikjer, and P. Gupta. Large-scale high-precision topic modeling on Twitter. In Proc. ACM KDD 2014, pp. 1907--1916.","DOI":"10.1145\/2623330.2623336"},{"key":"key-10.1145\/2790798.2790802-21","doi-asserted-by":"crossref","unstructured":"W. Yu, F. Coenen, M. Zito, and S. El-Salhi. Minimal vertex unique labelled subgraph mining. DaWaK 2013; 317--326. Springer.","DOI":"10.1007\/978-3-642-40131-2_28"}],"event":{"number":"8","sponsor":["BytePress","Keio University"],"acronym":"C3S2E '15","name":"the Eighth International C* Conference","start":{"date-parts":[[2015,7,13]]},"location":"Yokohama, Japan","end":{"date-parts":[[2015,7,15]]}},"container-title":["Proceedings of the Eighth International C* Conference on Computer Science & Software Engineering - C3S2E '15"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2790798.2790802","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2790802&ftid=1617557&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:46Z","timestamp":1750223266000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2790798.2790802"}},"subtitle":[],"proceedings-subject":"Computer Science & Software Engineering","short-title":[],"issued":{"date-parts":[[2008]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1145\/2790798.2790802","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}