{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:48:02Z","timestamp":1755802082453,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,10]]},"DOI":"10.1145\/3701551.3704127","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T12:30:16Z","timestamp":1740573016000},"page":"1036-1039","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Cluster Insight: A Weighted Clustering Tool for Large Textual Data Exploration"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3284-030X","authenticated-orcid":false,"given":"Amine","family":"Ferdjaoui","sequence":"first","affiliation":[{"name":"SogetiLabs, Paris, France, & Centre Borelli, Universit\u00e9 Paris Cit\u00e9, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4107-0887","authenticated-orcid":false,"given":"S\u00e9verine","family":"Affeldt","sequence":"additional","affiliation":[{"name":"Centre Borelli UMR 9010, Universit\u00e9 Paris Cit\u00e9, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0007-3950","authenticated-orcid":false,"given":"Mohamed","family":"Nadif","sequence":"additional","affiliation":[{"name":"Centre Borelli UMR 9010, Universit\u00e9 Paris Cit\u00e9, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"S\u00e9verine Affeldt Lazhar Labiod and Mohamed Nadif. 2020a. Ensemble block co-clustering: a unified framework for text data. In ACM CIKM. 5--14.","DOI":"10.1145\/3340531.3412058"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107522"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-021-10006-w"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"S\u00e9verine Affeldt Lazhar Labiod and Mohamed Nadif. 2021b. Regularized Dual-PPMI Co-clustering for Text Data. In ACM SIGIR. 2263--2267.","DOI":"10.1145\/3404835.3463065"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5201\/ipol.2022.398"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"Robust and sparse k-means clustering for high-dimensional data","volume":"1","author":"Brodinova Sarka","year":"2019","unstructured":"Sarka Brodinova, Peter Filzmoser, Thomas Ortner, Christian Breiteneder, and Maia Rohm. 2019. Robust and sparse k-means clustering for high-dimensional data. Advances in Data Analysis and Classification, Vol. 1 (2019), 1--28.","journal-title":"Advances in Data Analysis and Classification"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3047489"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Amine Ferdjaoui S\u00e9verine Affeldt and Mohamed Nadif. 2024. WordGraph: A Python Package for Reconstructing Interactive Causal Graphical Models from Text Data. In ACM WSDM. 1046--1049.","DOI":"10.1145\/3616855.3635698"},{"key":"e_1_3_2_1_9_1","volume-title":"Boosting subspace co-clustering via bilateral graph convolution","author":"Fettal Chakib","year":"2023","unstructured":"Chakib Fettal, Lazhar Labiod, and Mohamed Nadif. 2023. Boosting subspace co-clustering via bilateral graph convolution. IEEE Transactions on Knowledge and Data Engineering (2023)."},{"key":"e_1_3_2_1_10_1","first-page":"32989","article-title":"Efficient and effective optimal transport-based biclustering","volume":"35","author":"Fettal Chakib","year":"2022","unstructured":"Chakib Fettal, Mohamed Nadif, et al. 2022. Efficient and effective optimal transport-based biclustering. Advances in Neural Information Processing Systems, Vol. 35 (2022), 32989--33000.","journal-title":"Advances in Neural Information Processing Systems"},{"volume-title":"Theory and Applications of Correspondence Analysis","author":"Greenacre M.J.","key":"e_1_3_2_1_11_1","unstructured":"M.J. Greenacre. 1984. Theory and Applications of Correspondence Analysis. Academic Press."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.95"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, L. M. Le Cam and J. Neyman (Eds.)","volume":"1","author":"MacQueen J. B.","year":"1967","unstructured":"J. B. MacQueen. 1967. Some Methods for Classification and Analysis of MultiVariate Observations. In Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability, L. M. Le Cam and J. Neyman (Eds.), Vol. 1. University of California Press, 281--297."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2020.07.028"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-022-06137-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11659"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-018-0323-4"},{"key":"e_1_3_2_1_19_1","first-page":"583","article-title":"Cluster Ensembles - A Knowledge Reuse Framework for Combining Multiple Partitions","volume":"3","author":"Strehl Alexander","year":"2002","unstructured":"Alexander Strehl and Joydeep Ghosh. 2002. Cluster Ensembles - A Knowledge Reuse Framework for Combining Multiple Partitions. Journal of Machine Learning Research, Vol. 3 (2002), 583--617.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2010.tm09415"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2010.tm09415"}],"event":{"name":"WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Hannover Germany","acronym":"WSDM '25"},"container-title":["Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3704127","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701551.3704127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T09:10:36Z","timestamp":1755767436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3704127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":21,"alternative-id":["10.1145\/3701551.3704127","10.1145\/3701551"],"URL":"https:\/\/doi.org\/10.1145\/3701551.3704127","relation":{},"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"2025-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}