{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:02:37Z","timestamp":1746316957969,"version":"3.37.3"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,24]],"date-time":"2015-05-24T00:00:00Z","timestamp":1432425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BD\/52362\/2013"],"award-info":[{"award-number":["SFRH\/BD\/52362\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10115-015-0847-2","type":"journal-article","created":{"date-parts":[[2015,5,25]],"date-time":"2015-05-25T00:56:06Z","timestamp":1432515366000},"page":"657-677","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Discovery of \u201ccomet\u201d communities in temporal and labeled graphs Com $$^2$$ 2 \u00a0"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2929-7218","authenticated-orcid":false,"given":"Miguel","family":"Araujo","sequence":"first","affiliation":[]},{"given":"Stephan","family":"G\u00fcnnemann","sequence":"additional","affiliation":[]},{"given":"Spiros","family":"Papadimitriou","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Faloutsos","sequence":"additional","affiliation":[]},{"given":"Prithwish","family":"Basu","sequence":"additional","affiliation":[]},{"given":"Ananthram","family":"Swami","sequence":"additional","affiliation":[]},{"given":"Evangelos E.","family":"Papalexakis","sequence":"additional","affiliation":[]},{"given":"Danai","family":"Koutra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,24]]},"reference":[{"issue":"1","key":"847_CR1","doi-asserted-by":"crossref","first-page":"10:1","DOI":"10.1145\/2601412","volume":"47","author":"C Aggarwal","year":"2014","unstructured":"Aggarwal C, Subbian K (2014) Evolutionary network analysis: a survey. ACM Comput Surv 47(1):10:1\u201310:36","journal-title":"ACM Comput Surv"},{"key":"847_CR2","doi-asserted-by":"crossref","unstructured":"Araujo M, G\u00fcnnemann S, Mateos G, Faloutsos C (2014) Beyond blocks: hyperbolic community detection. ECML PKDD 8724:50\u201365","DOI":"10.1007\/978-3-662-44848-9_4"},{"key":"847_CR3","doi-asserted-by":"crossref","unstructured":"Araujo M, Papadimitriou S, G\u00fcnnemann S, Faloutsos C, Basu P, Swami A, Papalexakis EE, Koutra D (2014) Com2: fast automatic discovery of temporal (\u2018comet\u2019) communities. PAKDD 8444:271\u2013283","DOI":"10.1007\/978-3-319-06605-9_23"},{"key":"847_CR4","doi-asserted-by":"crossref","unstructured":"Boden B, G\u00fcnnemann S, Hoffmann H, Seidl T (2012) Mining coherent subgraphs in multi-layer graphs with edge labels. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining 1258\u20131266","DOI":"10.1145\/2339530.2339726"},{"key":"847_CR5","doi-asserted-by":"crossref","unstructured":"Boden B, G\u00fcnnemann S, Hoffmann H, Seidl T (2013) RMiCS: a robust approach for mining coherent subgraphs in edge-labeled multi-layer graphs. In: Proceedings of the 25th international conference on scientific and statistical database management 1\u201323","DOI":"10.1145\/2484838.2484860"},{"issue":"3","key":"847_CR6","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02310791","volume":"35","author":"J Carroll","year":"1970","unstructured":"Carroll J, Chang J-J (1970) Analysis of individual differences in multidimensional scaling via an n-way generalization of \u201ceckart-young\u201d decomposition. Psychometrika 35(3):283\u2013319","journal-title":"Psychometrika"},{"issue":"2","key":"847_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1921632.1921636","volume":"5","author":"DM Dunlavy","year":"2011","unstructured":"Dunlavy DM, Kolda TG, Acar E (2011) Temporal link prediction using matrix and tensor factorizations. TKDD 5(2):10","journal-title":"TKDD"},{"key":"847_CR8","doi-asserted-by":"crossref","unstructured":"Flake GW, Lawrence S, Giles CL (2000) Efficient identification of web communities. KDD 150\u2013160","DOI":"10.1145\/347090.347121"},{"issue":"3\u20135","key":"847_CR9","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":"847_CR10","doi-asserted-by":"crossref","unstructured":"Gkantsidis C, Mihail M, Zegura EW (2003) Spectral analysis of internet topologies. INFOCOM 1:364\u2013374","DOI":"10.1109\/INFCOM.2003.1208688"},{"key":"847_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The minimum description length principle","author":"PD Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald PD (2007) The minimum description length principle. The MIT Press, Cambridge"},{"issue":"2","key":"847_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10115-013-0640-z","volume":"40","author":"S G\u00fcnnemann","year":"2014","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Boden B, Seidl T (2014) Gamer: a synthesis of subspace clustering and dense subgraph mining. Knowl Inf Syst 40(2):243\u2013278","journal-title":"Knowl Inf Syst"},{"key":"847_CR13","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann S, F\u00e4rber I, Raubach S, Seidl T (2013) Spectral subspace clustering for graphs with feature vectors. In: IEEE 13th international conferance on data mining 231\u2013240","DOI":"10.1109\/ICDM.2013.110"},{"key":"847_CR14","first-page":"1","volume":"16","author":"R Harshman","year":"1970","unstructured":"Harshman R (1970) Foundations of the PARAFAC procedure: models and conditions for an \u201cexplanatory\u201d multimodal factor analysis. UCLA Work Pap Phon 16:1\u201384","journal-title":"UCLA Work Pap Phon"},{"key":"847_CR15","doi-asserted-by":"crossref","unstructured":"Johnson DS, Krishnan S, Chhugani J, Kumar S, Venkatasubramanian S (2004) Compressing large boolean matrices using reordering techniques. VLDB 30:13\u201323","DOI":"10.1016\/B978-012088469-8.50005-X"},{"key":"847_CR16","unstructured":"Karypis G, Kumar V (1995) Metis: unstructured graph partitioning and sparse matrix ordering system. Tech Rep"},{"key":"847_CR17","doi-asserted-by":"crossref","unstructured":"Kolda T, Bader B (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","DOI":"10.1137\/07070111X"},{"key":"847_CR18","doi-asserted-by":"crossref","unstructured":"Kolda TG, Bader BW, Kenny JP (2005) Higher-order web link analysis using multilinear algebra. In: Fifth IEEE international conference on data mining 242\u2013249","DOI":"10.1109\/ICDM.2005.77"},{"key":"847_CR19","doi-asserted-by":"crossref","unstructured":"Koutra D, Kang U, Vreeken J, Faloutsos C (2014) VoG: summarizing and understanding large graphs. In: Proceedings of the 2014 SIAM international conference on data mining 91\u201399","DOI":"10.1137\/1.9781611973440.11"},{"key":"847_CR20","doi-asserted-by":"crossref","unstructured":"Koutra D, Papalexakis E, Faloutsos C (2012) Tensorsplat: spotting latent anomalies in time. In: 16th Panhellenic conference on informatics (PCI)","DOI":"10.1109\/PCi.2012.60"},{"key":"847_CR21","doi-asserted-by":"crossref","unstructured":"Kumar R, Novak J, Raghavan P, Tomkins A (2003) On the bursty evolution of blogspace. WWW, pp 568\u2013576","DOI":"10.1145\/775152.775233"},{"key":"847_CR22","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. IEEE TKDD 1(1):917\u2013922","DOI":"10.1145\/1217299.1217301"},{"key":"847_CR23","doi-asserted-by":"crossref","unstructured":"Liu Z, Yu J, Ke Y, Lin X, Chen L (2008) Spotting significant changing subgraphs in evolving graphs. In: ICDM, pp 917\u2013922","DOI":"10.1109\/ICDM.2008.112"},{"key":"847_CR24","doi-asserted-by":"crossref","unstructured":"Maruhashi K, Guo F, Faloutsos C (2011) Multiaspectforensics: pattern mining on large-scale heterogeneous networks with tensor analysis. In: Proceedings of the 2011 international conference on advances in social networks analysis and mining 203\u2013210","DOI":"10.1109\/ASONAM.2011.80"},{"key":"847_CR25","unstructured":"Papalexakis E, Akoglu L, Ience D (2013) Do more views of a graph help? Community detection and clustering in multi-graphs. In: International conference on information FUSION, pp 899\u2013905"},{"key":"847_CR26","first-page":"521","volume":"1","author":"EE Papalexakis","year":"2012","unstructured":"Papalexakis EE, Faloutsos C, Sidiropoulos ND (2012) Parcube: sparse parallelizable tensor decompositions. ECML\/PKDD 1:521\u2013536","journal-title":"ECML\/PKDD"},{"key":"847_CR27","doi-asserted-by":"crossref","unstructured":"Papalexakis EE, Sidiropoulos ND, Bro R (2013) From k-means to higher-way co-clustering: multilinear decomposition with sparse latent factors. IEEE Trans Signal Process 61(2):493\u2013506","DOI":"10.1109\/TSP.2012.2225052"},{"key":"847_CR28","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/90.392383","volume":"3","author":"V Paxson","year":"1995","unstructured":"Paxson V, Floyd S (1995) Wide-area traffic: the failure of poisson modeling. IEEE\/ACM Trans Netw 3:226\u2013244","journal-title":"IEEE\/ACM Trans Netw"},{"key":"847_CR29","doi-asserted-by":"crossref","unstructured":"Prakash BA, Sridharan A, Seshadri M, Machiraju S, Faloutsos C (2010) Eigenspokes: surprising patterns and scalable community chipping in large graphs. PAKDD 6119:435\u2013448","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"847_CR30","doi-asserted-by":"crossref","unstructured":"Rissanen J (1983) A universal prior for integers and estimation by minimum description length. Ann Stat 11:416\u2013431","DOI":"10.1214\/aos\/1176346150"},{"issue":"18","key":"847_CR31","doi-asserted-by":"crossref","first-page":"7327","DOI":"10.1073\/pnas.0611034104","volume":"104","author":"M Rosvall","year":"2007","unstructured":"Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. Proc Nat Acad Sci 104(18):7327\u20137331","journal-title":"Proc Nat Acad Sci"},{"key":"847_CR32","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1186\/1471-2105-7-355","volume":"7","author":"T Sen","year":"2006","unstructured":"Sen T, Kloczkowski A, Jernigan R (2006) Functional clustering of yeast proteins from the protein-protein interaction network. BMC Bioinf 7:355\u2013367","journal-title":"BMC Bioinf"},{"issue":"8","key":"847_CR33","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE PAMI 22(8):888\u2013905","journal-title":"IEEE PAMI"},{"key":"847_CR34","doi-asserted-by":"crossref","unstructured":"Sun J, Papadimitriou S, Faloutsos C, Yu PS (2007) Graphscope: parameter-free mining of large time-evolving graphs. KDD 687\u2013696","DOI":"10.1145\/1281192.1281266"},{"key":"847_CR35","doi-asserted-by":"crossref","unstructured":"Sun J, Tao D, Faloutsos C (2006) Beyond streams and graphs: dynamic tensor analysis. KDD, pp 374\u2013383","DOI":"10.1145\/1150402.1150445"},{"key":"847_CR36","unstructured":"Tang L, Wang X, Liu H (2009) Uncovering groups via heterogeneous interaction analysis. In: Ninth IEEE international conference on data mining 503\u2013512"},{"key":"847_CR37","doi-asserted-by":"crossref","unstructured":"Tantipathananandh C, Berger-Wolf TY (2011) Finding communities in dynamic social networks. ICDM, pp 1236\u20131241","DOI":"10.1109\/ICDM.2011.67"},{"key":"847_CR38","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S (1994) Social network analysis: methods and applications. cambridge University Press, Cambridge"},{"key":"847_CR39","doi-asserted-by":"crossref","unstructured":"Wu Z, Yin W, Cao J, Xu G, Cuzzocrea A (2013) Community detection in multi-relational social networks. WISE 8181:43\u201356","DOI":"10.1007\/978-3-642-41154-0_4"},{"key":"847_CR40","doi-asserted-by":"crossref","unstructured":"Yang J, Leskovec J (2012) Community-affiliation graph model for overlapping network community detection. In: 12th IEEE International Conference on Data Mining 1170\u20131175","DOI":"10.1109\/ICDM.2012.139"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0847-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0847-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0847-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T09:34:05Z","timestamp":1566725645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0847-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,24]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["847"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0847-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2015,5,24]]}}}