• Title/Summary/Keyword: graph convergence

Search Result 192, Processing Time 0.023 seconds

GRAPH CONVERGENCE AND GENERALIZED CAYLEY OPERATOR WITH AN APPLICATION TO A SYSTEM OF CAYLEY INCLUSIONS IN SEMI-INNER PRODUCT SPACES

  • Mudasir A. Malik;Mohd Iqbal Bhat;Ho Geun Hyun
    • Nonlinear Functional Analysis and Applications
    • /
    • v.28 no.1
    • /
    • pp.265-286
    • /
    • 2023
  • In this paper, we introduce and study a generalized Cayley operator associated to H(·, ·)-monotone operator in semi-inner product spaces. Using the notion of graph convergence, we give the equivalence result between graph convergence and convergence of generalized Cayley operator for the H(·, ·)-monotone operator without using the convergence of the associated resolvent operator. To support our claim, we construct a numerical example. As an application, we consider a system of generalized Cayley inclusions involving H(·, ·)-monotone operators and give the existence and uniqueness of the solution for this system. Finally, we propose a perturbed iterative algorithm for finding the approximate solution and discuss the convergence of iterative sequences generated by the perturbed iterative algorithm.

Structural Analysis and Performance Test of Graph Databases using Relational Data (관계형데이터를 이용한 그래프 데이터베이스의 모델별 구조 분석과 쿼리 성능 비교 연구)

  • Bae, Suk Min;Kim, Jin Hyung;Yoo, Jae Min;Yang, Seong Ryul;Jung, Jai Jin
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.9
    • /
    • pp.1036-1045
    • /
    • 2019
  • Relational databases have a notion of normalization, in which the model for storing data is standardized according to the organization's business processes or data operations. However, the graph database is relatively early in this standardization and has a high degree of freedom in modeling. Therefore various models can be created with the same data, depending on the database designers. The essences of the graph database are two aspects. First, the graph database allows accessing relationships between the objects semantically. Second, it makes relationships between entities as important as individual data. Thus increasing the degree of freedom in modeling and providing the modeling developers with a more creative system. This paper introduces different graph models with test data. It compares the query performances by the results of response speeds to the query executions per graph model to find out how the efficiency of each model can be maximized.

Seismic Tomography using Graph Theoretical Ray Tracing

  • Keehm, Young-Seuk;Baag, Chang-Eob;Lee, Jung-Mo
    • International Union of Geodesy and Geophysics Korean Journal of Geophysical Research
    • /
    • v.25 no.1
    • /
    • pp.23-34
    • /
    • 1997
  • Seismic tomography using the graph theoretical method of ray tracing is performed in two synthetic data sets with laterally varying velocity structures. The straight-ray tomography shows so poor results in imaging the laterally varying velocity structure that the ray-traced tomographic techniques should be used. Conventional ray tracing methods have serious drawbacks, i.e. problems of convergence and local minima, when they are applied to seismic tomography. The graph theretical method finds good approximated raypaths in rapidly varying media even in shadow zones, where shooting methods meet with convergence problems. The graph theoretical method ensures the globally minimal traveltime raypath while bending methods often cause local minima problems. Especially, the graph theoretical method is efficient in case that many sources and receivers exist, since it can find the traveltimes and corresponding raypaths to all receivers from a specific source at one time. Moreover, the algorithm of graph theoretical method is easily applicable to the ray tracing in anisotropic media, and even to the three dimensional case. Among the row-active inversion techniques, the conjugate gradient (CG) method is used because of fast convergence and high efficiency. The iterative sequence of the ray tracing by the graph theoretical method and the inversion by the CG method is an efficient and robust algorithm for seismic tomography in laterally varying velocity structures.

  • PDF

Bio-Cell Image Segmentation based on Deep Learning using Denoising Autoencoder and Graph Cuts (디노이징 오토인코더와 그래프 컷을 이용한 딥러닝 기반 바이오-셀 영상 분할)

  • Lim, Seon-Ja;Vununu, Caleb;Kwon, Oh-Heum;Lee, Suk-Hwan;Kwon, Ki-Ryoug
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.10
    • /
    • pp.1326-1335
    • /
    • 2021
  • As part of the cell division method, we proposed a method for segmenting images generated by topography microscopes through deep learning-based feature generation and graph segmentation. Hybrid vector shapes preserve the overall shape and boundary information of cells, so most cell shapes can be captured without any post-processing burden. NIH-3T3 and Hela-S3 cells have satisfactory results in cell description preservation. Compared to other deep learning methods, the proposed cell image segmentation method does not require postprocessing. It is also effective in preserving the overall morphology of cells and has shown better results in terms of cell boundary preservation.

An AND-OR Graph Search Algorithm Under the Admissibility Condition Relaxed

  • Lee, Chae-Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.14 no.1
    • /
    • pp.27-35
    • /
    • 1989
  • An algorithm that searches the general AND-OR graph is proposed. The convergence and the efficiency of the algorithm is examined and compared with an existing algorithm for the AND-OR graph. It is proved that the proposed algorithm is superior to the existing method both in the quality of the solution and the number of node expansions.

  • PDF

Semantic-based Mashup Platform for Contents Convergence

  • Yongju Lee;Hongzhou Duan;Yuxiang Sun
    • International journal of advanced smart convergence
    • /
    • v.12 no.2
    • /
    • pp.34-46
    • /
    • 2023
  • A growing number of large scale knowledge graphs raises several issues how knowledge graph data can be organized, discovered, and integrated efficiently. We present a novel semantic-based mashup platform for contents convergence which consists of acquisition, RDF storage, ontology learning, and mashup subsystems. This platform servers a basis for developing other more sophisticated applications required in the area of knowledge big data. Moreover, this paper proposes an entity matching method using graph convolutional network techniques as a preliminary work for automatic classification and discovery on knowledge big data. Using real DBP15K and SRPRS datasets, the performance of our method is compared with some existing entity matching methods. The experimental results show that the proposed method outperforms existing methods due to its ability to increase accuracy and reduce training time.

A Survey on system-based provenance graph and analysis trends (시스템 기반 프로비넌스 그래프와 분석 기술 동향)

  • Park Chanil
    • Convergence Security Journal
    • /
    • v.22 no.3
    • /
    • pp.87-99
    • /
    • 2022
  • Cyber attacks have become more difficult to detect and track as sophisticated and advanced APT attacks increase. System providence graphs provide analysts of cyber security with techniques to determine the origin of attacks. Various system provenance graph techniques have been studied to reveal the origin of penetration against cyber attacks. In this study, we investigated various system provenance graph techniques and described about data collection and analysis techniques. In addition, based on the results of our survey, we presented some future research directions.

Research on Performance of Graph Algorithm using Deep Learning Technology (딥러닝 기술을 적용한 그래프 알고리즘 성능 연구)

  • Giseop Noh
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.471-476
    • /
    • 2024
  • With the spread of various smart devices and computing devices, big data generation is occurring widely. Machine learning is an algorithm that performs reasoning by learning data patterns. Among the various machine learning algorithms, the algorithm that attracts attention is deep learning based on neural networks. Deep learning is achieving rapid performance improvement with the release of various applications. Recently, among deep learning algorithms, attempts to analyze data using graph structures are increasing. In this study, we present a graph generation method for transferring to a deep learning network. This paper proposes a method of generalizing node properties and edge weights in the graph generation process and converting them into a structure for deep learning input by presenting a matricization We present a method of applying a linear transformation matrix that can preserve attribute and weight information in the graph generation process. Finally, we present a deep learning input structure of a general graph and present an approach for performance analysis.

I-QANet: Improved Machine Reading Comprehension using Graph Convolutional Networks (I-QANet: 그래프 컨볼루션 네트워크를 활용한 향상된 기계독해)

  • Kim, Jeong-Hoon;Kim, Jun-Yeong;Park, Jun;Park, Sung-Wook;Jung, Se-Hoon;Sim, Chun-Bo
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.11
    • /
    • pp.1643-1652
    • /
    • 2022
  • Most of the existing machine reading research has used Recurrent Neural Network (RNN) and Convolutional Neural Network (CNN) algorithms as networks. Among them, RNN was slow in training, and Question Answering Network (QANet) was announced to improve training speed. QANet is a model composed of CNN and self-attention. CNN extracts semantic and syntactic information well from the local corpus, but there is a limit to extracting the corresponding information from the global corpus. Graph Convolutional Networks (GCN) extracts semantic and syntactic information relatively well from the global corpus. In this paper, to take advantage of this strength of GCN, we propose I-QANet, which changed the CNN of QANet to GCN. The proposed model performed 1.2 times faster than the baseline in the Stanford Question Answering Dataset (SQuAD) dataset and showed 0.2% higher performance in Exact Match (EM) and 0.7% higher in F1. Furthermore, in the Korean Question Answering Dataset (KorQuAD) dataset consisting only of Korean, the learning time was 1.1 times faster than the baseline, and the EM and F1 performance were also 0.9% and 0.7% higher, respectively.

CONVERGENCE OF A GENERALIZED BELIEF PROPAGATION ALGORITHM FOR BIOLOGICAL NETWORKS

  • CHOO, SANG-MOK;KIM, YOUNG-HEE
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.3_4
    • /
    • pp.515-530
    • /
    • 2022
  • A factor graph and belief propagation can be used for finding stochastic values of link weights in biological networks. However it is not easy to follow the process of use and so we presented the process with a toy network of three nodes in our prior work. We extend this work more generally and present numerical example for a network of 100 nodes.