• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.33-39
• /
• 2024

In a previous study we proceeded to the remodularization architecture based on classes and packages using the Formal Concept Analysis (FCA)[13] [14] [30]. we then got two possible remodularized architectures and we explored the issue of redistributing classes of a package to other packages, we used an approach based on Oriented Graph to determine the packages that receive the redistributed classes and we evaluated the quality of a remodularized software architecture by metrics [31] [28] [29]. In this paper, we will address the issue of the efficiency of the Oriented Graph in the remodularization of software architectures compared to the Formal Concept Analysis FCA method. The formal method of FCA concept is not popularized among scientists as opposed to the use of the labeled directed graph. It is for this reason that our directed graph approach is more effective in its simplicity and popularity.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.333-351
• /
• 2002

This paper introduces a search method based on conceptual graph. A hyperlink information is essential to construct conceptual graph in web. The information is very useful as it provides summary and further linkage to construct conceptual graph that has been provided by human. It also has a property which shows review, relation, hierarchy, generality, and visibility. Using this property, we extracted the keywords of web documents and made up of the conceptual graph among the keywords sampled from web pages. This paper extracts the keywords of web pages using anchor text one out of hyperlink information and makes hyperlink of web pages abstract as the link relation between keywords of each web page. 1 suggest this useful search method providing querying word extension or domain knowledge by conceptual graph of keywords. Domain knowledge was conceptualized knowledged as the conceptual graph. Then it is not listing web documents which is the defect of previous search system. And it gives the index of concept associating with querying word.

• The Journal of Information Systems
• /
• v.5
• /
• pp.149-173
• /
• 1996

This paper focus on the development of object-oriented model bases for Structured Modeling. For the model base organization, object modeling techniques and model typing concept which is similar to data typing concept are used. Structured modeling formalizes the notion of a definitional system as a way of dscribing models. From the object-oriented concept, a structured model can be represented as follows. Each group of similar elements(genus) is represented by a composite class. Other type of genera can be represented in a similar manner. This hierarchical class composition gives rise to an acyclic class-composition graph which corresponds with the genus graph of structured model. Nodes in this graph are instantiated to represent the elemental graph for a specific model. Taking this class composition process one step further, we aggregate the classes into higher-level composite classes which would correspond to the structured modeling notion of a module. Finally, the model itself is then represented by a composite class having attributes each of whose domain is a composite class representing one of the modules. The resulting class-composition graph represent the modular tree of the structured.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2986-2999
• /
• 2019

The uncertainties of the uncertain graph make the traditional definition and algorithms on mining dense graph for certain graph not applicable. The subgraph obtained by maximizing expected density from an uncertain graph always has many low edge-probability data, which makes it low reliable and low expected edge density. Based on the concept of ${\beta}$-subgraph, to overcome the low reliability of the densest subgraph, the concept of optimal ${\beta}$-subgraph is proposed. An efficient greedy algorithm is also developed to find the optimal ${\beta}$-subgraph. Simulation experiments of multiple sets of datasets show that the average edge-possibility of optimal ${\beta}$-subgraph is improved by nearly 40%, and the expected edge density reaches 0.9 on average. The parameter ${\beta}$ is scalable and applicable to multiple scenarios.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.450-456
• /
• 1990

In this paper, production system is implemented with the inferential neural network model using semantic network and directed graph. Production system can be implemented with the transform of knowledge representation in production system into semantic network and of semantic network into directed graph, because directed graphs can be expressed by neural matrices. A concept node should be defined by the state vector to calculated the concepts expressed by matrices. The expressional ability of neunal network depends on how the state vector is defined. In this study, state vector is overlapped and each overlapping part acts as a inheritant of concept.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.245-252
• /
• 2012

In this paper we present a necessary and sufficient conditions for an infinite VAP-free plane graph to be a 3LV-graph as well as an LV-graph. We also introduce and investigate the concept of the order and the kernel of an infinite connected graph containing no one-way infinite path.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.519-524
• /
• 2007

Facility location problems deal with the concept of centrality and centrality questions are examined using graphs and eccentricity. In this paper, we give interesting properties of a tree in relation with the number of central vertices and peripheral vertices. Also we have some conditions to be an eccentric graph in terms of the girth of a graph.

• International Journal of Computer Science & Network Security
• /
• v.22 no.9
• /
• pp.31-34
• /
• 2022

The concept of locating chromatic number of graph is a development of the concept of vertex coloring and partition dimension of graph. The locating-chromatic number of G, denoted by χ_L(G) is the smallest number such that G has a locating k-coloring. In this paper we will discussed about the procedure for determine the locating chromatic number of Origami graph using Python Programming.

• 한국정보교육학회:학술대회논문집
• /
• 2010.08a
• /
• pp.227-233
• /
• 2010

Graph is applied to GIS, Network, AI and so on. We use graph concept in our daily life unconsciously. So this paper describe how graph concept is used when robot searches shortest path between two distinct vertices. It is performed in real world. For this, it consists of three step; maze traverse, graph generation, and shortest path search. Maze traverse steps is that robot navigates maze. It is most difficult step. Graph generation step is to represent structural information into graph. Shortest path search step is to that robot move between two vertices. It is not implemented yet. So we introduce process in design level.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.3
• /
• pp.91-100
• /
• 2020

Unlike the existing Visual Question Answering(VQA) problems, the new Visual Commonsense Reasoning(VCR) problems require deep common sense reasoning for answering questions: recognizing specific relationship between two objects in the image, presenting the rationale of the answer. In this paper, we propose a novel deep neural network model, KG_VCR, for VCR problems. In addition to make use of visual relations and contextual information between objects extracted from input data (images, natural language questions, and response lists), the KG_VCR also utilizes commonsense knowledge embedding extracted from an external knowledge base called ConceptNet. Specifically the proposed model employs a Graph Convolutional Neural Network(GCN) module to obtain commonsense knowledge embedding from the retrieved ConceptNet knowledge graph. By conducting a series of experiments with the VCR benchmark dataset, we show that the proposed KG_VCR model outperforms both the state of the art(SOTA) VQA model and the R2C VCR model.