乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T06:03:55Z","timestamp":1732341835239,"version":"3.28.0"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1016\/j.ins.2024.121649","type":"journal-article","created":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T17:59:00Z","timestamp":1731693540000},"page":"121649","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Community structure testing by counting frequent common neighbor sets"],"prefix":"10.1016","volume":"691","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-9526-8816","authenticated-orcid":false,"given":"Zengyou","family":"He","sequence":"first","affiliation":[]},{"given":"Xiaolei","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7470-9395","authenticated-orcid":false,"given":"Lianyu","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Mudi","family":"Jiang","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1386-812X","authenticated-orcid":false,"given":"Yan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ins.2024.121649_br0010","first-page":"1149","article-title":"A survey of community detection approaches: from statistical modeling to deep learning","volume":"35","author":"Jin","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"10.1016\/j.ins.2024.121649_br0020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3091106","article-title":"Metrics for community analysis: a survey","volume":"50","author":"Chakraborty","year":"2017","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/j.ins.2024.121649_br0030","first-page":"2887","article-title":"On the statistical significance of a community structure","volume":"35","author":"He","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2024.121649_br0040","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1111\/rssb.12117","article-title":"Hypothesis testing for automated community detection in networks","volume":"78","author":"Bickel","year":"2016","journal-title":"J. R. Stat. Soc., Ser. B, Stat. Methodol."},{"key":"10.1016\/j.ins.2024.121649_br0050","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1214\/15-AOS1370","article-title":"A goodness-of-fit test for stochastic block models","volume":"44","author":"Lei","year":"2016","journal-title":"Ann. Stat."},{"key":"10.1016\/j.ins.2024.121649_br0060","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/rsa.20633","article-title":"Testing for high-dimensional geometry in random graphs","volume":"49","author":"Bubeck","year":"2016","journal-title":"Random Struct. Algorithms"},{"author":"Gao","key":"10.1016\/j.ins.2024.121649_br0070"},{"author":"Gao","key":"10.1016\/j.ins.2024.121649_br0080"},{"key":"10.1016\/j.ins.2024.121649_br0090","series-title":"Proceedings of the 35th International Conference on Machine Learning","first-page":"2338","article-title":"Network global testing by counting graphlets","author":"Jin","year":"2018"},{"key":"10.1016\/j.ins.2024.121649_br0100","doi-asserted-by":"crossref","first-page":"3408","DOI":"10.1214\/21-AOS2089","article-title":"Optimal adaptivity of signed-polygon statistics for network testing","volume":"49","author":"Jin","year":"2021","journal-title":"Ann. Stat."},{"issue":"3","key":"10.1016\/j.ins.2024.121649_br0110","doi-asserted-by":"crossref","first-page":"1741","DOI":"10.3150\/22-BEJ1519","article-title":"Power enhancement and phase transitions for global testing of the mixed membership stochastic block model","volume":"29","author":"Cammarata","year":"2023","journal-title":"Bernoulli"},{"author":"Banerjee","key":"10.1016\/j.ins.2024.121649_br0120"},{"issue":"8","key":"10.1016\/j.ins.2024.121649_br0130","doi-asserted-by":"crossref","first-page":"4011","DOI":"10.1109\/TKDE.2020.3026311","article-title":"The node-similarity distribution of complex networks and its applications in link prediction","volume":"34","author":"Pu","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2024.121649_br0140","series-title":"Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data","first-page":"1","article-title":"Mining frequent patterns without candidate generation","author":"Han","year":"2000"},{"issue":"3","key":"10.1016\/j.ins.2024.121649_br0150","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2220357.2220359","article-title":"An efficient rigorous approach for identifying statistically significant frequent itemsets","volume":"59","author":"Kirsch","year":"2012","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.ins.2024.121649_br0160","first-page":"2711","article-title":"Detecting statistically significant communities","volume":"34","author":"He","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"10.1016\/j.ins.2024.121649_br0170","first-page":"6073","article-title":"Mining statistically significant communities from weighted networks","volume":"35","author":"He","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2024.121649_br0180","series-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"167","article-title":"Assessing data mining results via swap randomization","author":"Gionis","year":"2006"},{"issue":"4","key":"10.1016\/j.ins.2024.121649_br0190","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/TKDE.2006.1599388","article-title":"TAPER: a two-step approach for all-strong-pairs correlation query in large databases","volume":"18","author":"Xiong","year":"2006","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"10.1016\/j.ins.2024.121649_br0200","first-page":"403","article-title":"Poisson approximation and the Chen-Stein method","volume":"5","author":"Arratia","year":"1990","journal-title":"Stat. Sci."},{"key":"10.1016\/j.ins.2024.121649_br0210","series-title":"Proceedings 2002 IEEE International Conference on Data Mining","first-page":"211","article-title":"Mining top-k frequent closed patterns without minimum support","author":"Han","year":"2002"},{"issue":"4","key":"10.1016\/j.ins.2024.121649_br0220","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.ins.2024.121649_br0230","series-title":"Proceedings of 13th International Conference on Learning and Intelligent Optimization","first-page":"17","article-title":"A statistical test of heterogeneous subgraph densities to assess clusterability","author":"Miasnikof","year":"2020"},{"key":"10.1016\/j.ins.2024.121649_br0240","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s41060-023-00389-6","article-title":"Statistical power, accuracy, reproducibility and robustness of a graph clusterability test","author":"Miasnikof","year":"2023","journal-title":"Int. J. Data Sci. Anal."},{"issue":"2","key":"10.1016\/j.ins.2024.121649_br0250","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1017\/nws.2024.1","article-title":"A generalized hypothesis test for community structure in networks","volume":"12","author":"Yanchenko","year":"2024","journal-title":"Netw. Sci."},{"author":"Yuan","key":"10.1016\/j.ins.2024.121649_br0260"},{"key":"10.1016\/j.ins.2024.121649_br0270","series-title":"Proceedings of the 35th International Conference on Neural Information Processing Systems","first-page":"7220","article-title":"Sharp impossibility results for hypergraph testing","author":"Jin","year":"2021"},{"issue":"1","key":"10.1016\/j.ins.2024.121649_br0280","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1214\/21-AOS2099","article-title":"Testing community structure for hypergraphs","volume":"50","author":"Yuan","year":"2022","journal-title":"Ann. Stat."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524015639?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025524015639?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,23]],"date-time":"2024-11-23T02:58:41Z","timestamp":1732330721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025524015639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":28,"alternative-id":["S0020025524015639"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2024.121649","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[2025,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Community structure testing by counting frequent common neighbor sets","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2024.121649","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"121649"}}