{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:07Z","timestamp":1750221007820,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T00:00:00Z","timestamp":1566864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,8,27]]},"DOI":"10.1145\/3341161.3342944","type":"proceedings-article","created":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T21:07:04Z","timestamp":1579122424000},"page":"538-539","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["CAB-NC"],"prefix":"10.1145","author":[{"given":"Masaomi","family":"Kimura","sequence":"first","affiliation":[{"name":"Shibaura Institute of Technology, Koto city, Tokyo, JAPAN"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"W. E. Donath and A. J. Hoffman \"Lower bounds for the partitioning of graphs \" vol. 17 pp. 420--425 1973.  W. E. Donath and A. J. Hoffman \"Lower bounds for the partitioning of graphs \" vol. 17 pp. 420--425 1973.","DOI":"10.1147\/rd.175.0420"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.88.042822"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0605965104"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"H. O. Hirschfeld \"A connection between correlation and contingency \" vol. 31 pp. 520--524 1935.  H. O. Hirschfeld \"A connection between correlation and contingency \" vol. 31 pp. 520--524 1935.","DOI":"10.1017\/S0305004100013517"}],"event":{"name":"ASONAM '19: International Conference on Advances in Social Networks Analysis and Mining","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","IEEE CS"],"location":"Vancouver British Columbia Canada","acronym":"ASONAM '19"},"container-title":["Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342944","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341161.3342944","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:58Z","timestamp":1750206358000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341161.3342944"}},"subtitle":["the correspondence analysis based network clustering method"],"short-title":[],"issued":{"date-parts":[[2019,8,27]]},"references-count":4,"alternative-id":["10.1145\/3341161.3342944","10.1145\/3341161"],"URL":"https:\/\/doi.org\/10.1145\/3341161.3342944","relation":{},"subject":[],"published":{"date-parts":[[2019,8,27]]},"assertion":[{"value":"2020-01-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}