• Title/Summary/Keyword: Query suggestion

Search Result 9, Processing Time 0.03 seconds

Automatic Suggestion for PubMed Query Reformulation

  • Tuan, Luu Anh;Kim, Jung-Jae
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.2
    • /
    • pp.161-167
    • /
    • 2012
  • Query reformulation is an interactive process of revising user queries according to the query results. To assist biomedical researchers in this process, we present novel methods for automatically generating query reformulation suggestions. While previous work on query reformulation focused on addition of words to user queries, our method can deal with three types of query reformulation (i.e., addition, removal and replacement). The accuracy of the method for the addition type is ten times better than PubMed's "Also try", while the execution time is short enough for practical use.

An analysis of user behaviors on the search engine results pages based on the demographic characteristics

  • Bitirim, Yiltan;Ertugrul, Duygu Celik
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.2840-2861
    • /
    • 2020
  • The purpose of this survey-based study is to make an analysis of search engine users' behaviors on the Search Engine Results Pages (SERPs) based on the three demographic characteristics gender, age, and program studying. In this study, a questionnaire was designed with 12 closed-ended questions. Remaining questions other than the demographic characteristic related ones were about "tab", "advertisement", "spelling suggestion", "related query suggestion", "instant search suggestion", "video result", "image result", "pagination" and the amount of clicking results. The questionnaire was used and the data collected were analyzed with the descriptive statistics as well as the inferential statistics. 84.2% of the study population was reached. Some of the major results are as follows: Most of each demographic characteristic category (i.e. female, male, under-20, 20-24, above-24, English computer engineering, Turkish computer engineering, software engineering) have rarely or more click for tab, spelling suggestion, related query suggestion, instant search suggestion, video result, image result, and pagination. More than 50.0% of female category click advertisement rarely; however, for the others, 50.0% or more never click advertisement. For every demographic characteristic category, between 78.0% and 85.4% click 10 or fewer results. This study would be the first attempt with its complete content and design. Search engine providers and researchers would gain knowledge to user behaviors about the usage of the SERPs based on the demographic characteristics.

An Efficient Extended Query Suggestion System Using the Analysis of Users' Query Patterns (사용자 질의패턴 분석을 이용한 효율적인 확장검색어 추천시스템)

  • Kim, Young-An;Park, Gun-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7C
    • /
    • pp.619-626
    • /
    • 2012
  • With the service suggesting additional extended or related query, search engines aim to provide their users more convenience. The extended or related query suggestion service based on popularity, or by how many people have searched on web using the query, has limitations to elevate users' satisfaction, because each user's preference and interests differ. This paper will demonstrate the design and realization of the system that suggests extended query appropriate for users' demands, and also an improvement in the computing process between entering the first search word and the subsequent extension to the related themes. According to the evaluation the proposed system suggested 41% more extended or related query than when searching on Google, and 48% more than on Yahoo. Also by improving the shortcomings of the extended or related query system based on general popularity rather than each user's preference, the new system enhanced users' convenience further.

Query Expansion based on Word Sense Community (유사 단어 커뮤니티 기반의 질의 확장)

  • Kwak, Chang-Uk;Yoon, Hee-Geun;Park, Seong-Bae
    • Journal of KIISE
    • /
    • v.41 no.12
    • /
    • pp.1058-1065
    • /
    • 2014
  • In order to assist user's who are in the process of executing a search, a query expansion method suggests keywords that are related to an input query. Recently, several studies have suggested keywords that are identified by finding domains using a clustering method over the documents that are retrieved. However, the clustering method is not relevant when presenting various domains because the number of clusters should be fixed. This paper proposes a method that suggests keywords by finding various domains related to the input queries by using a community detection algorithm. The proposed method extracts words from the top-30 documents of those that are retrieved and builds communities according to the word graph. Then, keywords representing each community are derived, and the represented keywords are used for the query expansion method. In order to evaluate the proposed method, we compared our results to those of two baseline searches performed by the Google search engine and keyword recommendation using TF-IDF in the search results. The results of the evaluation indicate that the proposed method outperforms the baseline with respect to diversity.

An Energy Efficient Query Processing Mechanism using Cache Filtering in Cluster-based Wireless Sensor Networks (클러스터 기반 WSN에서 캐시 필터링을 이용한 에너지 효율적인 질의처리 기법)

  • Lee, Kwang-Won;Hwang, Yoon-Cheol;Oh, Ryum-Duck
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.149-156
    • /
    • 2010
  • As following the development of the USN technology, sensor node used in sensor network has capability of quick data process and storage to support efficient network configuration is enabled. In addition, tree-based structure was transformed to cluster in the construction of sensor network. However, query processing based on existing tree structure could be inefficient under the cluster-based network. In this paper, we suggest energy efficient query processing mechanism using filtering through data attribute classification in cluster-based sensor network. The suggestion mechanism use advantage of cluster-based network so reduce energy of query processing and designed more intelligent query dissemination. And, we prove excellence of energy efficient side with MATLab.

Improvement of Science and Technology Information Retrieval Service using Semantic Language Resource (의미적 언어자원을 활용한 과학기술정보 검색 서비스 개선)

  • Cho, Min-Hee;Choi, Sung-Pil;Choi, Ho-Seop;Yoon, Hwa-Mook
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.11a
    • /
    • pp.570-574
    • /
    • 2006
  • KISTI portal service is currently presenting the documents with many terminologies, so users can't find the results having their intention by using an umbrella query. In this paper, we suggest user oriented retrieval service that reflects query auto-complete, related-word suggestion and query expansion that uses nouns and relationships of U-WIN which is known as a semantic language resource. We intend to advance the retrieval satisfaction of current science & technology information service by using U-WIN's semantic information and improve the service environment that user can retrieve what they want quickly and exactly.

  • PDF

Knowledge Based Search System In the ebXML Environment (ebXML 환경에서의 지식기반 검색 시스템)

  • 최형림;김현수;최현덕
    • The Journal of Society for e-Business Studies
    • /
    • v.7 no.3
    • /
    • pp.75-91
    • /
    • 2002
  • As B2B (Business to business) develops swiftly, at home as well as in other advanced countries, plans for activating Electronic business are made and proceeded in a national viewpoint. However, it is essential task for the construction, advancement and activation of B2B framework to make an efficient search for differently built -up data from B2C and thus to look for optimal business partner suitable for his/her own business. For this, in the last Aug. of 2001, government has also referred to ebXML, the exchange model for electronic business data based on XML, as a suggestion for B2B framework. The purpose of this study is to develop search system for efficient choice of business partner and this will play an important role for data processing and competitiveness strengthening of small and medium enterprises. Meanwhile, this system is built up by using systemic characteristics registered in ebXML Registry/Repository and ‘question-expanding’ searching ways based on the particulars of business profiles for both objectiveness and maximum efficiency of search result.

  • PDF

Alleviating Semantic Term Mismatches in Korean Information Retrieval (한국어 정보 검색에서 의미적 용어 불일치 완화 방안)

  • Yun, Bo-Hyun;Park, Sung-Jin;Kang, Hyun-Kyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3874-3884
    • /
    • 2000
  • An information retrieval system has to retrieve all and only documents which are relevant to a user query, even if index terms and query terms are not matched exactly. However, term mismatches between index terms and qucry terms have been a serious obstacle to the enhancement of retrieval performance. In this paper, we discuss automatic term normalization between words in text corpora and their application to a Korean information retrieval system. We perform two types of term normalizations to alleviate semantic term mismatches: equivalence class and co-occurrence cluster. First, transliterations, spelling errors, and synonyms are normalized into equivalence classes bv using contextual similarity. Second, context-based terms are normalized by using a combination of mutual information and word context to establish word similarities. Next, unsupervised clustering is done by using K-means algorithm and co-occurrence clusters are identified. In this paper, these normalized term products are used in the query expansion to alleviate semantic tem1 mismatches. In other words, we utilize two kinds of tcrm normalizations, equivalence class and co-occurrence cluster, to expand user's queries with new tcrms, in an attempt to make user's queries more comprehensive (adding transliterations) or more specific (adding spc'Cializationsl. For query expansion, we employ two complementary methods: term suggestion and term relevance feedback. The experimental results show that our proposed system can alleviatl' semantic term mismatches and can also provide the appropriate similarity measurements. As a result, we know that our system can improve the rctrieval efficiency of the information retrieval system.

  • PDF

A Mobile Multicast Mechanism for End-to-End QoS Delivery (End-to-End QoS를 지원하기 위한 이동 멀티캐스트 기법)

  • Kim Tae-Soo;Lee Kwang-Hui
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.5B
    • /
    • pp.253-263
    • /
    • 2005
  • This paper proposed a mobile multicast technique to satisfy end-to-end QoS for various user requirements in mobile network environment. In order to provide seamless mobility, fast handoff technique was applied. By using L2 mobile trigger, it was possible to minimize remarkable amount of packet loss by delay occurred during handoff. To provide efficient multicast, concept of hierarchy was introduced to Xcast++, which results in a creation of HXcast++. HXcast++ optimized transfer path of multicast and reduced expensive multicast maintenance costs caused by frequent handoff. Suggestion of GMA (Group Management Agent) mechanism allows joining to group immediately without waiting IGMP Membership query during handoff. GMA mechanism will minimize the delay for group registration process and the resource usage due to delay of withdrawal process. And also use of buffering & forwarding technique minimized packet loss during generation of multicast tree. IntServ/RSVP was used to provide End-to-End QoS in local domain and DiffServ was used in global domain. To minimize reestablishment of RSVP session delay, extended HXcast++ control messages ware designed to require PATH message. HXcast++ proposed in this thesis is defined as multicast technique to provide end-to-end QoS and also to satisfy various user requirements in mobile network environment.