Abstract
For the purposes of searching for various communities on the Internet, automatic typology of text messages defined via application of methods of cluster analysis may be used. In this paper, we address one of the significant issues in text classification via cluster analysis, namely determination of the number of clusters. For clustering based on semantics, text documents are typically represented in the form of vectors within n-dimensional linear space. What we suggest as a method for determining the number of clusters is the agglomerative clustering of vectors in the linear space. In our work, statistical analysis is combined with neural network algorithms to obtain a more accurate semantic portrait of a text. Then, using the techniques of distributive semantics, mapping of the derived network structures into a vector form is constructed. A statistical criterion for the completion of the clustering process is derived, defined as a Markovian moment. By obtaining automatic partitioning into clusters, one can compare texts that are closest to the centroids with actual content samples or evaluate such texts with the help of experts. If the display of texts in a vector form is adequate, all informational messages from a fixed cluster have the same meaning and the same emotional coloring. In addition, we discuss a possibility to use vector representation of texts for sentiment detection in short texts like search engines input or tweets.
In the part of method assessment, the work is supported by the Presidential grants of the Russian Federation for young Doctors of Science, grant MD-6259.2018.6.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bodrunova, S.S., Koltsova, O., Koltcov, S., Nikolenko, S.: Who’s Bad? Attitudes toward resettlers from the Post-Soviet South versus other nations in the Russian blogosphere. Int. J. Commun. 11, 3242–3264 (2017)
Blekanov, I., Tarasov, N., Maksimov, A.: Topic modeling of conflict ad hoc discussions in social networks. In: Proceedings of the 3rd International Conference on Applications in Information Technology, pp. 122–126. ACM (2018)
Chodorow, M.S., Byrd, R.J., Heidorn, G.E.: Extracting semantic hierarchies from a large on-line dictionary. In: Proceedings of the 23rd Annual Meeting on Association for Computational Linguistics (ACL 1985), Stroudsburg, PA, USA, pp. 299–304. Association for Computational Linguistics (1985). https://doi.org/10.3115/981210.981247
Katamba, F.: English Words: Structure, History, Usage, 2nd edn. Routledge, London (2005)
Chandler, D.: Semiotics for Beginners: Syntagmatic Analysis. Archived from the original on May 12 (2000)
McEnery, T., Wilson, A.: Corpus Linguistics, 2nd edn. Edinburgh University Press, Edinburgh (2001)
Stubbs, M.: Text and Corpus Analysis. Computer Assisted Studies of Language and Culture. Basil Blackwell, Oxford (1996)
Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. 79, 2554–2558 (1982)
McEliece, R.J., Posner, E.C., Rodemic, E.R., Venkatesh, S.S.: The capacity of the Hopfield associative memory. IEEE Trans. Inf. Theory 33(4), 461–482 (1987)
Kharlamov, A.A., Yermolenko, T.V., Zhonin, A.A.: Text understanding as interpretation of predicative structure strings of main text’s sentences as result of pragmatic analysis (combination of linguistic and statistic approaches). In: Železný, M., Habernal, I., Ronzhin, A. (eds.) SPECOM 2013. LNCS (LNAI), vol. 8113, pp. 333–339. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-01931-4_44
Kharlamov, A.A., Yermolenko, T.V., Zhonin, A.A.: Modeling of process dynamics by sequence of homogenous semantic networks on the base of text corpus sequence analysis. In: Ronzhin, A., Potapova, R., Delic, V. (eds.) SPECOM 2014. LNCS (LNAI), vol. 8773, pp. 300–307. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11581-8_37
Kharlamov, A.A., Ermakov, A.E., Kuznetsov, D.M.: TextAnalyst komplexniy neurosetevoy analyzator textovoy informacii [Complex Neuronetwork Analyzer of Text Information TextAnalyst]. Vestnik moskovskogo gosudarstvennogo tekhnicheskogo universyteta im. N.E. Baumana. Seriya: Mashinostroenie [Bulletin of Moscow State Tekhnikal University by N.E. Bauman. Series: Mechanik Engeneering], no. 1, 121–126 (1998). (in Russian)
Kharlamov, A.A., Ermakov, A.E., Kuznetsov, D.M.: Systema dlya avtomaticheskoy smyslovoy obrabotky textov na osnove neyrostevoy nekhnologii TextAnalyst [System of Automatical Semantic Text Processing Based on Neuronetwork TextAnalyst Technology]. Informatsionniye Tekhnologii [Informational Technology], no. 10, 27–32 (1999). (in Russian)
Kharlamov, A.A., Yermolenko, T.V.: Neiyrosetevaya sreda (neuromophnaya associativnaya pamyat) dlya preodoleniya informatsionnoy sloshnosty. Poisk smysla dlya slabostrukturirovannykh massivakh informatsii. Chyast I. Strukturnaya obrabotka informatsii v kore [Neuronetwork Environment (Neuromorphic Associative Memory) for Information Complexity Overcoming. Searching of Sense in Weak Structured Information Arrays. Part I. Structural Information Processing in Cortex]. Informatsionniye tekhnologii [Informational Technology] 21(11), 814–820 (2015). (in Russian)
Kharlamov, A.A., Yermolenko, T.V.: Neiyrosetevaya sreda (neuromophnaya associativnaya pamyat) dlya preodoleniya informatsionnoy sloshnosty. Poisk smysla d slabostrukturirovannykh massivakh informatsii. Chyast I. Obrabotka informatsii v gippokampe [Neuronetwork Environment (Neuromorphic Associative Memory) for Information Complexity Overcoming. Searching of Sense in Weak Structured Information Arrays. Part II. Information Processing in Hyppocampus]. Informatsionniye tekhnologii. [Informational Technology] 21(11), 883–889 (2015). (in Russian)
Kharlamov, A.A.: Tekhnologiya avtomaticheskogo smyslovogo analiza textov TextAnalyst [Automatical Semantic Text Analysis TextAnalyst]. Vestnik moskovskogo gosudarstvennogo universiteta. Gumanitarnye nauki [Bulletin of Moscow State Linguistic University Human Scienses], no. 699, 234–244 (2014). (in Russian)
Geger, A.E., Geger, S.A.: Otechestvennye komputernye progremmy dlya analysa kachestvennykh dannykh: Vega I TextAnalyst [Native Computer Program for Quality Data Analysis: Vega and TextAnalyst]. Aktual nye voprosy obchestvennykh nauk: sotsyologiya, politologiya, philosophiya, istoriya [Up-to-the-minute Questions of Social Scienses: Sociology, Politology, Philosophy, History], no. 46, 34–40 (2015). (in Russian)
Ore, O.: Theory of Graphs. American Mathematical Society, Providence (1983)
Schutze, H.: Dimensions of meaning. In: Proceedings of Supercomputing 1992, pp. 787–796 (1992)
Clark, S.: Vector space models of lexical meaning. In: Handbook of Contemporary Semantics, 2nd edn. Blackwell, Oxford (2014)
Kiela, D., Clark, S.: A systematic study of semantic vector space model parameters. In: Conference: Proceedings of the 2nd Workshop on Continuous Vector Space Models and Their Compositionality (CVSC) (2014). https://doi.org/10.3115/v1/W14-1503
Orekhov, A.V.: Markov moment for the agglomerative method of clustering in Euclidean space. Vestn. St. Petersburg Univ. Appl. Math. Comput. Sci. Control Process. 15(1), 76–92 (2019). https://doi.org/10.21638/11702/spbu10.2019.106
Everitt, B.S.: Cluster Analysis, 5th edn. Wiley, Chichester (2011)
Aldenderfer, M.S., Blashfield, R.K.: Cluster Analysis. Sage Publications, Inc., Beverly Hills (1984)
Orekhov, A.V.: Agglomerative method for texts clustering. In: Bodrunova, S.S., et al. (eds.) INSCI 2018. LNCS, vol. 11551, pp. 19–32. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17705-8_2
Wald, A.: Sequential Analysis. Wiley, New York (1947)
Sirjaev, A.N.: Statistical Sequential Analysis: Optimal Stopping Rules. American Mathematical Society, Providence (1973)
Chow, Y.S., Robbins, H.E., Siegmund, D.: Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, Boston (1971)
Shiryaev, A.N.: Optimal Stopping Rules. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-540-74011-7
Orekhov, A.V.: Criterion for estimation of stress-deformed state of SD-materials. In: AIP Conference Proceedings, vol. 1959, p. 070028 (2018). https://doi.org/10.1063/1.5034703
Orekhov, A.V.: Approximation-evaluation tests for a stress-strain state of deformable solids. Vestn. St. Petersburg Univ. Appl. Math. Comput. Sci. Control Process. 14(3), 230–242 (2018). https://doi.org/10.21638/11702/spbu10.2018.304
Bodrunova, S.S., Blekanov, I., Maksimov, A.: Topics in the Russian Twitter and relations between their interpretability and sentiment. Submitted to the SAMSN International Workshop, Barcelona, Spain, pp. 1–6 (2019, unpublished)
Radev, D.R., Blair-Goldensohn, S., Zhang, Z.: Experiments in single and multidocument summarization using MEAD. In: Proceedings of the First Document Understanding Conference, pp. 1–8 (2001)
Nur’Aini, K., Najahaty, I., Hidayati, L., Murfi, H., Nurrohmah, S.: Combination of singular value decomposition and K-means clustering methods for topic detection on Twitter. In: Proceedings of the 2015 International Conference on Advanced Computer Science and Information Systems (ICACSIS), pp. 123–128. IEEE (2015)
Aggarwal, C.C., Zhai, C.: Mining Text Data. Springer, Boston (2012). https://doi.org/10.1007/978-1-4614-3223-4
Acknowledgements
This research in the part of methods evaluation is supported by the Presidential grants of the Russian Federation for young Doctors of Science, grant MD-5962.2018.6.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Orekhov, A.V., Kharlamov, A.A., Bodrunova, S.S. (2019). Network Presentation of Texts and Clustering of Messages. In: El Yacoubi, S., Bagnoli, F., Pacini, G. (eds) Internet Science. INSCI 2019. Lecture Notes in Computer Science(), vol 11938. Springer, Cham. https://doi.org/10.1007/978-3-030-34770-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-34770-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34769-7
Online ISBN: 978-3-030-34770-3
eBook Packages: Computer ScienceComputer Science (R0)