Paulius Danenas

Dr. Paulius Danenas

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2015 in Expert Systems with Applications
Verified
Journal Article
Closed access
PDPaulius Danenas
Paulius Danenas
GGGintautas Garsva
Gintautas Garsva

1 January 2011 in Procedia Computer Science
Verified
Journal Article
Open access
PDPaulius Danenas
Paulius Danenas
GGGintautas Garsva
Gintautas Garsva
SGSaulius Gudas
Saulius Gudas
This article presents a study on development of credit risk evaluation model using Support Vector Machines based classifiers, such as linear SVM, stochastic gradient descent based SVM, LibSVM, Core Vector Machines (CVM), Ball Vector Machines (BVM) and other. Discriminant analysis was applied for evaluation of financial instances and dynamic formation of bankruptcy classes. The possibilities of feature selection application were also researched by applying correlation-based feature subset evaluator and Tabu search. This research showed that different SVM classifiers produced similar results, including Core Vector Machines based classifier. Yet proper selection of classifier and its parameters remains an important problem.

30 March 2018 in Journal of Systems and Software
Verified
Journal Article
Closed access
Tomas SkersysTomas Skersys
Tomas Skersys
PDPaulius Danenas
Paulius Danenas
RBRimantas Butleris
Rimantas Butleris

4 November 2022 in IEEE Access
Verified
Journal Article
Open access
PDPaulius Danenas
Paulius Danenas
Tomas SkersysTomas Skersys
Tomas Skersys
In this paper, we explore the possibility to apply natural language processing in visual model-to-model (M2M) transformations. Therefore, we present our research results on information extraction from text labels in process models modeled using Business Process Modeling Notation (BPMN) and use case models depicted in Unified Modeling Language (UML) using the most recent developments in natural language processing (NLP). In this paper, we focus on three relevant tasks, namely, the extraction of verb/noun phrases that would be used to form relations, parsing of conjunctive/disjunctive statements, and the detection of abbreviations and acronyms. Relation extraction was attempted to solve by implementing techniques that combine state-of-the-art NLP language models with formal regular expressions grammar-based structure detection. In this paper, we perform thorough testing of the most recent state-of-the-art NLP tools (CoreNLP, Stanford Stanza, Flair, Spacy, AllenNLP, BERT, ELECTRA), as well as custom BERT-BiLSTM-CRF and ELMo-BiLSTM-CRF implementations, trained with certain data augmentations to improve performance on the most ambiguous cases; these tools are used as a foundation for building tools to extract noun and verb phrases from short text labels generally used in UML and BPMN models. Furthermore, we describe our attempts to improve these extractors by solving the abbreviation/acronym detection problem using machine learning-based detection, as well as process conjunctive and disjunctive statements, due to their relevance to performing advanced text normalization. The obtained results show that the best phrase extraction and conjunctive phrase processing performance was obtained using Stanza based implementation, yet, our trained BERT-BiLSTM-CRF outperformed it for the verb phrase detection task. Our acronym detection approach resulted in the precision of 0.78 and F1-Score of 0.73 which may also be considered quite positive. While this work was inspired by our ongoing research on partial model-to-model transformations, we believe it to be applicable in other areas requiring similar text processing capabilities as well.

20 January 2014 in Nonlinear Analysis Modelling and Control
Verified
Journal Article
Open access
GGGintautas Garšva
Gintautas Garšva
PDPaulius Danenas
Paulius Danenas
Particle swarm optimization is a metaheuristic technique widely applied to solve various optimization problems as well as parameter selection problems for various classification techniques. This paper presents an approach for linear support vector machines classifier optimization combining its selection from a family of similar classifiers with parameter optimization. Experimental results indicate that proposed heuristics can help obtain competitive or even better results compared to similar techniques and approaches and can be used as a solver for various classification tasks.

1 January 2012 in Procedia Computer Science
Verified
Journal Article
Open access
PDPaulius Danenas
Paulius Danenas
GGGintautas Garsva
Gintautas Garsva
This paper presents a study on credit risk evaluation modeling using linear Support Vector Machines (SVM) classifiers, combined with evolutionary parameter selection using Genetic Algorithms and Particle Swarm Optimization, and sliding window approach. Discriminant analysis was applied for evaluation of financial instances and dynamic formation of bankruptcy classes. The possibilities of feature selection application were also researched by applying correlation-based feature subset evaluator. The research demonstrates a possibility to develop and apply an intelligent classifier based on original discriminant analysis method evaluation and shows that it might perform bankruptcy identification better than original model