• 정보처리학회논문지B
• /
• 제8B권5호
• /
• pp.533-538
• /
• 2001

본 연구에선는 FAGA(Fuzzy Attribute Relational Graph) 노드의 단일특성을 실제 영상을 응용하여 다중특성으로 확장하고, 노드의 레이블뿐만 아니라, 칼라 질감 그리고 공간관계를 고려한 다중특성 관계 그래프를 이용한 새로운 영상검색을 제안하였다. 1,240 개의 영상으로 구성된 합성영상 데이터베이스와 NETRA 및 Corel Drew 의 1,026개의 영상으로 구성된 자연영상 데이터베이스를 사용하여 실험한 결과, 다중특성을 고려한 접근방법이 단일 특성만 고려하는 방법에 비하여, 합성영상의 경우 Recall에서 6~30% 성능 증가를 보였고, 자연연상의 경우에도 Displacement 척도들과 유사 검색 영상의 수에서 검색 성능이 우수함을 실험을 통하여 확인하였다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권2호
• /
• pp.265-273
• /
• 2000

관계형 데이타베이스 시스템의 각 테이블은 레코드의 집합이며 각 레코드는 일련의 속성들의 집합으로 이루어진다. 속성에 대한 상이값수란 레코드의 속성에 대해 실제로 데이타베이스 내에 사용되고 있는 서로 다른 속성값의 개수를 나타내며 질의 최적화나 통계적 질의의 지원에 유용하게 사용된다. 한편 기존 관계형 데이타베이스 시스템과는 달리 객체-관계 데이타베이스 시스템은 테이블간의 계승 관계를 지원하므로 상위 테이블에서 정의된 속성을 하위 테이블에서 계승받게 된다. 따라서 상이값수 또한 단일 테이블에 관한 정보뿐만 아니라 하위 테이블의 속성 정보를 모두 반영하는 계층 상이값수가 필요하다. 본 논문은 기존 상이값수 측정 방법을 그대로 사용하되 계층 상이값수를 계산하는 방법으로써 속성값 구간 배열을 이용하는 기법을 제안한다. 이 기법은 해당 테이블과 하위 테이블에 대하여 각각 속성값 구간 배열을 구성하고 그것을 합병함으로써 계층 상이값수를 계산한다. 제안하는 기법은 작은 양의 저장 공간만을 사용하여 계층 상이값수를 정확히 구할 수 있게 하며 계층 내의 각 테이블에 대한 갱신 연산이 불균등하게 이루어지는 환경에서 더욱 효과적으로 이용될 수 있다.

• 디지털산업정보학회논문지
• /
• 제17권1호
• /
• pp.75-84
• /
• 2021

For analyzing big data, the social network is increasingly being utilized through relational data, which means the connection characteristics between entities such as people and objects. When the relational data does not exist directly, a social network can be configured by calculating relational data such as attribute similarity from attribute data of entities and using it as links. In this paper, the composition method of the social network using the attribute similarity between entities as a connection relationship, and the clustering method using subgroups for the configured social network are suggested, and the clustering effectiveness of the clustering results is evaluated. The analysis results can vary depending on the type and characteristics of the data to be analyzed, the type of attribute similarity selected, and the criterion value. In addition, the clustering effectiveness may not be consistent depending on the its evaluation method. Therefore, selections and experiments are necessary for better analysis results. Since the analysis results may be different depending on the type and characteristics of the analysis target, options for clustering, etc., there is a limitation. In addition, for performance evaluation of clustering, a study is needed to compare the method of this paper with the conventional method such as k-means.

• 대한원격탐사학회지
• /
• 제3권2호
• /
• pp.115-119
• /
• 1987

After the introduction of the topologically structured geographic information system(GIS) with relational DBMS, the attribute data can be handled without considering locational data. By utilzing of the characteristic of the relational DBMS, it can be used as an expert system building tool in GIS. The relational DBMS of the GIS furnishes the data needed to perform deductive functions of the expert system, and the rule based approach provides the decision rules. Therefore, rule based approach with the expert judgement can be easily combined with relational DBMS.

• 산업경영시스템학회지
• /
• 제21권46호
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.337-339
• /
• 1996

In this paper, we construct rough relational database model using approximation concepts of rough set. Also, we analyze the relation between objects, attributes and attribute values and, propose the method that can generate flexible retrieval results.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제37권5호
• /
• pp.363-369
• /
• 2010

데모-기반 학습은 사용자가 직접 작업을 시연함으로써 로봇에게 쉽게 새로운 작업지식을 가르칠 수 있다는 장점이 있다. 하지만 기존의 많은 데모-기반 학습법들은 상태공간과 정책들을 표현하기 위해 속성-값 벡터 모델을 이용하였다. 속성-값 벡터 모델의 제한성으로 인해, 이들은 학습과정의 효율성도 낮고 학습된 정책의 재사용성도 낮았다. 본 논문에서는 기존의 속성-값 모델 대신 관계적 모델을 이용하는 새로운 데모-기반 작업 학습법을 제안한다. 이 방법에서는 사용자 데모 기록에서 추출한 훈련 예들에 관계적 개체-기반 학습법을 적용함으로써, 동일 작업영역내의 다른 유사한 작업들에도 활용하기 용이한 관계적 개체-기반 정책을 유도한다. 이 관계적 정책은 (상태, 목표) 쌍으로 표현되는 임의의 한 상황에 대해 이것에 대응하는 하나의 실행동작을 결정해주는 역할을 한다. 본 논문에서는 데모-기반 관계적 정책 학습법에 대해 자세히 소개한 후, 로봇 시뮬레이터를 이용한 실험을 통해 이 학습법의 효과를 분석해본다.

• 수산해양교육연구
• /
• 제29권1호
• /
• pp.242-256
• /
• 2017

The purpose of this study was to describe and understand the characteristics of morphological, contextual as relational aggression among 4-year old children during free play periods. The ethnographic methods included participants observation of children's play interaction behaviors, field notes, video taping and analysis of transcribed date. The results are as exclusion occurred by group power taking the relational attribute, including direct language, while the other would not be revealed easily other than being in line with real relation. Also as follows; proactive relational aggression was more frequently observed in girls, and their major strategies employed against someone they disliked were ignoring them, distorting play-rules, and so on. Major strategies of reactive relational aggression in girls were largely manipulative in nature, for example, 'threatrning their friend' and 'withdrawal of friendship'.

• Journal of Computing Science and Engineering
• /
• 제5권3호
• /
• pp.183-196
• /
• 2011

There has recently been a surge of interest in relational database mining that aims to discover useful patterns across multiple interlinked database relations. It is crucial for a learning algorithm to explore the multiple inter-connected relations so that important attributes are not excluded when mining such relational repositories. However, from a data privacy perspective, it becomes difficult to identify all possible relationships between attributes from the different relations, considering a complex database schema. That is, seemingly harmless attributes may be linked to confidential information, leading to data leaks when building a model. Thus, we are at risk of disclosing unwanted knowledge when publishing the results of a data mining exercise. For instance, consider a financial database classification task to determine whether a loan is considered high risk. Suppose that we are aware that the database contains another confidential attribute, such as income level, that should not be divulged. One may thus choose to eliminate, or distort, the income level from the database to prevent potential privacy leakage. However, even after distortion, a learning model against the modified database may accurately determine the income level values. It follows that the database is still unsafe and may be compromised. This paper demonstrates this potential for privacy leakage in multi-relational classification and illustrates how such potential leaks may be detected. We propose a method to generate a ranked list of subschemas that maintains the predictive performance on the class attribute, while limiting the disclosure risk, and predictive accuracy, of confidential attributes. We illustrate and demonstrate the effectiveness of our method against a financial database and an insurance database.

• Journal of information and communication convergence engineering
• /
• 제20권4호
• /
• pp.265-272
• /
• 2022

The most effective method to improve information system capabilities is to enable instant access to several relational database sources and transform data with a logical structure into multiple target relational databases. There are numerous data transformation tools available; however, they typically contain fixed procedures that cannot be changed by the user, making it impossible to fulfill the near-real-time data transformation requirements. Furthermore, some tools cannot build object references or alter attribute constraints. There are various situations in which tool changes in data type cause conflicts and difficulties with data quality while transforming between the two systems. The R-programming language was extensively used throughout this study, and several different relational database structures were utilized to complete the proposed study. Experiments showed that the developed study can improve the performance of information systems by interacting with and exchanging data with various relational databases. The study addresses data quality issues, particularly the completeness and integrity dimensions of the data transformation processes.