• 제목/요약/키워드: T-search

검색결과 949건 처리시간 0.029초

중복글자 구분을 지원하는 집합 기반 POI 검색 알고리즘 구현 (Implementation of A Set-based POI Search Algorithm Supporting Classifying Duplicate Characters)

  • 고은별;이종우
    • 디지털콘텐츠학회 논문지
    • /
    • 제14권4호
    • /
    • pp.463-469
    • /
    • 2013
  • 집합 기반 POI 검색 기법은 부정확한 질의어 입력 시 검색결과의 재현율과 정확도가 현저히 떨어지는 기존 하드매칭 기법에 비해 우수한 성능을 보인다. 하지만 집합 개념을 바탕으로 했기 때문에 한 POI 레코드 내에 중복으로 포함된 동일 글자들을 구분하지 못하는 문제점이 있다. 본 논문에서는 이러한 문제를 해결하여 한 POI 내에 동일 글자가 여러 개 등장해도 동작하는 개선된 집합 기반 POI 검색 기법을 제시하고 구현하였다. 또한 개선된 집합 기반 POI 검색 기법의 검색결과와 기존 집합 기반 POI 검색 기법의 검색결과를 비교하는 실험을 통해 레코드 내에 중복으로 포함된 동일 글자가 있는 레코드에 대한 검색 성능이 향상되었음을 확인하였다.

연관 규칙 탐사 기법을 이용한 해양 전문 검색 엔진에서의 질의어 처리에 관한 연구 (Research on User's Query Processing in Search Engine for Ocean using the Association Rules)

  • 하창승;윤병수;류길수
    • 한국컴퓨터정보학회논문지
    • /
    • 제8권2호
    • /
    • pp.8-15
    • /
    • 2003
  • 최근 여러 가지 정보들이 WWW를 경유하여 제공되고 있기 때문에 검색엔진의 필요성은 점점 커지고 있다. 그러나 대부분의 검색엔진은 정보의 추출을 위해 웹 문서와 사용자 질의를 단순 패턴비교 방법을 사용함으로써 검색엔진의 효율은 비교적 낮은 편이다. 일반적으로 사용자의 검색 목적에 따라 다른 검색 엔진이 사용되기 때문에 여러 전문검색엔진을 개발하고 있지만 대부분의 검색엔진들이 사용자의 요구를 제대로 반영하고 있지 못하다. 본 연구에서는 웹 데이터마이닝의 연관규칙을 이용하여 사용자 질의를 처리하는 해양전문검색엔진을 제안한다. 데이터 마이닝 분야에서 주로 연구되어온 연관규칙탐사 기법은 지지도와 신뢰도에 따라 연관자료의 확신도를 측정할 수 있기 때문에 웹 문서 사이의 관련성을 입증하는데 이 규칙을 적용하여 기존의 검색 방법에서 자료의 재현률과 정확률을 개선하였다.

  • PDF

다양한 형태의 웹 탐색도구의 이용자집단간 비교효용성 및 평가에 관한 연구 (The comparative effectiveness and evaluation study of user groups of the various web search tools)

  • 박일종;윤명순
    • 한국도서관정보학회지
    • /
    • 제31권1호
    • /
    • pp.87-114
    • /
    • 2000
  • The purpose of this study is offering appropriate system and training program to helf the system designer and the trainer in addition to analyze information use behavior about the web search tools and evaluate the estimated system by user groups. The results of the study are as follows $\circledS1$ It is desirable to consider age than other demographic variables in the case of web search tool. $\circledS2$ It is desirable to design Directory Search Tool in the case of web search tool which serves the student user group. $\circledS3$ An Intelligent Search Tool is more appropriate for the students who are using keyword search tool than any other tools. $\circledS4$ A discussion about standard classification of the web information should be accomplished soon because users feel confused in using web search tools due t o absence of standard mode of classification about classified item. $\circledS5$ Librarians need the cognition about data on internet s a source of information and need positive service and user training program about these information because student users hardly get help from librarians or library orientation for learning method to use web search tool. $\circledS6$ Internet use experience and years of computer use had effect on their use ability when using web search tool, whereas computer use experience, library use experience and Online Public Access Catalogs (OPAC) use experience had no effect on it. Especially, OPAC use experience had no effect on use ability of web search tool of student user group because student user groups had no information about internet and web search tool and they did not recognized the difference about search method between web search tool and OPAC. $\circledS7$In the case of web search tool, it si important to index the increasing web resource automatically by a searching robot. But in the case of student users, web search tool is much more needed to index by index expert due to the absence of ability about selecting and combining keyword.

  • PDF

진로교육이 간호 대학생의 진로발달에 미치는 효과 (The Effects of Career Education on Career Development for Nursing Students)

  • 박순주
    • 한국간호교육학회지
    • /
    • 제18권2호
    • /
    • pp.259-267
    • /
    • 2012
  • Purpose: The purposes of this study were to build the career education course for nursing students' career development and to identify the effects of the education. Method: The study used a one-group pre- and post-test design and the surveys were carried out from April to June, 2011. The participants were 71 undergraduate seniors of department of nursing in E university. The data were obtained via questionnaires survey before and after taking the course. The collected data were analyzed by paired t-test using SPSS 19. Results: 88.7% of the subjects responded being satisfied with their major. The scores of career search efficacy (t=-2.57, p=.012), career exploration (t=-4.62, p<.001), and career adaptability (t=-3.51, p=.001) showed statistically significant improvement after the education. Networking (t=-2.66, p=.010) and personal exploration efficacy (t=-2.89, p=.005) showed statistically significant difference between pre- and post-test. Between two subgroup of career exploration, only the environment exploration (t=-5.92, p<.001) significantly improved. However, there was no significant difference in career identity. Conclusion: From this study, career education showed significant effects on the career search efficacy, career exploration, and career adaptability of nursing students. These findings suggest that career education as a subject would be an efficient way for career development of nursing students.

A Multi-Indexes Based Technique for Resolving Collision in a Hash Table

  • Yusuf, Ahmed Dalhatu;Abdullahi, Saleh;Boukar, Moussa Mahamat;Yusuf, Salisu Ibrahim
    • International Journal of Computer Science & Network Security
    • /
    • 제21권9호
    • /
    • pp.339-345
    • /
    • 2021
  • The rapid development of various applications in networking system, business, medical, education, and other domains that use basic data access operations such as insert, edit, delete and search makes data structure venerable and crucial in providing an efficient method for day to day operations of those numerous applications. One of the major problems of those applications is achieving constant time to search a key from a collection. A number of different methods which attempt to achieve that have been discovered by researchers over the years with different performance behaviors. This work evaluated these methods, and found out that almost all the existing methods have non-constant time for adding and searching a key. In this work, we designed a multi-indexes hashing algorithm that handles a collision in a hash table T efficiently and achieved constant time O(1) for searching and adding a key. Our method employed two-level of hashing which uses pattern extraction h1(key) and h2(key). The second hash function h2(key) is use for handling collision in T. Here, we eliminated the wasted slots in the search space T which is another problem associated with the existing methods.

환경인식 기반의 향상된 Minimum Statistics 잡음전력 추정기법 (Improved Minimum Statistics Based on Environment-Awareness for Noise Power Estimation)

  • 손영호;최재훈;장준혁
    • 한국음향학회지
    • /
    • 제30권3호
    • /
    • pp.123-128
    • /
    • 2011
  • 본 논문에서는 다양한 잡음 환경에서 음성향상을 위한 Minimum Statistics (MS) 잡음전력 추정 기법을 제시한다. 기존의 방법에서는 최소값 추적을 위해서 유한한 서치 (search)윈도우를 사용하여 최적으로 신호의 파워 스펙트럼을 수무딩하고 최소 확률을 적용하는 것을 기본으로 한다. 본 논문에서 제안된 알고리즘은 기존의 최소값 서치 윈도우가 다양한 잡음 환경에 상관없이 고정된 사이즈를 사용하는 것에 환경인식 정보를 적용하여 서치 윈도우 사이즈가 Gaussian mixture model(GMM)기반의 잡음 분류 알고리즘을 이용한 결과 값의 비교로 잡음 환경에 따라 변화 하도록 한다. 제안된 음성 향상 기법은 ITU-T P.862 perceptual evaluation of speech quality (PESQ)를 이용하여 평가하였고 기존의 MS방법보다 향상된 결과를 보였다.

시간 압박이 시각 탐색 전략에 미치는 영향 모델링 (Modeling Time Pressure Effect on Visual Search Strategy)

  • 최윤형;명노해
    • 대한산업공학회지
    • /
    • 제42권6호
    • /
    • pp.377-385
    • /
    • 2016
  • The previous Adaptive Control of Thought-Rational (ACT-R) cognitive architecture model has a limitation in that it cannot accurately predict human visual search strategy, because time effect, one of important human cognitive features, is not considered. Thus, the present study proposes ACT-R cognitive modeling that contains the impact of time using a revised utility system in the ACT-R model. Then, the validation of the model is performed by comparing results of the model with eye-tracking experimental data and SEEV-T (SEEV-Time; SEEV model which considers time effect) model in "Where's Wally" game. The results demonstrate that the model data fit fairly well with the eye-tracking data ($R^2=0.91$) and SEEV-T model ($R^2=0.93$). Therefore, the modeling method which considers time effect using a revised utility system should be used in predicting the human visual search paradigm when the available time is limited.

의류제품 소비자의 생활주기에 따른 주관적 지식이 정보탐색에 미치는 영향 (The Effects of Subjective Knowledge on Information Search as Related to a Consumer's Life Cycle)

  • 황정인;박재옥
    • 대한가정학회지
    • /
    • 제48권9호
    • /
    • pp.41-54
    • /
    • 2010
  • This study attempted to determine how the subjective knowledge related to a consumer's life cycle influences their information search in the decision making process. The data was collected using a total of 349 questionnaires for the final analysis of this study. SPSS 12.0 for windows was used for the data analysis and the detailed analyses included descriptive analysis, factor analysis, reliability tests, one way ANOVA, multiple regression analysis and t-tests. The results of this study showed that there are differences in the subdivisions of subjective knowledge of apparel according to the consumer's life cycle and there is a difference in the types of information searches according to the consumer's subjective knowledge, and the subdivisions of subjective knowledge of the consumers influence their information search. This study showed that although it affected the internal search, the media search, and the store search, it did not influence the personal search in the decision making process.

모바일 환경에서 파일 검색 엔진을 위한 효과적인 방식 (Effective Scheme for File Search Engine in Mobile Environments)

  • 조종근;하상은
    • 한국콘텐츠학회논문지
    • /
    • 제8권11호
    • /
    • pp.41-48
    • /
    • 2008
  • 본 논문에서는 파일 검색 엔진에 대해 모델링하고, 파일 검색의 정확도와 속도 향상을 위해 파일내의 내용들을 이용한 가중치 값 기반의 파일 검색 방식을 제안한다. 대부분의 파일 검색 엔진들은 빠른 검색 속도의 한계로 KMP와 같은 스트링 매칭 알고리즘을 사용해 왔다. 그러나, 이런 종류의 알고리즘들은 사용자가 원하는 파일들을 정확하게 찾아 주지는 못한다. 따라서, 모바일 환경에서 파일내의 내용들을 이용한 가중치 값 기반의 검색 엔진을 제안하고, 기존 방법들과 비교를 통해 제안한 방법의 우수한 성능을 증명한다.

Optimized Multi Agent Personalized Search Engine

  • DishaVerma;Barjesh Kochar;Y. S. Shishodia
    • International Journal of Computer Science & Network Security
    • /
    • 제24권9호
    • /
    • pp.150-156
    • /
    • 2024
  • With the advent of personalized search engines, a myriad of approaches came into practice. With social media emergence the personalization was extended to different level. The main reason for this preference of personalized engine over traditional search was need of accurate and precise results. Due to paucity of time and patience users didn't want to surf several pages to find the result that suits them most. Personalized search engines could solve this problem effectively by understanding user through profiles and histories and thus diminishing uncertainty and ambiguity. But since several layers of personalization were added to basic search, the response time and resource requirement (for profile storage) increased manifold. So it's time to focus on optimizing the layered architectures of personalization. The paper presents a layout of the multi agent based personalized search engine that works on histories and profiles. Further to store the huge amount of data, distributed database is used at its core, so high availability, scaling, and geographic distribution are built in and easy to use. Initially results are retrieved using traditional search engine, after applying layer of personalization the results are provided to user. MongoDB is used to store profiles in flexible form thus improving the performance of the engine. Further Weighted Sum model is used to rank the pages in personalization layer.