Iskanje po katalogu digitalne knjižnice

Opis: 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.
Ključne besede: Graph database, K-vertex cardinality constraint, Cardinality, Business rule, Property graph data model, Property graph schema, Hypernode, Performance analysis, Fraud detection, Data classification
Objavljeno v DKUM: 10.08.2022; Ogledov: 771; Prenosov: 114
Celotno besedilo (3,43 MB)

Opis: This paper deals with the automated detection of a closed curvećs dominant points. We treat a curve as a 1-D function of the arc length. The problem of detecting dominant points is translated into seeking the extrema of the corresponding 1-D function. Three approaches for automated dominant points detection are presented: (1) an approach based on fitting polynomial, (2) an approach using 1-D computer registration and (3) an innovative approach based on a multi-resolution scheme, zero-crossing and hierarchical clustering. Afterwards, two methods are introduced based on the linearly and non-linearly mixing the results from the three approaches. We then mix the results in a mean-square error sense by using the linear and non-linear fittings, respectively. We experimentally demonstrate the problem of detecting 21 landmarks on 38 vole-teeth that by mixing, the detection accuracy is improved by up to 41.47 % with respect to the results for individual approaches, as applied within the mixture.
Ključne besede: closed curve, dominant point, landmark, automated detection, mixing model fitting, vole-tooth
Objavljeno v DKUM: 10.07.2015; Ogledov: 1519; Prenosov: 28
Povezava na celotno besedilo