• 인터넷정보학회논문지
• /
• 제6권6호
• /
• pp.163-178
• /
• 2005

개인정보관리 시스템의 궁극적인 목표는 개인이 필요로 하는 정보를 수집하고 처리하여 보다 간편하고 효율적인 방법으로 정보를 검색할 수 있도록 조직화하여 관리하는데 있다. 그러나 기존의 개인정보관리 시스템은 자료 저장을 위해 전통적인 계층적 디렉터리 모델을 사용하고 있기 때문에 효율적인 정보관리 및 검색에 한계가 있으며 정보의 연관 관계에 의한 검색이 어렵다는 문제점을 가진다. 이러한 문제점들을 개선하기 위해 본 논문에서는 개인이 필요로 하는 문서를 웹상에서 쉽게 관리하고 유지할 수 있는 더불어 관리된 문서를 쉽게 검색할 수 있는 개인정보관리 메커니즘을 기계학습의 한 기법이 Fornal Concept Analysis의 개념망 모델을 이용하여 제안한다. 실험 결과는 제안된 방법이 계층적인 트리 구조의 단점을 극복하고 제한된 검색을 넘어 개념들 사이의 연관 관계에 의한 검색을 지원할 뿐만 아니라 검색 성능에 있어 계층적인 구조를 기반으로 하는 시스템보다 더 유용한 방법임을 보였다.

• Journal of Information Technology Applications and Management
• /
• 제11권2호
• /
• pp.227-237
• /
• 2004

While the WWW offers an incredibly rich base of information, organized as a hypertext, it does not provide a uniform and efficient way to retrieve specific information. When one tries to find information entering several query terms into a search engine, the highly-ranked pages in the result usually contain many irrelevant or useless pages. The problem is that single-term queries do not contain sufficient information to specify exactly which web pages are needed by the user. The purpose of this paper is to describe the employment of association rules in data mining for developing networks and computing associative coefficient among the terms. And this paper shows how the dynamic query expansion and/or reduction can be performed in information retrieval.

• 한국통신학회논문지
• /
• 제23권9A호
• /
• pp.2211-2220
• /
• 1998

This paper presetns an adaptive critic self-learning control system with cerebellar model articulation controller (CMAC)-based decoder integrated with the associative search element (ASE) and adatpive critic element(ACE)- based scheme. The tast of the system is to balance a pole that is hinged to a movable cart by applying forces to the cart's base. The problem is that error feedback information is limited. This problem can be sloved when some adaptive control devices are involved. The ASE incorporates prediction information for reinforrcement from a critic to produce evaluative information for the plant. The CMAC-based decoder interprets one state to a set of patways into the ASE/ACE. These signals correspond to te current state and its possible preceding action states. The CMAC's information interpolation improves the learning speed. And design inverted pendulum hardware system to show control capability with neural network.

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

In this paper, we present a new design method to implement autoassociative memories based on BSB neural networks. With a concrete mathematical model proposed after analyzing some new qualitative properties of autoassociative memories, we reinterpret design of autoassociative memories as a constrained optimization problem and use an evolution program as an optimal search tool to solve this. The proposed method satisfies many of the criteria used to evaluate the effectivencess of a given associative memory and has improvements with respect to correctness and performance. Comparing simulation results with other methods, we demonstrate the effectiveness of the proposed method.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 춘계학술대회 학술발표 논문집
• /
• pp.120-123
• /
• 1997

In this paper, we propose the Fuzzy Inference-based Reinforcement Learning Algorithm. We offer more similar learning scheme to the psychological learning of the higher animal's including human, by using Fuzzy Inference in Reinforcement Learning. The proposed method follows the way linguistic and conceptional expression have an effect on human's behavior by reasoning reinforcement based on fuzzy rule. The intervals of fuzzy membership functions are found optimally by genetic algorithms. And using Recurrent state is considered to make an action in dynamical environment. We show the validity of the proposed learning algorithm by applying to the inverted pendulum control problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.1996-2011
• /
• 2021

To understand a trend is to explore the intricate process of how something or a particular situation is constantly changing or developing in a certain direction. This exploration is about observing and describing an unknown field of knowledge, not testing theories or models with a preconceived hypothesis. The purpose is to gain knowledge we did not expect and to recognize the associations among the elements that were suspected or not. This generally requires examining a massive amount of data to find information that could be transformed into meaningful knowledge. That is, looking through the lens of big-data analytics with an inductive reasoning approach will help expand our understanding of the complex nature of a trend. The current study explored the trend of well-being in South Korea using big-data analytic techniques to discover hidden search patterns, associative rules, and keyword signals. Thereafter, a theory was developed based on inductive reasoning - namely the hook, upward push, and downward pull to elucidate a holistic picture of how big-data implications alongside social phenomena may have influenced the well-being trend.

• 한국도서관정보학회지
• /
• 제10권
• /
• pp.95-131
• /
• 1983

Index is a systematic guide to items contained in, or concepts derived from, a collection, Thus, it is represented as a paired set of index terms (t) and documents (D) : I= {(t,D) vertical bar t .mem. V, D .mem. W), where V is index vocabulary and W is document collection. Indexing is the process of analysing the informational content of records of knowledge and expressing the informational content in the language of the indexing system. It involves: 1) Selecting indexable concepts in a document; and 2) expressing these concepts in the language of the indexing system (as index entries): and an ordered list. Indexing process involves technical, semantic and syntactic problems. Technical problems are related to the accuracy of indexing, which is primarily governed by the indexer's ability of analysing subject, identifying indexable concepts, and coding. The proper levels of indexing exhaustivity, and index language specificity are also significant factors affecting the quality of index. Semantic problems are related to the choice of index terms and the form in which they should be used. Equivalent, hierarchical and affinitive/associative relationships of index terms are involved. Syntactic problems are largely related to the coordination of index terms. This process of coordination arises from the need to be able to search for the intersection of two or more classes defined by terms denoting distinct concepts. Finally, most valuable aspects of alphabetical subject indexing theories and practices are derived from those of Cutter, Kaiser, Ranganathan, Coates, Lynch and Austin, and discussed in details.

• 정보관리학회지
• /
• 제21권4호
• /
• pp.27-47
• /
• 2004

본 연구에서는 다국어 시소러스에 수록된 디스크립터간의 관계를 온톨로지 언어로 표현하는 실험을 수행하였다. 대등관계는 equivalentClass와 equivalentProperty, sameAS 등으로, 그리고 연관관계는 ObjectProperty을 비롯하여 DatatypeProperty, inverseOf 등으로 표현할 수 있었다. 이러한 언어를 기반으로 실제 AAT에 배정된 디스크립터와 ICCD에서 구축한 다국어 시소러스의 디스크립터를 대상으로 디스크립터의 한글화 작업이 수행되었으며, 다국어간 개념일치를 위해 패싯개념이 시소러스 구조에 이용되었다. 본 연구를 통한 실험의 결과 다국어 시소러스를 온톨로지로 표현하기 위해서는 속성관련 온톨로지 언어를 사용하는 것이 가장 효과적임을 확인할 수 있었다.

• 디지털콘텐츠학회 논문지
• /
• 제15권5호
• /
• pp.569-577
• /
• 2014

사용자는 시간적, 공간적 상황에 따라 다양한 정보를 요구한다. 상황변화에 맞는 서비스 정보를 제공하는 것이 중요하다. 그러므로 사용자의 행동 및 서비스 이력의 최신정보를 기반으로 마이닝하여 최적의 서비스를 사용자에게 제공해야 한다. 본 논문에서는 시공간 정보 및 서비스 정보 온톨로지를 기반으로 사용자의 서비스 사용 이력을 이용하여 연관 있는 서비스 규칙을 탐색하기 위한 마이닝 방법을 제안한다. 이를 위해 서비스 온톨로지 계층에 대한 레벨 교차 기반의 연관 서비스 규칙을 발견한다. 제안된 마이닝 방법은 일정한 시간과 공간에 대한 시기별, 위치별, 연령별에 대한 연관 서비스 패턴을 발견할 수 있으므로 사용자의 상황변화에 양질의 서비스를 제공할 수 있는 기반이 된다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제8권1호
• /
• pp.27-44
• /
• 1999

Case-Based Reasoning(CBR) offers a new approach for developing knowledge based systems. CBR has several research issues which can be divided into two categories : (1) static issues and (2) dynamic issues. The static issues are related to case representation scheme and case data model, that is, focus on casebase which is a repository of cases. The dynamic issues, on the other hand, are related to case retrieval procedure and problem solving process, i.e. case adaptation phase. This research is forcused on retrieval procedure Traditional query processing accepts precisely specified queries and only provides exact answers, thus requiring users to fully understand the problem domain and the casebase schema, but returning limited or even null information if the exact answer is not available. To remedy such a restriction, extending the classical notion of query answering to approximate query answering(AQA) has been explored. AQA can be achieved by neighborhood query answering or associative query answering. In this paper, neighborhood query answering technique is used for AQA. To reinforce the CBR process, a new retrieval procedure(cooperative CBR) using neighborhood query answering is proposed. An neighborhood query answering relaxes a query scope to enlarge the search range, or relaxes an answer scope to include additional information. Computer Aided Process Planning(CAPP) is selected as cooperative CBR application domain for test. CAPP is an essential key for achieving CIM. It is the bridge between CAD and CAM and translates the design information into manufacturing instructions. As a result of the test, it is approved that the problem solving ability of cooperative CBR is improved by relaxation technique.