Peter Grabusts

Dr. Peter Grabusts

orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
12 March 2019 in Procedia Computer Science
Verified
Journal Article
Open access
PDF file
PGPeter Grabusts
Peter Grabusts
JMJurijs Musatovs
Jurijs Musatovs
VGVladimir Golenkov
Vladimir Golenkov
A shortcut search between different objects is one of the classic optimization goals. Simulated Annealing algorithms are often used for optimization purposes. The Simulated Annealing method is applied in combinatorial optimization tasks. Simulated Annealing is a stochastic optimization method that can be used to minimize the specified cost function given a combinatorial system with multiple degrees of freedom. The application of Simulated Annealing method and Travelling Salesman Problem is demonstrated in this paper and an experiment aimed to find the shortest route between Belarusian processing enterprises is performed. The paper also provides mapping of these objects using GPS location. The main goal of the paper is to show the possibilities of applying mathematical models in solving practical tasks - to determine the shortest route between the different objects.

5 August 2015 in ENVIRONMENT. TECHNOLOGIES. RESOURCES. Proceedings of the International Scientific and Practical Conference
Verified
Journal Article
Closed access
PDF file
PGPeter Grabusts
Peter Grabusts
Methods of data analysis and automatic processing are treated as knowledge discovery. In many cases it is necessary to classify data in some way or find regularities in the data. That is why the notion of similarity is becoming more and more important in the context of intelligent data processing systems. It is frequently required to ascertain how the data are interrelated, how various data differ or agree with each other, and what the measure of their comparison is. An important part in detection of similarity in clustering algorithms plays the accuracy in the choice of metrics and the correctness of the clustering algorithms operation.

26 June 2003
Verified
Conference Paper
Closed access
PGPeter Grabusts
Peter Grabusts
ABA. Borisov
A. Borisov
This paper examines grid-clustering method. Unlike the conventional methods, this method organizes the space surrounding the patterns. It uses a multidimensional grid data structure. The resulting block partitioning of the value space is clustered via a neighbor search. The mathematical description of the algorithms employed is given. Some case studies and ideas how to use the algorithms are described.

16 June 2015 in ENVIRONMENT. TECHNOLOGIES. RESOURCES. Proceedings of the International Scientific and Practical Conference
Verified
Journal Article
Open access
PDF file
AZAleksejs Zorins
Aleksejs Zorins
PGPeter Grabusts
Peter Grabusts
There are numerous applications of Artificial Neural Networks (ANN) at the present time and there are different learning algorithms, topologies, hybrid methods etc. It is strongly believed that ANN is built using human brain’s functioning principles but still ANN is very primitive and tricky way for real problem solving. In the recent years modern neurophysiology advanced to a big extent in understanding human brain functions and structure, however, there is a lack of this knowledge application to real ANN learning algorithms. Each learning algorithm and each network topology should be carefully developed to solve more or less complex problem in real life. One may say that almost each serious application requires its own network topology, algorithm and data pre-processing. This article presents a survey of several ways to improve ANN learning possibilities according to human brain structure and functioning, especially one example of this concept – neuroplasticity – automatic adaptation of ANN topology to problem domain.

4 May 2023 in Risks
Verified
Journal Article
Open access
PDF file
OUOleg Uzhga-Rebrov
Oleg Uzhga-Rebrov
PGPeter Grabusts
Peter Grabusts
Ecological risks are characterized by a high degree of uncertainty about the chances of unfavorable event outcomes and the losses associated with those outcomes. Subjective expert judgment is widely used when baseline data are insufficient. This introduces additional uncertainties in the results of risk analyses. In order to successfully model the existing uncertainties, this paper presents a methodology for ecological risk analysis that is based on input evaluations in the form of intuitionistic fuzzy values (IFVs). The advantage of this approach is the ability to model a wide range of uncertainties in ecological risk analysis tasks.

1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
ALAleksandrs Larionovs
Aleksandrs Larionovs
ATArtis Teilans
Artis Teilans
PGPeter Grabusts
Peter Grabusts
As more users joining social networks possibility of threats is growing, as the information can be reached by expanding number of individuals that increases the possibility that the information “package” will find way to subjects with the appropriate degree of sensitivity to the information – vulnerability. Therefore, the risk management process and, in particular, the risk identification and analysis of key characteristics should be performed. Presented paper describes usage of CORAS methodology for modelling of social network risks