{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:54Z","timestamp":1740109314404,"version":"3.37.3"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10115-021-01543-x","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T20:11:02Z","timestamp":1611000662000},"page":"939-969","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tracking triadic cardinality distributions for burst detection in high-speed graph streams"],"prefix":"10.1007","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3476-8248","authenticated-orcid":false,"given":"Junzhou","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhouguo","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianwei","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C. S.","family":"Lui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"key":"1543_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed NK, Duffield N, Neville J, Kompella R (2014) Graph sample and hold: a framework for big-graph analytics. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/2623330.2623757"},{"issue":"1","key":"1543_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3365676","volume":"14","author":"S Arifuzzaman","year":"2019","unstructured":"Arifuzzaman S, Khan M, Vishnu M (2019) Fast parallel algorithms for counting and listing triangles in big graphs. ACM Trans Knowl Discov Data 14(1):1\u201334","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1543_CR3","doi-asserted-by":"crossref","unstructured":"Backstrom L, Bakshy E, Kleinberg J, Lento TM, Rosenn I (2011) Center of attention: How Facebook users allocate attention across friends. In: Proceedings of the 5th international AAAI conference on weblogs and social media","DOI":"10.1609\/icwsm.v5i1.14142"},{"key":"1543_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/nature03459","volume":"435","author":"AL Barabasi","year":"2005","unstructured":"Barabasi AL (2005) The origin of bursts and heavy tails in human dynamics. Nature 435:207\u2013211","journal-title":"Nature"},{"key":"1543_CR5","doi-asserted-by":"crossref","unstructured":"Becchetti L, Boldi P, Castillo C, Gionis A (2008) Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1401890.1401898"},{"key":"1543_CR6","unstructured":"Beta-binomial distribution. https:\/\/en.wikipedia.org\/wiki\/Beta-binomial_distribution (Retrieved June 2020)"},{"key":"1543_CR7","doi-asserted-by":"crossref","unstructured":"Beutel A, Xu W, Guruswami V, Palow C, Faloutsos C (2013) CopyCatch: stopping group attacks by spotting lockstep behavior in social networks. In: Proceedings of the 22nd international world wide web conference","DOI":"10.1145\/2488388.2488400"},{"key":"1543_CR8","doi-asserted-by":"crossref","unstructured":"Boshmaf Y, Muslukhov I, Beznosov K, Ripeanu M (2011) The socialbot network: When bots socialize for fame and money. In: Proceedings of the 27th annual computer security applications conference","DOI":"10.1145\/2076732.2076746"},{"key":"1543_CR9","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, Abbadi AE (2011) Structural trend analysis for online social networks. In: Proceedings of the VLDB endowment","DOI":"10.14778\/2021017.2021022"},{"key":"1543_CR10","doi-asserted-by":"crossref","unstructured":"Cadena J, Vullikanti A (2018) Mining heavy temporal subgraphs: Fast algorithms and applications. In: Proceedings of the 32nd AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11807"},{"key":"1543_CR11","doi-asserted-by":"crossref","unstructured":"Chierichetti F, Kleinberg J, Kumar R, Mahdian M, Pandey S (2014) Event detection via communication pattern analysis. In: Proceedings of the 8th international AAAI conference on weblogs and social media","DOI":"10.1609\/icwsm.v8i1.14536"},{"key":"1543_CR12","doi-asserted-by":"crossref","unstructured":"Chu Z, Gianvecchio S, Wang H, Jajodia S (2010) Who is tweeting on Twitter: Human, bot, or cyborg? In: Proceedings of the 26th annual computer security applications conference","DOI":"10.1145\/1920261.1920265"},{"issue":"4","key":"1543_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3064884","volume":"11","author":"AF Costa","year":"2017","unstructured":"Costa AF, Yamaguchi Y, Traina AJM Jr, Faloutsos CT (2017) Modeling temporal activity to detect anomalous behavior in social media. ACM Trans Knowl Discov Data 11(4):1\u201323","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1543_CR14","unstructured":"Cram\u00e9r-Rao bound. https:\/\/en.wikipedia.org\/wiki\/Cram%C3%A9r%E2%80%93Rao_bound (Retrived June 2020)"},{"key":"1543_CR15","doi-asserted-by":"crossref","unstructured":"Duffield N, Lund C, Thorup M (2003) Estimating flow distributions from sampled flow statistics. In: Proceedings of the ACM special interest group on data communication","DOI":"10.1145\/863955.863992"},{"key":"1543_CR16","doi-asserted-by":"crossref","unstructured":"Durand M, Flajolet P (2003) Loglog counting of large cardinalities. In: Proceedings of the 11th annual European symposium on algorithms","DOI":"10.1007\/978-3-540-39658-1_55"},{"key":"1543_CR17","doi-asserted-by":"crossref","unstructured":"Eftekhar M, Koudas N, Ganjali Y (2013) Bursty subgraphs in social networks. In: Proceedings of the 6th international ACM conference on web search and data mining","DOI":"10.1145\/2433396.2433423"},{"key":"1543_CR18","doi-asserted-by":"crossref","unstructured":"Eswaran D, Faloutsos C, Guha S, Mishra N (2018) SpotLight: Detecting anomalies in streaming graphs. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/3219819.3220040"},{"issue":"9","key":"1543_CR19","doi-asserted-by":"publisher","first-page":"1872","DOI":"10.1109\/JSAC.2011.111011","volume":"29","author":"M Gjoka","year":"2011","unstructured":"Gjoka M, Kurant M, Butts CT, Markopoulou A (2011) Practical recommendations on crawling online social networks. IEEE J Sel Areas Commun 29(9):1872\u20131892","journal-title":"IEEE J Sel Areas Commun"},{"issue":"6","key":"1543_CR20","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1109\/18.59929","volume":"26","author":"JD Gorman","year":"1990","unstructured":"Gorman JD, Hero AO (1990) Lower bounds for parametric estimation with constraints. IEEE Transit Inf Theory 26(6):1285\u20131301","journal-title":"IEEE Transit Inf Theory"},{"key":"1543_CR21","doi-asserted-by":"crossref","unstructured":"Grier C, Thomas K, Paxson V, Zhang M (2010) @spam: The underground on 140 characters or less. In: Proceedings of the ACM SIGSAC conference on computer and communications security","DOI":"10.1145\/1866307.1866311"},{"key":"1543_CR22","unstructured":"Harvey M (2020) Fans mourn artist for whom it didn\u2019t matter if you were black or white. http:\/\/wayback.archive.org\/web\/20100531165925\/http:\/\/www.timesonline.co.uk\/tol\/news\/world\/us_and_americas\/article6580897.ece (Retrieved June 2020)"},{"key":"1543_CR23","doi-asserted-by":"crossref","unstructured":"Jha M, Seshadhri C, Pinar A (2013) A space efficient streaming algorithm for triangle counting using the birthday paradox. In: Proceedings of the 19th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/2487575.2487678"},{"key":"1543_CR24","doi-asserted-by":"crossref","unstructured":"Kleinberg J (2002) Bursty and hierarchical structure in streams. In: Proceedings of the 8th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/775047.775061"},{"key":"1543_CR25","doi-asserted-by":"crossref","unstructured":"Klimt B, Yang Y (2004) The Enron corpus: A new dataset for email classification research. In: Proceeding of the European conference on machine learning and principles and practice of knowledge discovery in databases","DOI":"10.1007\/978-3-540-30115-8_22"},{"issue":"5757","key":"1543_CR26","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1126\/science.1116869","volume":"311","author":"G Kossinets","year":"2006","unstructured":"Kossinets G, Watts DJ (2006) Empirical analysis of an evolving social network. Science 311(5757):88\u201390","journal-title":"Science"},{"key":"1543_CR27","unstructured":"Krikorian R (2020) New tweets per second record, and how! https:\/\/blog.twitter.com\/engineering\/en_us\/a\/2013\/new-tweets-per-second-record-and-how.html (Retrived June 2020)"},{"key":"1543_CR28","doi-asserted-by":"crossref","unstructured":"Leskovec J, McGlohon M, Faloutsos C, Glance N, Hurst M (2007) Cascading behavior in large blog graphs. In: Proceedings of the 7th SIAM international conference on data mining","DOI":"10.1137\/1.9781611972771.60"},{"key":"1543_CR29","doi-asserted-by":"crossref","unstructured":"Lim Y, Kang U (2015) MASCOT: Memory-efficient and accurate sampling for counting local triangles in graph streams. In: Proceedings of the 21st ACM SIGKDD international conference on knowledge discovery and data mining. Sydney, Australia","DOI":"10.1145\/2783258.2783285"},{"key":"1543_CR30","doi-asserted-by":"crossref","unstructured":"Liu X, Ge T, Wu Y (2019) Finding densest lasting subgraphs in dynamic graphs: a stochastic approach. In: Proceedings of the 35th IEEE international conference on data engineering","DOI":"10.1109\/ICDE.2019.00075"},{"key":"1543_CR31","unstructured":"London riots: more than 2,000 people arrested over disorder. http:\/\/www.mirror.co.uk\/news\/uk-news\/london-riots-more-than-2000-people-185548 (Retrived June 2020)"},{"key":"1543_CR32","doi-asserted-by":"crossref","unstructured":"Manzoor E, Milajerdi, SM, Akoglu L (2016) Fast memory-efficient anomaly detection in streaming heterogeneous graphs. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. San Francisco, California, USA","DOI":"10.1145\/2939672.2939783"},{"key":"1543_CR33","doi-asserted-by":"crossref","unstructured":"Mathioudakis M, Bansal N, Koudas N (2010) Identifying, attributing and describing spatial bursts. In: Proceedings of the VLDB endowment","DOI":"10.14778\/1920841.1920978"},{"issue":"5594","key":"1543_CR34","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298(5594):824\u2013827","journal-title":"Science"},{"issue":"7","key":"1543_CR35","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ipl.2011.12.007","volume":"112","author":"R Pagh","year":"2012","unstructured":"Pagh R, Tsourakakis CE (2012) Colorful triangle counting and a MapReduce implementation. J Inf Process Lett 112(7):277\u2013281","journal-title":"J Inf Process Lett"},{"key":"1543_CR36","doi-asserted-by":"crossref","unstructured":"Paranjape A, Benson AR, Leskovec J (2017)Motifs in temporal networks. In: Proceedings of the 10th ACM international conference on web search and data mining","DOI":"10.1145\/3018661.3018731"},{"key":"1543_CR37","doi-asserted-by":"crossref","unstructured":"Parikh N, Sundaresan N (2008)Scalable and near real-time burst detection from ecommerce queries. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1401890.1402006"},{"key":"1543_CR38","doi-asserted-by":"crossref","unstructured":"Pavan A, Tangwongsan K, Tirthapura S, Wu KL (2013)Counting and sampling triangles from a graph stream. In: Proceedings of the VLDB endowment","DOI":"10.14778\/2556549.2556569"},{"key":"1543_CR39","doi-asserted-by":"crossref","unstructured":"Ribeiro B, Towsley D, Ye T, Bolot JC (2006) Fisher information of sampled packets: An application to flow size estimation. In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement","DOI":"10.1145\/1177080.1177083"},{"key":"1543_CR40","doi-asserted-by":"crossref","unstructured":"Rodrigues T, Benevenuto F, Cha M, Gummadi KP, Almeida V (2011) On word-of-mouth based discovery of the web. In: Proceedings of the 11th ACM SIGCOMM conference on internet measurement","DOI":"10.1145\/2068816.2068852"},{"key":"1543_CR41","doi-asserted-by":"crossref","unstructured":"Sakaki T, Okazaki M, Matsuo Y (2010) Earthquake shakes Twitter users: Real-time event detection by social sensors. In: Proceedings of the 19th international world wide web conference","DOI":"10.1145\/1772690.1772777"},{"key":"1543_CR42","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri SV, Sar\u00fcy\u00fcce AE, Tirthapura S (2018) Butterfly counting in bipartite networks. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/3219819.3220097"},{"key":"1543_CR43","doi-asserted-by":"crossref","unstructured":"Sar\u00fcy\u00fcce AE, Pinar A (2018) Peeling bipartite networks for dense subgraph discovery. In: Proceedings of the 11th international ACM conference on web search and data mining, pp. 504\u2013512","DOI":"10.1145\/3159652.3159678"},{"key":"1543_CR44","doi-asserted-by":"crossref","unstructured":"Seshadhri C, Pinar A, Kolda TG (2013) Triadic measures on graphs: The power of wedge sampling. In: Proceedings of the 13th SIAM international conference on data mining","DOI":"10.1137\/1.9781611972832.2"},{"key":"1543_CR45","unstructured":"Shiels M (2020) Web slows after Jackson\u2019s death. http:\/\/news.bbc.co.uk\/2\/hi\/technology\/8120324.stm (Retrieved June 2020)"},{"issue":"2","key":"1543_CR46","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3375392","volume":"14","author":"K Shin","year":"2019","unstructured":"Shin K, Oh S, Kim J, Hooi B, Faloutsos C (2019) Fast, accurate and provable triangle counting in fully dynamic graph streams. ACM Trans Knowl Discov Data 14(2):1\u201339","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1543_CR47","doi-asserted-by":"crossref","unstructured":"Stefani LD, Epasto A, Riondato M, Upfal E (2016) TRIEST: Counting local and global triangles in fully-dynamic streams with fixed memory size. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/3059194"},{"key":"1543_CR48","doi-asserted-by":"crossref","unstructured":"Stringhini G, Kruegel C, Vigna G (2010) Detecting spammers on social networks. In: Proceedings of the 26th annual computer security applications conference","DOI":"10.1145\/1920261.1920263"},{"key":"1543_CR49","doi-asserted-by":"crossref","unstructured":"Takahashi T, Tomioka R, Yamanishi K (2011) Discovering emerging topics in social streams via link anomaly detection. In: Proceedings of the IEEE international conference on data mining","DOI":"10.1109\/ICDM.2011.53"},{"key":"1543_CR50","doi-asserted-by":"crossref","unstructured":"Teng X, Yan M, Ertugrul AM, Lin YR (2018) Deep into hypersphere: Robust and unsupervised anomaly discovery in dynamic networks. In: Proceedings of the 27th international joint conference on artificial intelligence","DOI":"10.24963\/ijcai.2018\/378"},{"key":"1543_CR51","doi-asserted-by":"crossref","unstructured":"Thomas K, Grier C, Paxson V, Song D (2011) Suspended accounts in retrospect: an analysis of Twitter spam. In: Proceedings of the 11th ACM SIGCOMM conference on internet measurement","DOI":"10.1145\/2068816.2068840"},{"key":"1543_CR52","doi-asserted-by":"publisher","DOI":"10.1002\/0471221090","volume-title":"Detection, estimation, and modulation theory. Part I","author":"HLV Trees","year":"2001","unstructured":"Trees HLV (2001) Detection, estimation, and modulation theory. Part I. Wiley, Hoboken"},{"key":"1543_CR53","unstructured":"Tsotsis A (2020) First credible reports of Bin Laden\u2019s death spread like wildfire on Twitter. https:\/\/techcrunch.com\/2011\/05\/01\/news-of-osama-bin-ladens-death-spreads-like-wildfire-on-twitter (Retrived June 2020)"},{"key":"1543_CR54","doi-asserted-by":"crossref","unstructured":"Tsourakakis CE, Kang U, Miller GL, Faloutsos C (2009) DOULION: Counting triangles in massive graphs with a coin. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/1557019.1557111"},{"issue":"10","key":"1543_CR55","doi-asserted-by":"publisher","first-page":"7011","DOI":"10.1109\/TIT.2011.2165150","volume":"57","author":"P Tune","year":"2011","unstructured":"Tune P, Veitch D (2011) Fisher information in flow size distribution estimation. IEEE Trans Inf Theory 57(10):7011\u20137035","journal-title":"IEEE Trans Inf Theory"},{"key":"1543_CR56","unstructured":"Turkett W, Fulp E, Lever C, Edward\u00a0Allan J (2011) Graph mining of motif profiles for computer network activity inference. In: Proceedings of the 7th workshop on mining and learning with graphs"},{"issue":"6","key":"1543_CR57","doi-asserted-by":"publisher","first-page":"3075","DOI":"10.1109\/TIT.2015.2418770","volume":"61","author":"D Veitch","year":"2015","unstructured":"Veitch D, Tune P (2015) Optimal sampling for the flow size distribution. IEEE Trans Inf Theory 61(6):3075\u20133099","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"1543_CR58","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TIFS.2014.2312544","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang P, Guan X, Zhao J, Tao J, Qin T (2014) A new sketch method for measuring host connection degree distribution. IEEE Trans Inf Forensics Secur 9(6):948\u2013960","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"2","key":"1543_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629564","volume":"9","author":"P Wang","year":"2014","unstructured":"Wang P, Lui JC, Ribeiro B, Towsley D, Zhao J, Guan X (2014) Efficiently estimating motif statistics of large networks. ACM Trans Knowl Discov Data 9(2):1\u201327","journal-title":"ACM Trans Knowl Discov Data"},{"key":"1543_CR60","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393:440\u2013442","journal-title":"Nature"},{"issue":"8","key":"1543_CR61","doi-asserted-by":"publisher","first-page":"2013","DOI":"10.1109\/TKDE.2016.2556663","volume":"28","author":"B Wu","year":"2016","unstructured":"Wu B, Yi K, Li Z (2016) Counting triangles in large graphs by random sampling. IEEE Trans Knowl Data Eng 28(8):2013\u20132026","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1543_CR62","unstructured":"Yi J (2005) Detecting buzz from time-sequenced document streams. In: Proceedings of the IEEE international conference on e-technology, e-commerce and e-service"},{"key":"1543_CR63","doi-asserted-by":"crossref","unstructured":"Yoon M, Hooi B, Shin K, Faloutsos C (2019) Fast and accurate anomaly detection in dynamic graphs with a two-pronged approach. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/3292500.3330946"},{"issue":"1","key":"1543_CR64","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0167-7152(02)00091-3","volume":"57","author":"C Yu","year":"2002","unstructured":"Yu C, Zelterman D (2002) Sums of dependent Bernoulli random variables and disease clustering. Stat Probab Lett 57(1):363\u2013373","journal-title":"Stat Probab Lett"},{"key":"1543_CR65","doi-asserted-by":"crossref","unstructured":"Yu M, Song C, Gu J, Liu M (2019) Distributed triangle counting algorithms in simple graph stream. In: Proceedings of the 25th IEEE international conference on parallel and distributed system","DOI":"10.1109\/ICPADS47876.2019.00049"},{"key":"1543_CR66","doi-asserted-by":"crossref","unstructured":"Zhao J, Lui JC, Towsley D, Wang P, Guan X (2015) Tracking triadic cardinality distributions for burst detection in social activity streams. In: ACM conference on online social networks","DOI":"10.1145\/2817946.2817955"},{"key":"1543_CR67","doi-asserted-by":"crossref","unstructured":"Zhu Y, Shasha D (2003) Efficient elastic burst detection in data streams. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/956750.956789"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01543-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-021-01543-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-021-01543-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T02:20:27Z","timestamp":1670811627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-021-01543-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":67,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1543"],"URL":"https:\/\/doi.org\/10.1007\/s10115-021-01543-x","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2021,1,18]]},"assertion":[{"value":"19 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}