• Title/Summary/Keyword: Information Search Model

Search Result 1,294, Processing Time 0.029 seconds

A Study on the Development of the Information Literacy Curriculum Model for Undergraduates Based on Kuhlthau's Information Search Process(ISP) Model (Kuhlthau의 ISP모델에 기반한 대학의 정보활용능력 교육과정 모델 개발 연구)

  • Kim, Ji-Eun
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.22 no.2
    • /
    • pp.101-122
    • /
    • 2011
  • Information literacy(IL) is the essential skill in the knowledge information society in the 21st century. Spreading the awareness of importance of IL across the world, the efforts to develop and implement IL standards or instructions are expanded around United States, United Kingdom, and Australia. In this study, Author extracts the core elements of IL from domestic and foreign IL standards and integrates those with Kuhlthau's Information Search Process(ISP) Model in order to develop the curriculum model of IL for undergraduates. The curriculum model has been constructed by consideration of capability of application to practice and expressed as the syllabus for the structure of university education. In the curriculum model, major instructional contents are extracted from 6 core elements of IL and the contents are organized by 6 ISP stages. Author suggests some successive studies based on the curriculum model for expansion and advancement of IL instruction.

Extended Query Search Performance Evaluations for Vector Model and Probabilistic Model of Information System (정보검색시스템의 확률 및 벡터모델에 대한 질의 확장 검색 성능 평가)

  • 전유정;변동률;박순철
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.9 no.1
    • /
    • pp.36-42
    • /
    • 2004
  • In this paper, we compare the vector model performance with the probabilistic model of information system. We use LSI(Latent Semantic Indexing) model for vector model, while Condor information search system that is ready to sell on business is used as a probabilistic model. Each model produces the search results from the original queries and the queries extended by a dictionary definition. We compare those results between two models and find out the vector model is much better than the probabilistic model for the most queries.

  • PDF

Fashion Brand Sales Forecasting Analysis Using ARDL Time Series Model -Focusing on Brand and Advertising Endorser's Web Search Volume, Information Amount, and Brand Promotion- (ARDL 시계열 모형을 활용한 패션 브랜드의 매출 예측 분석 -패션 브랜드와 광고모델의 웹 검색량, 정보량, 가격할인 프로모션을 중심으로-)

  • Seo, Jooyeon;Kim, Hyojung;Park, Minjung
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.46 no.5
    • /
    • pp.868-889
    • /
    • 2022
  • Fashion companies are using a big data approach as a key strategic analysis to predict and forecast sales. This study investigated the effectiveness of the past sales, web search volume, information amount, brand promotion, and the advertising endorser on the sales forecasting model. The study conducted the autoregressive distributed lag (ARDL) time series model using the internal and external social big data of a national fashion brand. Results indicated that the brand's past sales, search volume, promotion, and amount of advertising endorser information amount significantly affected the sales forecast, whereas the brand's advertising endorser search volume and information amount did not significantly influence the sales forecast. Moreover, the brand's promotion had the highest correlation with sales forecasting. This study adds to information-searching behavior theory by measuring consumers' brand involvement. Last, this study provides digital marketers with implications for developing profitable marketing strategies on the basis of consumers' interest in the brand and advertising endorser.

Sound Model Generation using Most Frequent Model Search for Recognizing Animal Vocalization (최대 빈도모델 탐색을 이용한 동물소리 인식용 소리모델생성)

  • Ko, Youjung;Kim, Yoonjoong
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.10 no.1
    • /
    • pp.85-94
    • /
    • 2017
  • In this paper, I proposed a sound model generation and a most frequent model search algorithm for recognizing animal vocalization. The sound model generation algorithm generates a optimal set of models through repeating processes such as the training process, the Viterbi Search process, and the most frequent model search process while adjusting HMM(Hidden Markov Model) structure to improve global recognition rate. The most frequent model search algorithm searches the list of models produced by Viterbi Search Algorithm for the most frequent model and makes it be the final decision of recognition process. It is implemented using MFCC(Mel Frequency Cepstral Coefficient) for the sound feature, HMM for the model, and C# programming language. To evaluate the algorithm, a set of animal sounds for 27 species were prepared and the experiment showed that the sound model generation algorithm generates 27 HMM models with 97.29 percent of recognition rate.

Online Shopping Motivations, Information Search, and Shopping Intentions in an Emerging Economy

  • Singh, Devinder Pal
    • Asian Journal of Business Environment
    • /
    • v.4 no.3
    • /
    • pp.5-12
    • /
    • 2014
  • Purpose - This study is aimed at examining Indian consumers' online shopping motivations, information search, and shopping intentions. The study intends to reveal the relationship between online shopping motivations, information search, and shopping intentions. Research design, data, and methodology - The study employs factor analysis to verify correct loading of items on corresponding factors, and to confirm the applicability of constructs in the Indian context. The model was verified using stepwise regression analysis. Results -The findings show that hedonic and utilitarian motivations significantly affect online information search and shopping intentions. The information search is a significant predictor of online purchase intention. Conclusions - Hedonic and utilitarian motivations are the salient factors affecting online information search and purchase intentions. Marketers are required to design websites that foster an enjoyable online experience. This will attract customers who will browse the website for a longer duration. More time devoted to information search will ensure brand building and loyalty.

A Model on How Children Access and Search E-books (어린이 정보추구모형에 관한 연구 - 전자책 접근 및 탐색을 중심으로 -)

  • Chung, Eun-Kyung;Choi, Yoon-Kyung
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.46 no.1
    • /
    • pp.99-117
    • /
    • 2012
  • Due to the recent technological improvements, the environments of e-books and its contents have been changed and the users of e-books have drastically increased. This study aimed to propose a model on how children access and search e-books in this digital era. For this study, a potential model was proposed based on the analyses on various information-seeking behavior models. For analyzing children's access and search processes on e-books, 30 children in five public libraries or school media centers in Seoul and Kyoungi-do areas were recruited for the in-depth interviews. As a potential model on children's access and search on e-books was re-visited and revised based on the results, a cyclic model of children's access and search on e-books was proposed containing six factors.

Buyer Category-Based Intelligent e-Commerce Meta-Search Engine (구매자 카테고리 기반 지능형 e-Commerce 메타 서치 엔진)

  • Kim, Kyung-Pil;Woo, Sang-Hoon;Kim, Chang-Ouk
    • IE interfaces
    • /
    • v.19 no.3
    • /
    • pp.225-235
    • /
    • 2006
  • In this paper, we propose an intelligent e-commerce meta-search engine which integrates distributed e-commerce sites and provides a unified search to the sites. The meta-search engine performs the following functions: (1) the user is able to create a category-based user query, (2) by using the WordNet, the query is semantically refined for increasing search accuracy, and (3) the meta-search engine recommends an e-commerce site which has the closest product information to the user’s search intention by matching the user query with the product catalogs in the e-commerce sites linked to the meta-search engine. An experiment shows that the performance of our model is better than that of general keyword-based search.

Graph Convolutional - Network Architecture Search : Network architecture search Using Graph Convolution Neural Networks (그래프 합성곱-신경망 구조 탐색 : 그래프 합성곱 신경망을 이용한 신경망 구조 탐색)

  • Su-Youn Choi;Jong-Youel Park
    • The Journal of the Convergence on Culture Technology
    • /
    • v.9 no.1
    • /
    • pp.649-654
    • /
    • 2023
  • This paper proposes the design of a neural network structure search model using graph convolutional neural networks. Deep learning has a problem of not being able to verify whether the designed model has a structure with optimized performance due to the nature of learning as a black box. The neural network structure search model is composed of a recurrent neural network that creates a model and a convolutional neural network that is the generated network. Conventional neural network structure search models use recurrent neural networks, but in this paper, we propose GC-NAS, which uses graph convolutional neural networks instead of recurrent neural networks to create convolutional neural network models. The proposed GC-NAS uses the Layer Extraction Block to explore depth, and the Hyper Parameter Prediction Block to explore spatial and temporal information (hyper parameters) based on depth information in parallel. Therefore, since the depth information is reflected, the search area is wider, and the purpose of the search area of the model is clear by conducting a parallel search with depth information, so it is judged to be superior in theoretical structure compared to GC-NAS. GC-NAS is expected to solve the problem of the high-dimensional time axis and the range of spatial search of recurrent neural networks in the existing neural network structure search model through the graph convolutional neural network block and graph generation algorithm. In addition, we hope that the GC-NAS proposed in this paper will serve as an opportunity for active research on the application of graph convolutional neural networks to neural network structure search.

A Study on the Classification Scheme of the Internet Search Engine (인터넷 탐색엔진에 관한 연구)

  • 김영보
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.8 no.1
    • /
    • pp.197-227
    • /
    • 1997
  • The main purpose of this study is ① to settle and to analyze the classification of the Internet Search Engine comparitively, and ② to build the compatible model of Internet Search Engine classification in order to seek information on the Internet resources. specially in the branch of the Computers and Internet areas. For this study, four Internet Search Engine (Excite, 1-Detect, Simmany, Yahoo Korea!), Inspec Classification and two distionaries were used. The major findings and result of analysis are summarized as follows : 1. The basis of the classification is the scope of topics, the system logic, the clearness, the efficiency. 2. The scope of topics is analyzed comparitively by the number of items from each Search Engine. In the result, Excite is the most superior of the four 3. The system logic is analyzed comparitively by the casuality balance and consistency of the items from each Search Engine. In the result, Excite is the most superior of the four 4. The clearness is analyzed comparitively by the clearness and accuracy of items, the recognition of the searchers. In the result, Excite is the most superior of the four. 5 The efficiency is analyzed comparitively by the exactness of indexing and decreasing the effort of the searchers. In the result, Yahoo Korea! is the most superior of the four. 6 The compatible model of Internet Search Engine classification is estavlished to uplift the scope of topics, the system logic, the clearness, and the efficiency. The model divides the area mainly based upon the topics and resources using‘bookmark’and‘shadow’concept.

  • PDF

Discovery Layer in Library Retrieval: VuFind as an Open Source Service for Academic Libraries in Developing Countries

  • Roy, Bijan Kumar;Mukhopadhyay, Parthasarathi;Biswas, Anirban
    • Journal of Information Science Theory and Practice
    • /
    • v.10 no.4
    • /
    • pp.3-22
    • /
    • 2022
  • This paper provides an overview of the emergence of resource discovery systems and services, along with their advantages, best practices, and current landscapes. It outlines some of the key services and functionalities of a comprehensive discovery model suitable for academic libraries in developing countries. The proposed model (VuFind as a discovery tool) performs like other existing web-scale resource discovery systems, both commercial and open-source, and is capable of providing information resources from different sources in a single-window search interface. The objective of the paper is to provide seamless access to globally distributed subscribed as well as open access resources through its discovery interface, based on a unified index. This model uses Koha, DSpace, and Greenstone as back-ends and VuFind as a discovery layer in the front-end and has also integrated many enhanced search features like Bento-box search, Geodetic search, and full-text search (using Apache Tika). The goal of this paper is to provide the academic community with a one-stop shop for better utilising and integrating heterogeneous bibliographic data sources with VuFind (https://vufind.org/vufind).