• 한국컴퓨터정보학회논문지
• /
• 제24권7호
• /
• pp.61-69
• /
• 2019

In this paper, a classification method of random graph models is proposed and it is based on centralities of the random graphs. Similarity between two random graphs is measured for the classification of random graph models. The similarity between two random graph models $G^{R_1}$ and $G^{R_2}$ is defined by the distance of $G^{R_1}$ and $G^{R_2}$, where $G^{R_2}$ is a set of random graph $G^{R_2}=\{G_1^{R_2},...,G_p^{R_2}\}$ that have the same number of nodes and edges as random graph $G^{R_1}$. The distance($G^{R_1},G^{R_2}$) is obtained by comparing centralities of $G^{R_1}$ and $G^{R_2}$. Through the computational experiments, we show that it is possible to compare random graph models regardless of the number of vertices or edges of the random graphs. Also, it is possible to identify and classify the properties of the random graph models by measuring and comparing similarities between random graph models.

• Journal of Information Processing Systems
• /
• 제19권6호
• /
• pp.803-816
• /
• 2023

Explainable artificial intelligence is a method that explains how a complex model (e.g., a deep neural network) yields its output from a given input. Recently, graph-type data have been widely used in various fields, and diverse graph neural networks (GNNs) have been developed for graph-type data. However, methods to explain the behavior of GNNs have not been studied much, and only a limited understanding of GNNs is currently available. Therefore, in this paper, we propose an explanation method for node classification using graph convolutional networks (GCNs), which is a representative type of GNN. The proposed method finds out which features of each node have the greatest influence on the classification of that node using GCN. The proposed method identifies influential features by backtracking the layers of the GCN from the output layer to the input layer using the gradients. The experimental results on both synthetic and real datasets demonstrate that the proposed explanation method accurately identifies the features of each node that have the greatest influence on its classification.

• 한국음향학회지
• /
• 제43권2호
• /
• pp.234-242
• /
• 2024

본 논문에서는 그래프 신경망을 이용한 수동소나 신호 분류 알고리즘을 제안한다. 제안하는 알고리즘은 스펙트로그램을 영상 패치로 분할하고, 인접 거리의 영상 패치 간 연결을 통해 그래프를 표현한다. 이후, 표현된 그래프를 이용하여 그래프 합성곱 신경망을 학습하고 신호를 분류한다. 공개된 수중 음향 데이터를 이용한 실험에서 제안된 알고리즘은 스펙트로그램의 선 주파수 특징을 그래프 형태로 표현하며, 92.50 %의 우수한 분류 정확도를 갖는다. 이러한 결과는 기존의 합성곱 신경망과 비교하여 8.15 %의 높은 분류 정확도를 갖는다.

• Journal of Multimedia Information System
• /
• 제3권3호
• /
• pp.53-61
• /
• 2016

This research proposes the index optimization as a classification task and application of the graph based KNN. We need the index optimization as an important task for maximizing the information retrieval performance. And we try to solve the problems in encoding words into numerical vectors, such as huge dimensionality and sparse distribution, by encoding them into graphs as the alternative representations to numerical vectors. In this research, the index optimization is viewed as a classification task, the similarity measure between graphs is defined, and the KNN is modified into the graph based version based on the similarity measure, and it is applied to the index optimization task. As the benefits from this research, by modifying the KNN so, we expect the improvement of classification performance, more graphical representations of words which is inherent in graphs, the ability to trace more easily results from classifying words. In this research, we will validate empirically the proposed version in optimizing index on the two text collections: NewsPage.com and 20NewsGroups.

• Communications for Statistical Applications and Methods
• /
• 제27권5호
• /
• pp.569-578
• /
• 2020

Various graph clustering methods have been introduced to identify communities in social or biological networks. This paper studies the entropy-based and the Markov chain-based methods in clustering the undirected graph. We examine the performance of two clustering methods with conventional methods based on quality measures of clustering. For the real applications, we collect the mathematical subject classification (MSC) codes of research papers from published mathematical databases and construct the weighted code-to-document matrix for applying graph clustering methods. We pursue to group MSC codes into the same cluster if the corresponding MSC codes appear in many papers simultaneously. We compare the MSC clustering results based on the several assessment measures and conclude that the Markov chain-based method is suitable for clustering the MSC codes.

• Journal of applied mathematics & informatics
• /
• 제27권3_4호
• /
• pp.531-539
• /
• 2009

In this paper we first present a structure theorem for an infinite locally finite 3-connected VAP-free planar graph, and in connection with this result we study a possible classification of infinite locally finite planar graphs by reducing modulo finiteness.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.718-721
• /
• 2004

This paper introduces a novel method of partitioning a cyclic workflow graph into the subgraphs of acyclic flows. The way of iterative classification of nodes according to feedback structures and deriving subgraphs of acyclic flows is described with illustrative examples. The proposed method allows a cyclic workflow model to be analyzed further, if necessary, with several smaller subflows, which are all acyclic.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(B)
• /
• pp.522-524
• /
• 2012

For exact classification of the defect, good feature selection and classifier is necessary. In this paper, various features such as brightness features, shape features and statistical features are stated and Bayes classifier using Gaussian mixture model is used as classifier. Also feature extraction method based on spectral graph theory is presented. Experimental result shows that feature extraction method using graph Laplacian result in better performance than the result using PCA.

• 대한수학회보
• /
• 제59권1호
• /
• pp.203-212
• /
• 2022

A simple graph is called semi-symmetric if it is regular and edge transitive but not vertex transitive. In this paper we prove that there is no connected cubic semi-symmetric graph of order 12p³ for any prime number p.

• 한국수학사학회지
• /
• 제18권1호
• /
• pp.103-110
• /
• 2005

스위스 수학자 오일러에 의하여 해결된 쾨니히스베르크의 다리문제에 대한 역사적 배경과 그 응용으로서 그래프의 컴퓨터 표현에 대하여 간단한 예를 통하여 행렬로 표현하였고 오일러 회로에 의한 행렬 표현을 연구해 보았다.