{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:10:07Z","timestamp":1751703007838,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031976346","type":"print"},{"value":"9783031976353","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97635-3_1","type":"book-chapter","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:41:49Z","timestamp":1751701309000},"page":"3-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Method for\u00a0Handling Negative Similarities in\u00a0Explainable Graph Spectral Clustering of\u00a0Text Documents"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4685-7045","authenticated-orcid":false,"given":"Mieczys\u0142aw A.","family":"K\u0142opotek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8860-392X","authenticated-orcid":false,"given":"S\u0142awomir T.","family":"Wierzcho\u0144","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5554-4596","authenticated-orcid":false,"given":"Bart\u0142omiej","family":"Starosta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3013-3483","authenticated-orcid":false,"given":"Dariusz","family":"Czerski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9188-5147","authenticated-orcid":false,"given":"Piotr","family":"Borkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,7,6]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Biyikoglu, T., Leydold, J., Stadler, P.F.: Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems. In: Lecture Notes in Mathematics, vol.\u00a01915. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73510-6","DOI":"10.1007\/978-3-540-73510-6"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: Pre-training of deep bidirectional transformers for language understanding (2019). https:\/\/doi.org\/10.48550\/ARXIV.1810.04805","DOI":"10.48550\/ARXIV.1810.04805"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Knyazev, A.: Edge-enhancing filters with negative weights. In: 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 260\u2013264 (2015). https:\/\/doi.org\/10.1109\/GlobalSIP.2015.7418197","DOI":"10.1109\/GlobalSIP.2015.7418197"},{"key":"1_CR4","unstructured":"Knyazev, A.: Signed Laplacian for spectral clustering revisited. arXiv (2017). https:\/\/arxiv.org\/abs\/1701.01394"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., Luca, E.W.D., Albayrak, S.: Spectral analysis of signed graphs for clustering, prediction and visualization, pp. 559\u2013570. Society for Industrial and Applied Mathematics (2010). https:\/\/doi.org\/10.1137\/1.9781611972801.49","DOI":"10.1137\/1.9781611972801.49"},{"key":"1_CR6","unstructured":"K\u0142opotek, M.A., Wierzcho\u0144, S.T., Starosta, B., Czerski, D., Borkowski, P.: A method for handling negative similarities in explainable graph spectral clustering of text documents \u2013 Extended Version. CoRR abs\/2504.12360 (2025). https:\/\/arxiv.org\/abs\/2504.12360"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Lau, J.H., Baldwin, T.: An empirical evaluation of doc2vec with practical insights into document embedding generation (2016). https:\/\/doi.org\/10.48550\/ARXIV.1607.05368","DOI":"10.48550\/ARXIV.1607.05368"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.aiopen.2022.10.001","volume":"3","author":"T Lin","year":"2022","unstructured":"Lin, T., Wang, Y., Liu, X., Qiu, X.: A survey of transformers. AI Open 3, 111\u2013132 (2022). https:\/\/doi.org\/10.1016\/j.aiopen.2022.10.001","journal-title":"AI Open"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Pennington, J., Socher, R., Manning, C.: GloVe: global vectors for word representation. In: Moschitti, A., Pang, B., Daelemans, W. (eds.) Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1532\u20131543. Association for Computational Linguistics, Doha, Qatar (2014). https:\/\/doi.org\/10.3115\/v1\/D14-1162","DOI":"10.3115\/v1\/D14-1162"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1007\/s12065-023-00825-3","volume":"16","author":"J Ravi","year":"2023","unstructured":"Ravi, J., Kulkarni, S.: Text embedding techniques for efficient clustering of Twitter data. Evol. Intel. 16, 1667\u20131677 (2023). https:\/\/doi.org\/10.1007\/s12065-023-00825-3","journal-title":"Evol. Intel."},{"key":"1_CR11","doi-asserted-by":"publisher","unstructured":"Rocha, I., Trevisan, V.: A Fiedler-like theory for the perturbed Laplacian. Czech Math. J. 66, 717\u2013735 (2016). https:\/\/doi.org\/10.1007\/s10587-016-0288-4","DOI":"10.1007\/s10587-016-0288-4"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Rong, X.: word2vec parameter learning explained (2014). https:\/\/doi.org\/10.48550\/ARXIV.1411.2738, arXiv:1411.2738 [cs.CL]","DOI":"10.48550\/ARXIV.1411.2738"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0313238","volume":"20","author":"B Starosta","year":"2025","unstructured":"Starosta, B., K\u0142opotek, M.A., Wierzcho\u0144, S.T., Czerski, D., Sydow, M., Borkowski, P.: Explainable graph spectral clustering of text documents. PLoS ONE 20(2), e0313238 (2025). https:\/\/doi.org\/10.1371\/journal.pone.0313238","journal-title":"PLoS ONE"},{"key":"1_CR14","unstructured":"Starosta, B., K\u0142opotek, M.A., Wierzcho\u0144, S.T.: Approaches to explainability of output of graph spectral clustering methods. to appear in monograph \u201cDesign and Implementation of Artificial Intelligence Systems\u201d. published by University of Siedlce (2025)"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Stec, H., Ekanadham, C., Kallus, N.: Is cosine-similarity of embeddings really about similarity? arXiv (2024). https:\/\/doi.org\/10.1145\/3589335.3651526","DOI":"10.1145\/3589335.3651526"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Zelazo, D., Buerger, M.: On the definiteness of the weighted Laplacian and its connection to effective resistance. In: 53rd IEEE Conference on Decision and Control, pp. 2895\u20132900. IEEE (2014). https:\/\/doi.org\/10.1109\/cdc.2014.7039834","DOI":"10.1109\/cdc.2014.7039834"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97635-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:41:51Z","timestamp":1751701311000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97635-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031976346","9783031976353"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97635-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}