• 정보관리학회지
• /
• 제26권4호
• /
• pp.93-112
• /
• 2009

최근 정보검색 환경은 검색 2.0으로 대표되는 차세대 검색서비스에 대한 논의들이 활발해지고 있다. 따라서 이 연구에서는 정보검색의 발전과 진화에 대한 다양한 논의들을 토대로 정보검색의 발전 과정을 구분하였다. 그리고 현재 거론되고 있는 차세대 검색서비스의 등장 배경, 주요 개념, 그리고 관련 사례와 속성을 파악하였으며, 이러한 속성과 사례에 대한 데이터를 통해 차세대 검색서비스를 설명하는 핵심적인 키워드를 확인하기 위한 군집 분석을 수행하였다. 군집 분석의 결과 차세대 검색서비스를 대표하는 주요 키워드는 소셜 검색, 지능형 의미 검색, 그리고 관계기반 검색 등으로 나타났다.

• 한국컴퓨터정보학회논문지
• /
• 제24권1호
• /
• pp.57-65
• /
• 2019

In this paper, we propose a Rights Management Information(RMI) expression systems for individual sites are integrated and the performance evaluation is performed to find out an efficient comparing and updating method of RMI through various image feature point search techniques. In addition, we proposed a weighted scoring model for both public domain sites and posts in order to use the most latest RMI based on reliable data. To solve problem that most public domain sites are exposed to copyright infringement by providing inconsistent RMI(Rights Management Information) expression system and non-up-to-date RMI information. The weighted scoring model proposed in this paper makes it possible to use the latest RMI for duplicated images that have been verified through the performance evaluation experiments of SIFT and CNN techniques and to improve the accuracy when applied to search engines. In addition, there is an advantage in providing users with accurate original public domain images and their RMI from the search engine even when some modified public domain images are searched by users.

• 한국의류학회지
• /
• 제20권3호
• /
• pp.502-511
• /
• 1996

While much research on brand loyalty have been conducted until now, little has been challenged to integrate the results of previous (studies and how the brand loyalty is developed. The purpose of this study was to) suggest and test the model of clothing brand loyalty formation via consideration of all related variables simultaneously using the LISREL. The subjects were 505 male and female college graduates or higher white collar workers in their twenties and thirties living in Seoul, Korea. The data were collected by self- administered questionnaires. The results showed that consumer knowledge, product involvement, and perceived risk are positively related to information search. However, the influence of perceived risk on information search is statistically insignificant. Product involvement is also positively related to consumer satisfaction. Information search and consumer satisfaction are positively related to brand loyalty, respectively. In conclusion, consumer knowledge, product involvement, and perceived risk have positive influences on brand loyalty through the mediating variables of information search and consumer satisfaction.

• 대한인간공학회지
• /
• 제23권3호
• /
• pp.73-88
• /
• 2004

This study was contrived Hierarchical Information Search (HIS) model. HIS model is based on a “cognitive process” in which model, comprising basic human information processing mechanize and information interaction. Its process include 3 semantic cognitive processes: Schema-Association LTM, Form Domain, and Alternative Selection. Design methodology consists to elicitate memory, thinking and cognitive response variables. In case study, menu structure of mobile phone was applied. In result, a correlation between predictive error rate and real error rate was .892. and a correlation between selective and real reaction time was .697. This present to suggest a model of how the methodology could be applied to real system design effectively when this was used. HIS model could become one of the most important factors for success of product design. In the perspective, the systemic methodology would contribute to design a quantitative and predictive system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권5호
• /
• pp.2718-2731
• /
• 2019

Conjunctive keyword search encryption is an important technique for protecting sensitive data that is outsourced to cloud servers. However, the process of searching outsourced data may facilitate the leakage of sensitive data. Thus, an efficient data search approach with high security is critical. To solve this problem, an efficient conjunctive keyword search scheme based on ciphertext-policy attribute-based encryption is proposed for cloud storage environment. This paper proposes an efficient mechanism for removing the secure channel and resisting off-line keyword-guessing attacks. The storage overhead and the computational complexity are regardless of the number of keywords. This scheme is proved adaptively secure based on the decisional bilinear Diffie-Hellman assumption in the standard model. Finally, the results of theoretical analysis and experimental simulation show that the proposed scheme has advantages in security, storage overhead and efficiency, and it is more suitable for practical applications.

• 한국도서관정보학회지
• /
• 제49권2호
• /
• pp.221-244
• /
• 2018

이 연구의 목적은 우리 이용자의 요구와 행태에 기반 한 FRBR 기반 OPAC 프로토타입을 실험적으로 구현해 보는데 있다. 이러한 목적을 위해 이 연구에서는 시스템 개발방법 중 사용자의 요구사항이 민감하게 반영되어야 할 경우 활용할 수 있는 방법인 프로토타이핑(prototyping) 기법을 적용하여 연구를 수행하였다. 구체적으로, 이 연구에서는 (1) 국외 FRBR형 검색서비스에 대한 이용자 선호도 평가결과를 토대로 하여 프로토타입의 논리적 구조를 설계하고, (2) 설계한 논리적 구조에 따라 FRBR 기반 프로토타입을 물리적으로 개발한 다음, (3) 프로토타입에 대한 이용자 만족도 평가를 실시하였다. 이 때, 만족도 평가는 대학생 50명과 전문가 6명을 대상으로 수행하였다.

• 정보관리학회지
• /
• 제31권2호
• /
• pp.41-56
• /
• 2014

최근 연구데이터가 국가자산이라는 인식의 확산으로 원시데이터 관리 및 재사용의 필요성이 이슈이다. 본 연구에서는 데이터의 체계적인 관리를 위해, 스키마 클래스를 상속하는 방식의 메타데이터 설계 모델과 상속을 통해 생성된 스키마 객체들을 대상으로 메타데이터 통합 검색 모델을 제안하였다. 스키마 클래스를 상속한 스키마 객체가 데이터 컬렉션에 1대1의 관계를 갖도록 데이터 아키텍처를 설계하였으며, 제안된 모델의 검증을 위해서 가상 스키마 클래스 및 객체가 시스템적으로 구현 가능함을 증명하였다. 본 연구에서 제안하는 스키마 클래스 상속 및 통합검색 모델은 일반적으로 사용되는 '하향식 계층 모델'의 단점을 극복하는 모델로서, 정부 기관에서 생산되는 데이터를 독립적으로 관리하는데 활용될 수 있다고 사료된다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.133-141
• /
• 2001

Since the computing environment changes very rapidly, the estimation of software effort is very difficult because it is not easy to collect a sufficient number of relevant cases from the historical data. If we pinpoint the cases, the number of cases becomes too small. However is we adopt too many cases, the relevance declines. So in this paper we attempt to balance the number of cases and relevance. Since many researches on software effort estimation showed that the neural network models perform at least as well as the other approaches, so we selected the neural network model as the basic estimator. We propose a search method that finds the right level of relevant cases for the neural network model. For the selected case set. eliminating the qualitative input factors with the same values can reduce the scale of the neural network model. Since there exists a multitude of combinations of case sets, we need to search for the optimal reduced neural network model and corresponding case, set. To find the quasi-optimal model from the hierarchy of reduced neural network models, we adopted the beam search technique and devised the Case-Set Selection Algorithm. This algorithm can be adopted in the case-adaptive software effort estimation systems.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권2호
• /
• pp.215-221
• /
• 2003

Generally, we want to be searched the newest as well as some appropriate personalized information from the internet resources. However, it is a complex and repeated procedure to search some appropriate information. Moreover, because the user's interests are changed as time goes, the real time modeling of a user's interests should be necessary. In this paper, I propose PREA system that can search and filter documents that users are interested from the World Wide Web. And then it constructs the user's interest model by a modified spreading neural network. Based on this network, PREA can easily produce some queries to search web documents, and it ranks them. The conventional spreading neural network does not have a visualization function, so that the users could not know how to be configured his or her interest model by the network. To solve this problem, PREA gives a visualization function being shown how to be made his interest user model to many users.

• 대한한의학회지
• /
• 제35권1호
• /
• pp.41-49
• /
• 2014

Objectives: We propose a method to model and represent formulas in Korean medicine information systems. Methods: All the formulas were codified in the form of graphs representing the relationship between a formula and its constituents. To identify a unique formula in a graph, the formula's name, the book in which the formula was written, the book where the formula was extracted, and the page number in the extracted book are used. All the formulas and the relationship between formulas are modelled as an ontology based on graphs. Results: A formula search system was constructed using our ontology, which can represent formula information efficiently by grouping and filtering of formulas. Our formula model was also constructed as a mobile application. Conclusions: The information in our formula search system depends on our ontology. However, our model or our search scenarios could be extended according to formula information.