Doctoral Dissertations
Collections in this community
Recent Submissions
-
Šošić, Milena (Beograd , 2025)[more][less]
Abstract: Conversational text messages represent an important form of digital communication in modern society. With the development of information technologies, various communication tools have emerged, such as email, social media, instant messaging tools, and automated response systems. Messages generated within these tools, unlike standard texts, have a specific structure that allows for the classification of individual messages or sets of messages that form a conversation. Classification labels are defined by the specific task being addressed and can be either single-label or multi-label, which enables the recognition of complex interrelationships between the categories. Introducing moral and emotional dimensions of language into research is crucial for understanding the complex patterns of human communication, particularly in the context of digital platforms and social media. Machine learning (ML) methods, such as deep neural networks (DNN), facilitate the utilization and more precise recognition of these aspects while simultaneously providing an efficient way to classify emotions and moral values expressed in texts. The noticeable complexity in the expression of human emotions and moral values, which are often conveyed implicitly and depend heavily on context, makes their recognition particularly challenging. One of the major challenges is the lack of or limited availability of resources in terms of size and diversity for low-resource languages, including Serbian. The development of linguistic resources, such as annotated lexicons and corpora, plays a crucial role in this process by providing the necessary knowledge sources for building and improving existing ML models. Linguistic resources enable models to learn how different emotional expressions and moral values influence the tone and meaning of communication. To support this, a semantic lexicon for sentiment intensity, SentiWords.SR, containing approximately 15k words, was developed for the Serbian language, along with the associated tool SRPOL for measuring sentiment intensity in textual sequences in Serbian. Additionally, a semantic lexicon for emotional affect, EmoLex.SR, comprising around 9.8k words with assigned emotional intensity values, and a semantic lexicon for moral values, MFD.SR, consisting of approximately 4.3k words with associated moral value weights, were developed. Significant efforts were also made in annotating the first conversational corpora from social media with emotional and moral categories. In this regard, the Social-Emo.SR corpus (∼34.6k messages) was developed, consisting of the Twitter-Emo.SR subcorpus (∼16.7k messages) and the Reddit-Emo.SR subcorpus (∼17.9k messages), collected from Twitter and Reddit, respectively. Furthermore, by searching for key moral-related terms, a subset of messages expressing potential moral stances was extracted from Social-Emo.SR. This subset, named Social-Mor.SR (∼13.6k messages), was manually verified and annotated by human annotators and consists of the Twitter-Mor.SR subcorpus (∼6.1k Twitter messages) and the Reddit-Mor.SR subcorpus (∼7.5k Reddit messages). In the context of DNN architectures, models based on recurrent networks or transformers, trained on these resources, enable the recognition and utilization of emotional and moral aspects of language in various contexts. The combination of advanced algorithms, such as Bidirectional Long Short-Term Memory (BiLSTM) networks and the attention mechanism with linguistically and culturally adapted resources (Meta) opens new possibilities for analyzing moral and emotional aspects of language. This has broad applications in classification tasks such as recognizing personal context, truthfulness of posts, or types of engagement in digital communication. For personal context recognition, i.e. classifying corporate emails as either business-related or personal, results show that using a carefully designed hybrid approach (BiLSTM-Att+Meta) across entire conversation branches yields the best results, comparable to published benchmarks on the same task. In experiments related to rumor veracity classification and identifying engagement types in response to rumors, it was demonstrated that moral and emotional attributes derived from semantic lexicons (EmoAttr, MorAttr ⊆ Meta) improve classification accuracy by +4.2% and +3.8% respectively, compared to methods without these attributes. For emotion recognition in Serbian conversational texts, experiments revealed that transformer-based models fine-tuned on the task achieved F1-scores of approximately 53%, reaching performance levels reported for multi-label classification on the same emotional category set. Additionally, experiments showed that further data preprocessing and balancing improved model performance. In moral value and moral sentiment classification tasks, using the Social-Mor.SR corpus and its subcorpora, an F1-score of ∼46% was achieved for moral value recognition and ∼38% for moral sentiment recognition, indicating acceptable results but also the need for further model optimization. Fine-tuning LLaMA models yielded reasonable but slightly lower performance compared to BERT-based architectures. Since model performance is directly dependent on the data they are trained on, there is potential for further improvements by refining and balancing initial annotations in the utilized corpora. URI: http://hdl.handle.net/123456789/5774 Files in this item: 1
Doktorski_rad_Milena_Sosic.pdf ( 6.206Mb ) -
Milović, Matija (Beograd , 2025)[more][less]
Abstract: The subject of this dissertation is the study of the belonging of weak operator in- tegrals in appropriate ideals of compact operators, as well as the investigation of perturbation inequalities. These questions were previously considered in [16], where Cauchy–Schwarz type inequalities were established. In addition to providing norm estimates, these inequalities also yield sufficient conditions for an operator integral to belong to a given ideal. In the first part of the dissertation, using these inequalities, perturbation norm inequalities are derived for elementary operators generated by analytic functions. Specially, for an analytic function f, trigonometric polynomials T, S : R → C and t ∈ R, if fT S,t, f¯T T,t and f¯SS,t are the associated analytic functions, and if X ∈ B(H) and the operator P∞ n=1(AnXBn − CnXDn) belongs to a symmetric norming (s.n.) ideal CΦ(H), for some s.n. function Φ, then the following inequality holds ∞X n=1 (A∗ nAn− C∗ nCn) 1 2 fT S,t ∞X n=1 An⊗Bn X − fT S,t ∞X n=1 Cn⊗Dn X ∞X n=1 (BnB∗ n − DnD∗ n) 1 2 Φ ⩽ f¯T T,t ∞X n=1 A∗ nAn − f¯T T,t ∞X n=1 C∗ nCn 1 2 ∞X n=1 (AnXBn − CnXDn) × f¯SS,t ∞X n=1 BnB∗ n − f¯SS,t ∞X n=1 DnD∗ n 1 2 Φ , under certain conditions on the families (An)∞ n=1, (Bn)∞ n=1, (Cn)∞ n=1 and (Dn)∞ n=1 in B(H). Next, the dissertation considers vector measures induced by weak∗ integrable operator- valued functions taking values in Shatten–von Neumann ideals. Furthermore, the criteria for the compactness and nuclearity of the Gel’fand integral are derived, with emphasis on positive operator-valued functions. Finally, depending on the properties of the symmetric norming function Φ, the conse- quences of the condition sup e,f ∈B Z Ω Φ((⟨Aten, fn⟩)∞ n=1)dμ(t) < +∞. are explored. More precisely, it is proved that the weak∗ integral belongs to the symmetric ideal CΦ(H), as well as the Gelfand and Pettis integrability of the CΦ(H)-valued function A . URI: http://hdl.handle.net/123456789/5768 Files in this item: 1
Matija_Milovic_doktorska_disertacija.pdf ( 2.652Mb ) -
Čvorović - Hajdinjak, Iva (Beograd , 2025)[more][less]
Abstract: This doctoral dissertation addresses the development and application of advanced methods for analyzing the temporal variability of active galactic nuclei (AGN) through the modeling of their optical light curves. The research integrates unsupervised and generative learning techniques, by combining Self- Organizing Maps (SOM) for data preprocessing and Conditional Neural Processes (CNP) for light curve prediction. For the first time in the study of AGN light curves, clustering via SOM has been implemented for preprocessing, alongside the application of CNP for modeling variability. This innovative approach facilitates a more effective modeling of light curves characterized by uneven sampling and missing observations. The QNPy software package was developed and optimized for large-scale parallel processing of extensive time series data. The proposed methodology was validated using light curves from the All-Sky Automated Survey for SuperNovae (ASAS-SN) and the SWIFT/BAT mission, covering a broad range of time scales and variability. The analysis prove that clustering light curves with SOM enhances the performance of neural process, particularly for objects exhibiting simpler variability patterns. The effects of SOM hyperparameters on clustering and prediction performance were carefully examined. The models were validated using loss function and mean squared error evaluations on real data. The proposed methodology shows strong potential for scalable processing of the large time-series data, anticipated in upcoming projects such as the Vera C. Rubin Observatory’s Legacy Survey of Space and Time, enabling automated classification, anomaly detection, and the extraction of scientifically significant objects from catalogs containing hundreds of millions of sources. URI: http://hdl.handle.net/123456789/5766 Files in this item: 1
doktorska_disertacija_iva_cvorovic_hajdinjak.pdf ( 7.248Mb ) -
Srdanović, Vladimir (University of Belgrade , 1987)[more][less]
Abstract: The dissertation relates to the elements of medical decision-making, modeled by a consultative expert system, characteristic to the domain of rheumatology and potentially other domains of medicine with a similar structure. URI: http://hdl.handle.net/123456789/5764 Files in this item: 1
Konsultativni ekspertni sistem.pdf ( 7.218Mb ) -
Stefanović, Seđan (Beograd , 2025)[more][less]
Abstract: The subject of the dissertation is the investigation of the relation of strong BJ orthogonality in C∗-algebras. For two elements a and b of C∗-algebra A, we say that a is strong BJ orthogonal to b, if for all c ∈ A holds ‖a + bc‖ ⩾ ‖a‖ and we write a ⊥S b. If it is also true that b ⊥S a, then we say that a and b are mutual strong BJ orthogonal and write a ⊥⊥S b. To this relation, we associate an undirected graph Γ(A) (which we call an orthograf), where the vertices are the nonzero elements of the C∗-algebra A, with the identification of an element and its scalar multiple; while there is an edge between two vertices a and b if a ⊥⊥S b. We will show that for any C∗-algebra A, different from three simple C∗-algebras, and for any two non-isolated vertices a and b in the orthograph, we can find vertices c1, c2, c3 ∈ Γ(A) such that a ⊥⊥S c1 ⊥⊥S c2 ⊥⊥S c3 ⊥⊥S b. We will also describe the isolated vertices of the graph Γ(A) for any C∗-algebra A. Finally, in the case of finite-dimensional C -algebras, we will determine the diameter of Γ(A), i.e., the minimum number of elements required to connect any two vertices. URI: http://hdl.handle.net/123456789/5754 Files in this item: 1
Stefanovic_Srdjan_doktorska_disertacija.pdf ( 990.4Kb )