| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 10 / 22
First pagePrevious page123Next pageLast page
1.
An efficient iterative approach to explainable feature learning
Dino Vlahek, Domen Mongus, 2023, original scientific article

Keywords: data classification, explainable artificial intelligence, feature learning, knowledge discovery
Published in DKUM: 13.06.2024; Views: 48; Downloads: 4
.pdf Full text (1,95 MB)
This document has many files! More...

2.
Categorisation of open government data literature
Aljaž Ferencek, Mirjana Kljajić Borštnar, Ajda Pretnar Žagar, 2022, review article

Abstract: Background: Due to the emerging global interest in Open Government Data, research papers on various topics in this area have increased. Objectives: This paper aims to categorise Open government data research. Methods/Approach: A literature review was conducted to provide a complete overview and classification of open government data research. Hierarchical clustering, a cluster analysis method, was used, and a hierarchy of clusters on selected data sets emerged. Results: The results of this study suggest that there are two distinct clusters of research, which either focus on government perspectives and policies on OGD, initiatives, and portals or focus on regional studies, adoption of OGD, platforms, and barriers to implementation. Further findings suggest that research gaps could be segmented into many thematic areas, focusing on success factors, best practices, the impact of open government data, barriers/challenges in implementing open government data, etc. Conclusions: The extension of the paper, which was first presented at the Entrenova conference, provides a comprehensive overview of research to date on the implementation of OGD and points out that this topic has already received research attention, which focuses on specific segments of the phenomenon and signifies in which direction new research should be made.
Keywords: open government data, open government data research, hierarchical clustering, OGD classification, OGD literature overview
Published in DKUM: 12.06.2024; Views: 48; Downloads: 0
.pdf Full text (539,06 KB)
This document has many files! More...

3.
0-form, 1-form, and 2-group symmetries via cutting and gluing of orbifolds
Mirjam Cvetič, Jonathan J. Heckman, Max Hübner, Ethan Torres, 2022, original scientific article

Abstract: Orbifold singularities of M-theory constitute the building blocks of a broad class of supersymmetric quantum field theories (SQFTs). In this paper we show how the local data of these geometries determine global data on the resulting higher symmetries of these systems. In particular, via a process of cutting and gluing, we show how local orbifold singularities encode the 0-form, 1-form, and 2-group symmetries of the resulting SQFTs. Geometrically, this is obtained from the possible singularities that extend to the boundary of the noncompact geometry. The resulting category of boundary conditions then captures these symmetries and is equivalently specified by the orbifold homology of the boundary geometry. We illustrate these general points in the context of a number of examples, including five-dimensional (5D) superconformal field theories engineered via orbifold singularities, 5D gauge theories engineered via singular elliptically fibered Calabi-Yau threefolds, as well as four-dimensional supersymmetric quantum chromodynamics-like theories engineered via M-theory on noncompact G2 spaces.
Keywords: F-theory, compactifications, classification, singularities, instantons, geometry
Published in DKUM: 06.06.2024; Views: 76; Downloads: 4
.pdf Full text (863,93 KB)
This document has many files! More...

4.
Adaptive boosting method for mitigating ethnicity and age group unfairness
Ivona Colakovic, Sašo Karakatič, 2024, original scientific article

Abstract: Machine learning algorithms make decisions in various fields, thus influencing people’s lives. However, despite their good quality, they can be unfair to certain demographic groups, perpetuating socially induced biases. Therefore, this paper deals with a common unfairness problem, unequal quality of service, that appears in classification when age and ethnicity groups are used. To tackle this issue, we propose an adaptive boosting algorithm that aims to mitigate the existing unfairness in data. The proposed method is based on the AdaBoost algorithm but incorporates fairness in the calculation of the instance’s weight with the goal of making the prediction as good as possible for all ages and ethnicities. The results show that the proposed method increases the fairness of age and ethnicity groups while maintaining good overall quality compared to traditional classification algorithms. The proposed method achieves the best accuracy in almost every sensitive feature group. Based on the extensive analysis of the results, we found that when it comes to ethnicity, interestingly, White people are likely to be incorrectly classified as not being heroin users, whereas other groups are likely to be incorrectly classified as heroin users.
Keywords: fairness, boosting, machine learning, classification
Published in DKUM: 24.05.2024; Views: 196; Downloads: 7
.pdf Full text (1,66 MB)
This document has many files! More...

5.
Reduction of Neural Machine Translation Failures by Incorporating Statistical Machine Translation
Jani Dugonik, Mirjam Sepesy Maučec, Domen Verber, Janez Brest, 2023, original scientific article

Abstract: This paper proposes a hybrid machine translation (HMT) system that improves the quality of neural machine translation (NMT) by incorporating statistical machine translation (SMT). Therefore, two NMT systems and two SMT systems were built for the Slovenian-English language pair, each for translation in one direction. We used a multilingual language model to embed the source sentence and translations into the same vector space. From each vector, we extracted features based on the distances and similarities calculated between the source sentence and the NMT translation, and between the source sentence and the SMT translation. To select the best possible translation, we used several well-known classifiers to predict which translation system generated a better translation of the source sentence. The proposed method of combining SMT and NMT in the hybrid system is novel. Our framework is language-independent and can be applied to other languages supported by the multilingual language model. Our experiment involved empirical applications. We compared the performance of the classifiers, and the results demonstrate that our proposed HMT system achieved notable improvements in the BLEU score, with an increase of 1.5 points and 10.9 points for both translation directions, respectively.
Keywords: neural machine translation, statistical machine translation, sentence embedding, similarity, classification, hybrid machine translation
Published in DKUM: 20.02.2024; Views: 243; Downloads: 21
.pdf Full text (400,40 KB)
This document has many files! More...

6.
Acoustic Gender and Age Classification as an Aid to Human–Computer Interaction in a Smart Home Environment
Damjan Vlaj, Andrej Žgank, 2023, original scientific article

Abstract: The advanced smart home environment presents an important trend for the future of human wellbeing. One of the prerequisites for applying its rich functionality is the ability to differentiate between various user categories, such as gender, age, speakers, etc. We propose a model for an efficient acoustic gender and age classification system for human–computer interaction in a smart home. The objective was to improve acoustic classification without using high-complexity feature extraction. This was realized with pitch as an additional feature, combined with additional acoustic modeling approaches. In the first step, the classification is based on Gaussian mixture models. In thesecond step, two new procedures are introduced for gender and age classification. The first is based on the count of the frames with the speaker’s pitch values, and the second is based on the sum of the frames with pitch values belonging to a certain speaker. Since both procedures are based on pitch values, we have proposed a new, effective algorithm for pitch value calculation. In order to improve gender and age classification, we also incorporated speech segmentation with the proposed voice activity detection algorithm. We also propose a procedure that enables the quick adaptation of the classification algorithm to frequent smart home users. The proposed classification model with pitch values has improved the results in comparison with the baseline system.
Keywords: acoustic classification, acoustic signal processing, Gaussian mixture model, pitch analysis, smart home
Published in DKUM: 11.12.2023; Views: 390; Downloads: 18
.pdf Full text (2,07 MB)
This document has many files! More...

7.
Towards the classification of self-sovereign identity properties
Špela Čučko, Šeila Bećirović, Aida Kamišalić Latifić, Saša Mrdović, Muhamed Turkanović, 2022, original scientific article

Abstract: Self-Sovereign Identity (SSI) is a novel and emerging, decentralized digital identity approach that enables entities to control and manage their digital identifiers and associated identity data while enhancing trust, privacy, security, and the many other properties identified and analyzed in this paper. The paper provides an overview and classification of the SSI properties, focusing on an in-depth analysis, furthermore, presenting a comprehensive collection of SSI properties that are important for the implementation of the SSI system. In addition, it explores the general SSI process flow, and highlights the steps in which individual properties are important. After the initial purification and classification phase, we then validated properties among experts in the field of Decentralized and Self-Sovereign Identity Management using an online questionnaire, which resulted in a final set of classified and verified SSI properties. The results can be used for further work on definition and standardization of the SSI field.
Keywords: classification, credential, decentralized, identity, identified, principles, properties, selfsovereign, verifiable
Published in DKUM: 22.09.2023; Views: 251; Downloads: 32
.pdf Full text (5,62 MB)
This document has many files! More...

8.
Scoping review on the multimodal classification of depression and experimental study on existing multimodal models
Umut Arioz, Urška Smrke, Nejc Plohl, Izidor Mlakar, 2022, review article

Abstract: Depression is a prevalent comorbidity in patients with severe physical disorders, such as cancer, stroke, and coronary diseases. Although it can significantly impact the course of the primary disease, the signs of depression are often underestimated and overlooked. The aim of this paper was to review algorithms for the automatic, uniform, and multimodal classification of signs of depression from human conversations and to evaluate their accuracy. For the scoping review, the PRISMA guidelines for scoping reviews were followed. In the scoping review, the search yielded 1095 papers, out of which 20 papers (8.26%) included more than two modalities, and 3 of those papers provided codes. Within the scope of this review, supported vector machine (SVM), random forest (RF), and long short-term memory network (LSTM; with gated and non-gated recurrent units) models, as well as different combinations of features, were identified as the most widely researched techniques. We tested the models using the DAIC-WOZ dataset (original training dataset) and using the SymptomMedia dataset to further assess their reliability and dependency on the nature of the training datasets. The best performance was obtained by the LSTM with gated recurrent units (F1-score of 0.64 for the DAIC-WOZ dataset). However, with a drop to an F1-score of 0.56 for the SymptomMedia dataset, the method also appears to be the most data-dependent.
Keywords: multimodal depression classification, scoping review, real-world data, mental health
Published in DKUM: 11.08.2023; Views: 449; Downloads: 46
.pdf Full text (1,43 MB)
This document has many files! More...

9.
Improved Boosted Classification to Mitigate the Ethnicity and Age Group Unfairness
Ivona Colakovic, Sašo Karakatič, 2022, published scientific conference contribution

Abstract: This paper deals with the group fairness issue that arises when classifying data, which contains socially induced biases for age and ethnicity. To tackle the unfair focus on certain age and ethnicity groups, we propose an adaptive boosting method that balances the fair treatment of all groups. The proposed approach builds upon the AdaBoost method but supplements it with the factor of fairness between the sensitive groups. The results show that the proposed method focuses more on the age and ethnicity groups, given less focus with traditional classification techniques. Thus the resulting classification model is more balanced, treating all of the sensitive groups more equally without sacrificing the overall quality of the classification.
Keywords: fairness, classification, boosting, machine learning
Published in DKUM: 02.08.2023; Views: 433; Downloads: 31
.pdf Full text (884,95 KB)
This document has many files! More...

10.
K-vertex: a novel model for the cardinality constraints enforcement in graph databases : doctoral dissertation
Martina Šestak, 2022, doctoral dissertation

Abstract: The increasing number of network-shaped domains calls for the use of graph database technology, where there are continuous efforts to develop mechanisms to address domain challenges. Relationships as 'first-class citizens' in graph databases can play an important role in studying the structural and behavioural characteristics of the domain. In this dissertation, we focus on studying the cardinality constraints mechanism, which also exploits the edges of the underlying property graph. The results of our literature review indicate an obvious research gap when it comes to concepts and approaches for specifying and representing complex cardinality constraints for graph databases validated in practice. To address this gap, we present a novel and comprehensive approach called the k-vertex cardinality constraints model for enforcing higher-order cardinality constraints rules on edges, which capture domain-related business rules of varying complexity. In our formal k-vertex cardinality constraint concept definition, we go beyond simple patterns formed between two nodes and employ more complex structures such as hypernodes, which consist of nodes connected by edges. We formally introduce the concept of k-vertex cardinality constraints and their properties as well as the property graph-based model used for their representation. Our k-vertex model includes the k-vertex cardinality constraint specification by following a pre-defined syntax followed by a visual representation through a property graph-based data model and a set of algorithms for the implementation of basic operations relevant for working with k-vertex cardinality constraints. In the practical part of the dissertation, we evaluate the applicability of the k-vertex model on use cases by carrying two separate case studies where we present how the model can be implemented on fraud detection and data classification use cases. We build a set of relevant k-vertex cardinality constraints based on real data and explain how each step of our approach is to be done. The results obtained from the case studies prove that the k-vertex model is entirely suitable to represent complex business rules as cardinality constraints and can be used to enforce these cardinality constraints in real-world business scenarios. Next, we analyze the performance efficiency of our model on inserting new edges into graph databases with varying number of edges and outgoing node degree and compare it against the case when there is no cardinality constraints checking. The results of the statistical analysis confirm a stable performance of the k-vertex model on varying datasets when compared against a case with no cardinality constraints checking. The k-vertex model shows no significant performance effect on property graphs with varying complexity and it is able to serve as a cardinality constraints enforcement mechanism without large effects on the database performance.
Keywords: Graph database, K-vertex cardinality constraint, Cardinality, Business rule, Property graph data model, Property graph schema, Hypernode, Performance analysis, Fraud detection, Data classification
Published in DKUM: 10.08.2022; Views: 694; Downloads: 77
.pdf Full text (3,43 MB)

Search done in 0.97 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica