• 제목/요약/키워드: Graph Analysis

검색결과 1,195건 처리시간 0.026초

EFFICIENT ALGORITHMS TO COMPUTE ALL ARTICULATION POINTS OF A PERMUTATION GRAPH

  • Pal, Madhumangal
    • Journal of applied mathematics & informatics
    • /
    • 제5권1호
    • /
    • pp.141-152
    • /
    • 1998
  • Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.

에센셜 그래프를 바탕으로 한 격자 조건부 독립 모델 (Lattice Conditional Independence Models Based on the Essential Graph)

  • Ju Sung, Kim;Myoong Young, Yoon
    • 한국산업정보학회논문지
    • /
    • 제9권2호
    • /
    • pp.9-16
    • /
    • 2004
  • 결측치가 존재하는 비 단조형 데이터에 대한 패턴 분석과 비 내포형 종속 회귀 모형 분석에 격자 조건부 독립 모델이 최근 도입되고 있다. 이러한 접근 방법은 데이터 패턴 분석에 성공적으로 적용되고 있지만 격자 조건부 독립 모델을 찾는 계산적 부담이 따른다. 본 논문에서는 이러한 단점을 극복하기 위하여 에센셜 그래프를 바탕으로 격자 조건부 독립 모델(LCIM)을 찾는 새로운 방법을 제안한다. 또한, LCIM 클래스가 특정한 비 순환 방향 그래프 모델과 마르코프 동등한 모든 추이적 비 순환 방향 그래프의 모델 클래스와 일치함을 밝혔다.

  • PDF

A NODE PREDICTION ALGORITHM WITH THE MAPPER METHOD BASED ON DBSCAN AND GIOTTO-TDA

  • DONGJIN LEE;JAE-HUN JUNG
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제27권4호
    • /
    • pp.324-341
    • /
    • 2023
  • Topological data analysis (TDA) is a data analysis technique, recently developed, that investigates the overall shape of a given dataset. The mapper algorithm is a TDA method that considers the connectivity of the given data and converts the data into a mapper graph. Compared to persistent homology, another popular TDA tool, that mainly focuses on the homological structure of the given data, the mapper algorithm is more of a visualization method that represents the given data as a graph in a lower dimension. As it visualizes the overall data connectivity, it could be used as a prediction method that visualizes the new input points on the mapper graph. The existing mapper packages such as Giotto-TDA, Gudhi and Kepler Mapper provide the descriptive mapper algorithm, that is, the final output of those packages is mainly the mapper graph. In this paper, we develop a simple predictive algorithm. That is, the proposed algorithm identifies the node information within the established mapper graph associated with the new emerging data point. By checking the feature of the detected nodes, such as the anomality of the identified nodes, we can determine the feature of the new input data point. As an example, we employ the fraud credit card transaction data and provide an example that shows how the developed algorithm can be used as a node prediction method.

funcGNN과 Siamese Network의 코드 유사성 분석 성능비교 (Comparison of Code Similarity Analysis Performance of funcGNN and Siamese Network)

  • 최동빈;조인수;박용범
    • 반도체디스플레이기술학회지
    • /
    • 제20권3호
    • /
    • pp.113-116
    • /
    • 2021
  • As artificial intelligence technologies, including deep learning, develop, these technologies are being introduced to code similarity analysis. In the traditional analysis method of calculating the graph edit distance (GED) after converting the source code into a control flow graph (CFG), there are studies that calculate the GED through a trained graph neural network (GNN) with the converted CFG, Methods for analyzing code similarity through CNN by imaging CFG are also being studied. In this paper, to determine which approach will be effective and efficient in researching code similarity analysis methods using artificial intelligence in the future, code similarity is measured through funcGNN, which measures code similarity using GNN, and Siamese Network, which is an image similarity analysis model. The accuracy was compared and analyzed. As a result of the analysis, the error rate (0.0458) of the Siamese network was bigger than that of the funcGNN (0.0362).

압전 트랜스듀서 설계를 위한 bond graph 모델링 (Bond graph modeling approach for piezoelectric transducer design)

  • 문원규
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
    • /
    • pp.265-271
    • /
    • 1997
  • A bond graph modeling approach which is equivalent to a finite element method is formulated in the case of the piezoelectric thickness vibrator. This formulation suggests a new definition of the generalized displacements for a continuous system as well as the piezoelectric thickness vibrator. The newly defined coordinates are illustrated to be easily interpreted physically and easily used in analysis of the system performance. Compared to the Mason equivalent circuit model, the bond graph model offers the primary advantage of physical realizability. Compared to circuit models based on standard discrete electrical elements, the main advantage of the bond graph model is a greater physical accuracy because of the use of multiport energic elements. While results are presented here for the thickness vibrator, the modeling method presented is general in scope and can be applied to arbitrary physical systems.

  • PDF

웹 이용자의 접속 정보 분석을 통한 웹 활용 그래프의 구성 및 분석 (An analysis on the web usage pattern graph using web users' access information)

  • 김후곤
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2005년도 추계학술대회 및 정기총회
    • /
    • pp.422-440
    • /
    • 2005
  • There are many kinds of research on web graph, most of them are focus on the hyperlinked structure of the web graph. Well known results on the web graph are rich-get-richer phenomenon, small-world phenomenon, scale-free network, etc. In this paper, we define a new directed web graph, so called the Web Usage Pattern Graph (WUPG), that nodes represent web sites and arcs between nodes represent a movement between two sites by users' browsing behavior. The data to constructing the WUPG, approximately 56,000 records, are gathered in the Kyungsung University. The results analysing the data summarized as follows: (i) extremely rich-get-richer phenomenon (ii) average path length between sites is significantly less than the previous one (iii) less external hyperlinks, more internal hyperlinks

  • PDF

MasterSizer와 SediGraph에 의한 입도분석 결과의 비교 및 문제점 (Comparison of Two Methods in Grain-size analysis: SediGraph and Master Sizer)

  • 정회수;김광신
    • 한국해양학회지
    • /
    • 제28권1호
    • /
    • pp.72-78
    • /
    • 1993
  • MasterSizer와 SediGraph를 이용하여 표준입자와 여러 종유의 퇴적물을 분석하고 그 결과를 비교하였다. SediGraph에 의해 분석된 퇴적물 시료의 입도분석 결과는 MasterSizer에 의한 결과보다 세립하게 나타나는 데, 특히 심해저의 규질연니 퇴적물 에서 그 차이가 크다. 이러한 차이는 시료의 전처리 과정, 기기에 도입되는 시료 농 도, 세립한 입자(약 1um 이하) 감지 능력, 그리고 비구형 입자가 두 기기에 인지되는 방식 등 두 방법상의 여러 가지 다른 점에 기인할 가능성이 있다.

  • PDF

방향성 적선도의 제안과 회로망 해석에의 응용 (I) (A Proposal of the Directed Product Graph and Its Applications to Network Analysis (I))

  • 전선미;김수중
    • 대한전자공학회논문지
    • /
    • 제21권2호
    • /
    • pp.19-23
    • /
    • 1984
  • 새로운 방향성 적선도(directed product graph; DPG)를 제안하고 적선도에 가지의 방향성과 그 환로의 개념을 도입하므로 상위수학적으로 능동과 또한 결합성 소자까지 포함하는 회로에 대한 Mason공식의 분모(△)항을 그 부호와 소거항에 무관하게 보다 쉽게 구하게 하였다. 또한 이때 회로망 선도에서 나무(tree)를 선택하는데 따르는 제약조건을 제거하였다.

  • PDF

Microwave Network Study by Bond Graph Approach. Application to Tow-Port Network Filter

  • Jmal, Sabri;Taghouti, Hichem;Mami, Abdelkader
    • International Journal of Computer Science & Network Security
    • /
    • 제22권1호
    • /
    • pp.121-128
    • /
    • 2022
  • There are much processing techniques of microwave circuits, whose dimensions are small compared to the wavelength, but the disadvantage is that they cannot be directly applied to circuits working at high and/or low frequencies. In this article, we will consider the bond graph approach as a tool for analyzing and understanding the behavior of microwave circuits, and to show how basic circuit and network concepts can be extended to handle many microwaves analysis and design problems of practical interest. This behavior revealed in the scattering matrix filter, and which will be operated from its reduced bond graph model. So, we propose in this paper, a new application of bond graph approach jointly with the scattering bond graph for a high frequency study.

현대 뮤지엄 건축의 시지각적 중심성 분석에 관한 연구 - 가시장분석(Visibility Graph Analysis)을 중심으로 - (A Study on Visual-perceptual Centrality in Contemporary Museum Architecture - Focused on Visibility Graph Analysis -)

  • 박종구
    • 한국실내디자인학회논문집
    • /
    • 제23권2호
    • /
    • pp.166-173
    • /
    • 2014
  • This study analyzed visual-perceptual centrality as a measure to solve the confusion that might occur in visitor's movement in analyzing contemporary museums that have recently expand. Also, this study proposed a new methodology to understand the relationships of the occurrence and convergence of visual-perceptual power. The existing visibility graph analysis mostly ends up in identifying nodes corresponding to the physical environment of museums while the newly proposed visibility graph analysis is a methodology that can analyze the landmark on which the visual-perceptual power occurs and converges, by setting visible space elements as analysis variables, which showed a possibility to draw more reliable results in parallel to the existing analysis, and the results of this analysis are as follows. A public museum located in downtown has a limitation that it cannot but be multi-layered as a way to enlarge for the accommodation of a variety of programs on a limited site. Also, this study found that the problem of visitor orientation occurring in the multi-layer process was solved by a major space which was visual-perceptually void. Also, its types can be summarized into two types: One is setting parameter spaces (ramps, staircases, hallways) linked visual-perceptually to the major space and the other is solving the confusion of the visitor's movement by composing a simple exhibition space. In particular, it is judged that the type solving the confusion of the visitor's movement by composing a simple exhibition space also had a relationship with changes in the characteristics of the exhibited works by period. In addition, it was found that the entrance also appeared in two types: dependent type and independent type in the major space according to the characteristics of the major space.