{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:14:38Z","timestamp":1778580878319,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10618-013-0331-0","type":"journal-article","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T12:05:06Z","timestamp":1374062706000},"page":"294-320","source":"Crossref","is-referenced-by-count":123,"title":["ABACUS: frequent pAttern mining-BAsed Community discovery in mUltidimensional networkS"],"prefix":"10.1007","volume":"27","author":[{"given":"Michele","family":"Berlingerio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Pinelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Calabrese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,18]]},"reference":[{"key":"331_CR1","doi-asserted-by":"crossref","unstructured":"Ahn YY, Bagrow JP, Lehmann S (2010) Link communities reveal multi-scale complexity in networks. Nature 466:761\u2013764","DOI":"10.1038\/nature09182"},{"key":"331_CR2","doi-asserted-by":"crossref","unstructured":"Balcan D, Colizza V, Goncalves B, Hu H, Ramasco JJ, Vespignani A (2009) Multiscale mobility networks and the spatial spreading of infectious diseases. Proc Natl Acad Sci USA 106(51):21484\u201321489","DOI":"10.1073\/pnas.0906910106"},{"key":"331_CR3","doi-asserted-by":"crossref","unstructured":"Bastide Y, Pasquier N, Taouil R, Stumme G, Lakhal L (2000) Mining minimal non-redundant association rules using frequent closed itemsets. In: Computational logic, pp 972\u2013986","DOI":"10.1007\/3-540-44957-4_65"},{"key":"331_CR4","doi-asserted-by":"crossref","unstructured":"Benevenuto F, Rodrigues T, Cha M, Almeida VAF (2009) Characterizing user behavior in online social networks. In: Internet measurement conference, pp 49\u201362","DOI":"10.1145\/1644893.1644900"},{"key":"331_CR5","doi-asserted-by":"crossref","unstructured":"Berlingerio M, Coscia M, Giannotti F (2011) Finding redundant and complementary communities in multidimensional networks. In: ACM conference on information and knowledge management, pp 2181\u20132184","DOI":"10.1145\/2063576.2063921"},{"key":"331_CR6","doi-asserted-by":"crossref","unstructured":"Berlingerio M, Coscia M, Giannotti F, Monreale A, Pedreschi D (2011a) Foundations of multidimensional network analysis. In: International conference on advances in social networks analysis and mining, pp 485\u2013489","DOI":"10.1109\/ASONAM.2011.103"},{"key":"331_CR7","doi-asserted-by":"crossref","unstructured":"Berlingerio M, Coscia M, Giannotti F, Monreale A, Pedreschi D (2011b) The pursuit of hubbiness: analysis of hubs in large multidimensional networks. J Comput Sci 2(3):223\u2013237","DOI":"10.1016\/j.jocs.2011.05.009"},{"key":"331_CR8","unstructured":"Berlingerio M, Coscia M, Giannotti F, Monreale A, Pedreschi D (2012) Multidimensional networks: foundations of structural analysis. In: World Wide Web, pp 1\u201327"},{"key":"331_CR9","doi-asserted-by":"crossref","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. theory and experiment. J Stat Mech 10:P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"331_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/11430919_22","volume":"3518","author":"F Bonchi","year":"2005","unstructured":"Bonchi F, Lucchese C (2005) Pushing tougher constraints in frequent pattern mining. Adv Knowl Discov Data Mining 3518:173\u2013202","journal-title":"Adv Knowl Discov Data Mining"},{"key":"331_CR11","doi-asserted-by":"crossref","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2005) Efficient breadth-first mining of frequent pattern with monotone constraints. J Knowl Inf Syst 8(2):131\u2013153","DOI":"10.1007\/s10115-004-0164-7"},{"key":"331_CR12","unstructured":"Borgelt C (2003) Efficient implementations of apriori and eclat. In: IEEE ICDM workshop on frequent item set mining implementations, p 90"},{"key":"331_CR13","doi-asserted-by":"crossref","unstructured":"Bringmann B, Zimmermann A (2007) The chosen few: on identifying valuable patterns. In: IEEE international conference on data mining, pp 63\u201372","DOI":"10.1109\/ICDM.2007.85"},{"key":"331_CR14","doi-asserted-by":"crossref","unstructured":"Bringmann B, Berlingerio M, Bonchi F, Gionis A (2010) Learning and predicting the evolution of social networks. IEEE Intel Syst 25(4):26\u201335","DOI":"10.1109\/MIS.2010.91"},{"key":"331_CR15","doi-asserted-by":"crossref","unstructured":"Cai D, Shao Z, He X, Yan X, Han J (2005) Community mining from multi-relational networks. In: The European conference on machine learning and principles and practice of knowledge discovery in databases, pp 445\u2013452","DOI":"10.1007\/11564126_44"},{"key":"331_CR16","doi-asserted-by":"crossref","unstructured":"Calabrese F, Dahlem D, Gerber A, Paul D, Chen X, Rowland J, Rath C, Ratti C (2011) The connected states of America: quantifying social radii of influence. In: IEEE international conference on social computing (SocialCom)","DOI":"10.1109\/PASSAT\/SocialCom.2011.247"},{"key":"331_CR17","doi-asserted-by":"crossref","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut JF (2009a) Closed patterns meet n-ary relations. ACM Trans Knowl Discov Data 3(1):1\u201336","DOI":"10.1145\/1497577.1497580"},{"key":"331_CR18","doi-asserted-by":"crossref","unstructured":"Cerf L, Nguyen TBN, Boulicaut JF (2009b) Discovering relevant cross-graph cliques in dynamic networks. In: International symposium on methodologies for intelligent systems, pp 513\u2013522","DOI":"10.1007\/978-3-642-04125-9_54"},{"key":"331_CR19","doi-asserted-by":"crossref","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111","DOI":"10.1103\/PhysRevE.70.066111"},{"issue":"2","key":"331_CR20","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1080\/01969720903584183","volume":"41","author":"DJ Cook","year":"2010","unstructured":"Cook DJ, Crandall AS, Singla G, Thomas B (2010) Detection of social interaction in smart spaces. Cybern Syst 41(2):90\u2013104","journal-title":"Cybern Syst"},{"issue":"3\u20135","key":"331_CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486(3\u20135):75\u2013174","journal-title":"Phys Rep"},{"key":"331_CR22","doi-asserted-by":"crossref","unstructured":"Francisco AP, Baeza-Yates RA, Oliveira AL (2008) Clique analysis of query log graphs. In: String processing and information retrieval, pp 188\u2013199","DOI":"10.1007\/978-3-540-89097-3_19"},{"key":"331_CR23","doi-asserted-by":"crossref","unstructured":"Goyal A, Bonchi F, Lakshmanan LV (2008) Discovering leaders from community actions. In: ACM conference on information and knowledge management, pp 499\u2013508","DOI":"10.1145\/1458082.1458149"},{"key":"331_CR24","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/978-3-642-01206-8_5","volume":"2009","author":"S Gregory","year":"2009","unstructured":"Gregory S (2009) Finding overlapping communities using disjoint community detection algorithms. Complex Netw 2009:47\u201361","journal-title":"Complex Netw"},{"key":"331_CR25","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2010) Subspace clustering meets dense subgraph mining: a synthesis of two paradigms. In: IEEE international conference on data mining, pp 845\u2013850","DOI":"10.1109\/ICDM.2010.95"},{"key":"331_CR26","doi-asserted-by":"crossref","unstructured":"Huang Y, Sun L, Nie JY (2010) Query model refinement using word graphs. In: ACM conference on information and, knowledge management, pp 1453\u20131456","DOI":"10.1145\/1871437.1871645"},{"key":"331_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec J, Huttenlocher D, Kleinberg J (2010a) Predicting positive and negative links in online social networks. In: ACM international conference on World Wide Web, pp 641\u2013650","DOI":"10.1145\/1772690.1772756"},{"key":"331_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec J, Lang KJ, Mahoney MW (2010b) Empirical comparison of algorithms for network community detection. In: ACM international conference on World Wide Web, pp 631\u2013640","DOI":"10.1145\/1772690.1772755"},{"key":"331_CR29","doi-asserted-by":"crossref","unstructured":"Mongiov\u00ec M, Singh AK, Yan X, Zong B, Psounis K (2012) Efficient multicasting for delay tolerant networks using graph indexing. In: IEEE international conference on computer communications, pp 1386\u20131394","DOI":"10.1109\/INFCOM.2012.6195503"},{"key":"331_CR30","doi-asserted-by":"crossref","unstructured":"Mougel PN, Rigotti C, Gandrillon O (2012) Finding collections of k-clique percolated components in attributed graphs. In: Advances in knowledge discovery and data mining, pp 181\u2013192","DOI":"10.1007\/978-3-642-30220-6_16"},{"key":"331_CR31","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1126\/science.1184819","volume":"328","author":"PJ Mucha","year":"2010","unstructured":"Mucha PJ, Richardson T, Macon K, Porter MA, Onnela J (2010) Community structure in time-dependent, multiscale, and multiplex networks. Science 328:876\u2013878","journal-title":"Science"},{"key":"331_CR32","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"2","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 2:167\u2013256","journal-title":"SIAM Rev"},{"key":"331_CR33","doi-asserted-by":"crossref","unstructured":"Nijssen S, Jim\u00e9nez A, Guns T (2011) Constraint-based pattern mining in multi-relational databases. In: Workshops of the IEEE international conference on data mining, pp 1120\u20131127","DOI":"10.1109\/ICDMW.2011.54"},{"issue":"7043","key":"331_CR34","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla G, Derenyi I, Farkas I, Vicsek T (2005) Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043):814\u2013818","journal-title":"Nature"},{"key":"331_CR35","doi-asserted-by":"crossref","unstructured":"Papadimitriou S, Sun J, Faloutsos C, Yu PS (2008) Hierarchical, parameter-free community discovery. In: The European conference on machine learning and principles and practice of knowledge discovery in databases, pp 170\u2013187","DOI":"10.1007\/978-3-540-87481-2_12"},{"key":"331_CR36","doi-asserted-by":"crossref","unstructured":"Pass G, Chowdhury A, Torgeson C (2006) A picture of search. In: ACM international conference on scalable, information systems, p 1","DOI":"10.1145\/1146847.1146848"},{"key":"331_CR37","doi-asserted-by":"crossref","unstructured":"Pei J, Han J (2000) Can we push more constraints into frequent pattern mining? In: ACM international conference on knowledge discovery and data mining, pp 350\u2013354","DOI":"10.1145\/347090.347166"},{"key":"331_CR38","unstructured":"Pei J, Han J, Lakshmanan LVS (2001) Mining frequent item sets with convertible constraints. In: IEEE international conference on data engineering, pp 433\u2013442"},{"key":"331_CR39","doi-asserted-by":"crossref","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106. doi: 10.1103\/PhysRevE.76.036106","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"331_CR40","doi-asserted-by":"crossref","unstructured":"Rossetti G, Berlingerio M, Giannotti F (2011) Scalable link prediction on multidimensional networks. In: Workshops of the IEEE international conference on data mining, pp 979\u2013986","DOI":"10.1109\/ICDMW.2011.150"},{"key":"331_CR41","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci USA 105:1118\u20131123","journal-title":"Proc Natl Acad Sci USA"},{"key":"331_CR42","doi-asserted-by":"crossref","unstructured":"Sun Y, Yu Y, Han J (2009) Ranking-based clustering of heterogeneous information networks with star network schema. In: ACM international conference on knowledge discovery and data mining, pp 797\u2013806","DOI":"10.1145\/1557019.1557107"},{"key":"331_CR43","doi-asserted-by":"crossref","unstructured":"Szell M, Lambiotte R, Thurner S (2010) Multirelational organization of large-scale social networks in an online world. Proc Natl Acad Sci USA 107(31):13636\u201313641","DOI":"10.1073\/pnas.1004008107"},{"key":"331_CR44","doi-asserted-by":"crossref","unstructured":"Tang L, Liu H (2009) Scalable learning of collective behavior based on sparse social dimensions. In: ACM conference on information and knowledge management, pp 1107\u20131116","DOI":"10.1145\/1645953.1646094"},{"key":"331_CR45","doi-asserted-by":"crossref","unstructured":"Trasarti R, Pinelli F, Nanni M, Giannotti F (2011) Mining mobility user profiles for car pooling. In: ACM international conference on knowledge discovery and data mining, pp 1190\u20131198","DOI":"10.1145\/2020408.2020591"},{"key":"331_CR46","unstructured":"Wang J, Zeng Z, Zhou L (2006) Clan: an algorithm for mining closed cliques from large dense graph databases. In: IEEE international conference on data engineering, p 73"},{"key":"331_CR47","unstructured":"Yan X, Han J (2002) gspan: graph-based substructure pattern mining. In: IEEE international conference on data mining, pp 721\u2013724"},{"key":"331_CR48","doi-asserted-by":"crossref","unstructured":"Zeng Z, Wang J, Zhou L, Karypis G (2006) Coherent closed quasi-clique discovery from large dense graph databases. In: ACM international conference on knowledge discovery and data mining, pp 797\u2013802","DOI":"10.1145\/1150402.1150506"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0331-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-013-0331-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-013-0331-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T11:41:58Z","timestamp":1563450118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-013-0331-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,18]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1007\/s10618-013-0331-0","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,18]]}}}