{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:45Z","timestamp":1750220565509,"version":"3.41.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T00:00:00Z","timestamp":1620604800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91746209, 61772102, 61702291, 61702073"],"award-info":[{"award-number":["91746209, 61772102, 61702291, 61702073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,10,31]]},"abstract":"<jats:p>\n            Detecting self-organized coalitions from functional networks is one of the most important ways to uncover functional mechanisms in the brain. Determining these raises well-known technical challenges in terms of scale imbalance, outliers and hard-examples. In this article, we propose a novel self-adaptive skeleton approach to detect coalitions through an approximation method based on probabilistic mixture models. The nodes in the networks are characterized in terms of robust\n            <jats:italic>k<\/jats:italic>\n            -order complete subgraphs (\n            <jats:italic>\n              <jats:italic>k<\/jats:italic>\n              -clique\n            <\/jats:italic>\n            ) as essential substructures. The\n            <jats:italic>k<\/jats:italic>\n            -clique enumeration algorithm quickly enumerates all\n            <jats:italic>k<\/jats:italic>\n            -cliques in a parallel manner for a given network. Then, the cliques, from\n            <jats:italic>max<\/jats:italic>\n            -clique down to\n            <jats:italic>min<\/jats:italic>\n            -clique, of each order\n            <jats:italic>k<\/jats:italic>\n            , are hierarchically embedded into a probabilistic mixture model. They are self-adapted to the corresponding structure density of coalitions in the brain functional networks through different order\n            <jats:italic>k<\/jats:italic>\n            . All the cliques are merged and evolved into robust skeletons to sustain each unbalanced coalition by eliminating outliers and separating overlaps. We call this the\n            <jats:italic>k<\/jats:italic>\n            -CLIque Merging Evolution (CLIME) algorithm. The experimental results illustrate that the proposed approaches are robust to density variation and coalition mixture and can enable the effective detection of coalitions from real brain functional networks. There exist potential cognitive functional relations between the regions of interest in the coalitions revealed by our methods, which suggests the approach can be usefully applied in neuroscientific studies.\n          <\/jats:p>","DOI":"10.1145\/3447570","type":"journal-article","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T22:24:14Z","timestamp":1620685454000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Self-Adaptive Skeleton Approaches to Detect Self-Organized Coalitions From Brain Functional Networks Through Probabilistic Mixture Models"],"prefix":"10.1145","volume":"15","author":[{"given":"Kai","family":"Liu","sequence":"first","affiliation":[{"name":"Dalian Maritime University, Dalian, Liaoning, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9296-9975","authenticated-orcid":false,"given":"Hongbo","family":"Liu","sequence":"additional","affiliation":[{"name":"Dalian Maritime University, Dalian, Liaoning, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas E.","family":"Ward","sequence":"additional","affiliation":[{"name":"Dublin City University, Dublin, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[{"name":"Georgia Southern University, Statesboro, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[{"name":"Pingdingshan University, Pingdingshan, Henan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zhang","sequence":"additional","affiliation":[{"name":"Dalian Maritime University, Dalian, Liaoning, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[{"name":"Mininglamp Academy of Sciences, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,5,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.11.010"},{"volume-title":"Frontiers in Internet Technologies","author":"Chen Yuzhong","key":"e_1_2_1_2_1","unstructured":"Yuzhong Chen and Xiaohui Qiu . 2013. Detecting community structures in social networks with particle swarm optimization . In Frontiers in Internet Technologies . Springer , Berlin, Heidelberg , 266--275. Yuzhong Chen and Xiaohui Qiu. 2013. Detecting community structures in social networks with particle swarm optimization. In Frontiers in Internet Technologies. Springer, Berlin, Heidelberg, 266--275."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-013-1778-y"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.10133"},{"key":"e_1_2_1_5_1","volume-title":"Article 11","author":"Datta Srayan","year":"2018","unstructured":"Srayan Datta and Eytan Adar . 2018. CommunityDiff: Visualizing community clustering algorithms. ACM Transactions on Knowledge Discovery from Data 12, 1 , Article 11 ( 2018 ), 34 pages. Srayan Datta and Eytan Adar. 2018. CommunityDiff: Visualizing community clustering algorithms. ACM Transactions on Knowledge Discovery from Data 12, 1, Article 11 (2018), 34 pages."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9046-7"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.96.040601"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_2_1_9_1","volume-title":"International Conference on Knowledge Discovery and Data Mining. AAAI Press, 226--231","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans Peter Kriegel , and Xiaowei Xu . 1996 . A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise . In International Conference on Knowledge Discovery and Data Mining. AAAI Press, 226--231 . Martin Ester, Hans Peter Kriegel, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise. In International Conference on Knowledge Discovery and Data Mining. AAAI Press, 226--231."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3389\/fnins.2019.00585"},{"volume-title":"Fundamentals of Brain Network Analysis","author":"Fornito Alex","key":"e_1_2_1_11_1","unstructured":"Alex Fornito , Andrew Zalesky , and Edward Bullmore . 2016. Fundamentals of Brain Network Analysis . Academic Press . Alex Fornito, Andrew Zalesky, and Edward Bullmore. 2016. Fundamentals of Brain Network Analysis. Academic Press."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2002.1009383"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2017.06.011"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274662"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448556.2448646"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2873750"},{"key":"e_1_2_1_20_1","volume-title":"Article 1","author":"Kriegel Hans-Peter","year":"2009","unstructured":"Hans-Peter Kriegel , Peer Kr\u00f6ger , and Arthur Zimek . 2009. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Transactions on Knowledge Discovery from Data 3, 1 , Article 1 ( 2009 ), 58 pages. Hans-Peter Kriegel, Peer Kr\u00f6ger, and Arthur Zimek. 2009. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Transactions on Knowledge Discovery from Data 3, 1, Article 1 (2009), 58 pages."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/11\/3\/033015"},{"key":"e_1_2_1_22_1","volume-title":"Article 22","author":"Li Peizhen","year":"2020","unstructured":"Peizhen Li , Ling Huang , Changdong Wang , Jianhuang Lai , and Dong Huang . 2020. Community detection by Motif-Aware label propagation. ACM Transactions on Knowledge Discovery from Data 14, 2 , Article 22 ( 2020 ), 19 pages. Peizhen Li, Ling Huang, Changdong Wang, Jianhuang Lai, and Dong Huang. 2020. Community detection by Motif-Aware label propagation. ACM Transactions on Knowledge Discovery from Data 14, 2, Article 22 (2020), 19 pages."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/3014163"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2866424"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.09.063"},{"key":"e_1_2_1_26_1","first-page":"308","article-title":"Minimum spanning trees on weighted scale-free networks","volume":"15","author":"Macdonald Patrick Jackson","year":"2012","unstructured":"Patrick Jackson Macdonald , Eivind Almaas , and Albert-Laszlo Barabasi . 2012 . Minimum spanning trees on weighted scale-free networks . Physics 15 , 2 (2012), 308 -- 314 . Patrick Jackson Macdonald, Eivind Almaas, and Albert-Laszlo Barabasi. 2012. Minimum spanning trees on weighted scale-free networks. Physics 15, 2 (2012), 308--314.","journal-title":"Physics"},{"key":"e_1_2_1_27_1","volume-title":"Network motifs: Simple building blocks of complex networks. Science 298, 5594","author":"Milo Ron","year":"2002","unstructured":"Ron Milo , Shai Shen-Orr , Shalev Itzkovitz , Nadav Kashtan , Dmitri Chklovskii , and Uri Alon . 2002. Network motifs: Simple building blocks of complex networks. Science 298, 5594 ( 2002 ), 824--827. Ron Milo, Shai Shen-Orr, Shalev Itzkovitz, Nadav Kashtan, Dmitri Chklovskii, and Uri Alon. 2002. Network motifs: Simple building blocks of complex networks. Science 298, 5594 (2002), 824--827."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-018-0304-8"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.94.052315"},{"key":"e_1_2_1_31_1","volume-title":"Article 3","author":"Ni Li","year":"2019","unstructured":"Li Ni , Wenjian Luo , Wenjie Zhu , and Bei Hua . 2019. Local overlapping community detection. ACM Transactions on Knowledge Discovery from Data 14, 1 , Article 3 ( 2019 ), 25 pages. Li Ni, Wenjian Luo, Wenjie Zhu, and Bei Hua. 2019. Local overlapping community detection. ACM Transactions on Knowledge Discovery from Data 14, 1, Article 3 (2019), 25 pages."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/hbm.21104"},{"volume-title":"Basic Graph Theory","author":"Saidur Rahman Md.","key":"e_1_2_1_34_1","unstructured":"Md. Saidur Rahman . 2017. Basic Graph Theory . Springer , Cham, Switzerland . Md. Saidur Rahman. 2017. Basic Graph Theory. Springer, Cham, Switzerland."},{"key":"e_1_2_1_35_1","volume-title":"How AI and neuroscience drive each other forwards. Nature 571, 7766","author":"Savage Neil","year":"2019","unstructured":"Neil Savage . 2019. How AI and neuroscience drive each other forwards. Nature 571, 7766 ( 2019 ), S15\u201317. Neil Savage. 2019. How AI and neuroscience drive each other forwards. Nature 571, 7766 (2019), S15\u201317."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824115"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_2_1_38_1","volume-title":"Thompson","author":"Shi Lei","year":"2018","unstructured":"Lei Shi , Hanghang Tong , Madelaine Daianu , Feng Tian , and Paul M . Thompson . 2018 . Visual analysis of brain networks using sparse regression models. ACM Transactions on Knowledge Discovery from Data 12, 1, Article 5 (2018), 30 pages. Lei Shi, Hanghang Tong, Madelaine Daianu, Feng Tian, and Paul M. Thompson. 2018. Visual analysis of brain networks using sparse regression models. ACM Transactions on Knowledge Discovery from Data 12, 1, Article 5 (2018), 30 pages."},{"key":"e_1_2_1_39_1","volume-title":"How to map the circuits that define us. Nature 548, 7666","author":"Smith Kerri","year":"2017","unstructured":"Kerri Smith . 2017. How to map the circuits that define us. Nature 548, 7666 ( 2017 ), 150--152. Kerri Smith. 2017. How to map the circuits that define us. Nature 548, 7666 (2017), 150--152."},{"key":"e_1_2_1_40_1","volume-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","volume":"12","author":"Xu Xiaowei","unstructured":"Xiaowei Xu , Nurcan Yuruk , Zhidan Feng , and Thomas A. J. Schweiger . 2007. SCAN: A structural clustering algorithm for networks . In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , Vol. 12 . Association for Computing Machinery, New York, NY, 824--833. Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, and Thomas A. J. Schweiger. 2007. SCAN: A structural clustering algorithm for networks. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Vol. 12. Association for Computing Machinery, New York, NY, 824--833."},{"volume-title":"Discovering Communities from Social Networks: Methodologies and Applications","author":"Yang Bo","key":"e_1_2_1_41_1","unstructured":"Bo Yang , Dayou Liu , and Jiming Liu . 2010. Discovering Communities from Social Networks: Methodologies and Applications . Springer , Boston, MA , 331--346. Bo Yang, Dayou Liu, and Jiming Liu. 2010. Discovering Communities from Social Networks: Methodologies and Applications. Springer, Boston, MA, 331--346."},{"key":"e_1_2_1_42_1","volume-title":"Novel fast networking approaches mining underlying structures from investment big data","author":"Yang Liping","year":"2019","unstructured":"Liping Yang , Yu Yang , Gervas Mgaya , Bo Zhang , Long Chen , and Hongbo Liu . 2019. Novel fast networking approaches mining underlying structures from investment big data . IEEE Transactions on Systems, Man, and Cybernetics: Systems ( 2019 ), 1--11. Liping Yang, Yu Yang, Gervas Mgaya, Bo Zhang, Long Chen, and Hongbo Liu. 2019. Novel fast networking approaches mining underlying structures from investment big data. IEEE Transactions on Systems, Man, and Cybernetics: Systems (2019), 1--11."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2783933"},{"key":"e_1_2_1_44_1","volume-title":"Article 47","author":"Zhou Xiren","year":"2019","unstructured":"Xiren Zhou , Huanhuan Chen , and Jinlong Li. 2019. Probabilistic mixture model for mapping the underground pipes. ACM Transactions on Knowledge Discovery from Data 13, 5 , Article 47 ( 2019 ), 26 pages. Xiren Zhou, Huanhuan Chen, and Jinlong Li. 2019. Probabilistic mixture model for mapping the underground pipes. ACM Transactions on Knowledge Discovery from Data 13, 5, Article 47 (2019), 26 pages."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447570","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:37Z","timestamp":1750195717000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,10]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10,31]]}},"alternative-id":["10.1145\/3447570"],"URL":"https:\/\/doi.org\/10.1145\/3447570","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2021,5,10]]},"assertion":[{"value":"2020-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}