• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1782-1789
• /
• 1997

Most systems that retrieve distributed information on the Internet have difficulties in retrieving relevant information for they are not able to reflect exact semantics on retrieval queries that usersrequest. In this paepr, we propose an automatic query expansion based on ter distribution which reflects semantics of retrieval term to emhance the performance of information retrieval. We computed weight, indicating its overal imoritance in the collection documents and user's query and we use LSI's SVD technique to measure the term distribution which appears similar to query. And also, we measure the similarity to compared numerical value with query terms. Also we researched the method to reduce additional terms automatically and evaluated the performance of the proposed method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.46-47
• /
• 2010

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.171-178
• /
• 2008

Foreign word transliterations are not consistently used in documents, which hinders retrieving some important relevant documents in exact term matching information retrieval systems. In this paper, a meta search method is proposed, which expands and refines relevant variant queries from an original input foreign word transliteration query to retrieve the more relevant documents. The method firstly expands a transliteration query to the variants using a statistical method. Secondly the method selects the valid variants: it queries each variant to the retrieval systems beforehand and checks the validity of each variant by counting the number of appearance of the variant in the retrieved document and calculating the similarity of the context of the variant. Experiment result showed that querying with the variants produced at the first step, which is a base method of the test, performed 38% in average F measure, and querying with the refined variants at the second step, which is a proposed method, significantly improved the performance to 81% in average F measure.

• Journal of Advanced Navigation Technology
• /
• v.20 no.6
• /
• pp.617-624
• /
• 2016

The hangul word embedding should be performed certainly process for noun extraction. Otherwise, it should be trained words that are not necessary, and it can not be derived efficient embedding results. In this paper, we propose model that can retrieve more efficiently by query language expansion using hangul word embedded, apriori, and text mining. The word embedding and apriori is a step expanding query language by extracting association words according to meaning and context for query language. The hangul text mining is a step of extracting similar answer and responding to the user using noun extraction, TF-IDF, and cosine similarity. The proposed model can improve accuracy of answer by learning the answer of specific domain and expanding high correlation query language. As future research, it needs to extract more correlation query language by analysis of user queries stored in database.

• Journal of Korean Library and Information Science Society
• /
• v.26
• /
• pp.365-400
• /
• 1997

The interface design for most present query-base model of OPAC systems does not include the function to implement an iterative feedback process till the user arrives at satisfied search results through the interaction with the system. Also, the interface doesn't provide the help function for a user to select pertinent search terms. To formulate a query at the present OPAC system, a user should learn a set of syntax different from system to system. All of above mentioned things make an end-user feel difficult to utilize an OPAC system effectively. This experimental system is attempted to alleviate a few limitations of the present OPAC system by a n.0, pplying the direct-manipulation technique as well as the feedback principle. First, this system makes it unnecessary for a user to learn some syntax for query formulation by providing option buttons for access points. Second, this system makes it possible for a user to decide whether each displayed record is relevant or not, and for keywords included in the relevant records to be automatically stored in order to be used for later feedback. Third, in this system, the keywords stored in [sayongja yongeu bogyanham] can be deleted if unnecessary or can selected as search terms for a query expansion as well as a query modification. Fourth, in this system, after inputting the original query, the feedback process can be proceed without coming back to the previous search step until a user becomes satisfied with the search results. In conclusion, the searching behaviors of heterogeneous users should be continuously observed, analysed, and studied, the findings of which should be integrated into the design for the interface of the OPAC system.

• The Journal of the Korea Contents Association
• /
• v.7 no.2
• /
• pp.73-83
• /
• 2007

An information retrieval system, using exact match, needs preprocessing or query expansion to generate transliteration variants in order to search foreign word transliteration variants in the documents. This paper proposes an effective method to generate other transliteration variants from a given transliteration. Because simple rewriting of confused characters produces too many false variants, the proposed method controls the generation priority by learning confusion patterns from real uses and calculating their probability. Especially, the left and right context of a pattern is considered, and local rewriting probability and global rewriting probability are calculated to produce more probable variants in earlier stage. The experimental result showed that the method was very effective by showing more than 80% recall with top 20 generations for a transliteration variants set collected from KT SET 2.0.

• Journal of KIISE:Software and Applications
• /
• v.37 no.8
• /
• pp.620-628
• /
• 2010

With the use of the Internet pervasive in everyday life, people are now able to retrieve a lot of information through the web. However, exponential growth in the quantity of information on the web has brought limits to online search engines in their search performance by showing piles and piles of unwanted information. With so much unwanted information, web users nowadays need more time and efforts than in the past to search for needed information. This paper suggests a method of using query expansion in order to quickly bring wanted information to web users. Popularity based Term Weight Mensuration better performance than the TF-IDF and Simple Popularity Term Weight Mensuration to experiments without changes of search subject. When a subject changed during search, Popularity based Term Weight Mensuration's performance change is smaller than others.

• 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.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.1
• /
• pp.91-103
• /
• 2010

This paper introduces efficient rule-based semantic search techniques to ontology-based knowledge commerce services. Primarily, the search techniques presented in this paper define rules of reasoning that are required for users to search using the concept of ontology, multiple characteristics, relations among concepts and data type. In addition, based on the defined rules, the rule-based reasoning techniques search ontology for knowledge commerce services. This paper explains the conversion rules of query which convert user's query language into semantic search words, and transitivity rules which enable users to search related tags, knowledge products and users. Rule-based sematic search techniques are also presented; these techniques comprise knowledge search modules that search ontology using validity examination of queries, query conversion modules for standardization and expansion of search words and rule-based reasoning. The techniques described in this paper can be applied to sematic knowledge search systems using tags, since transitivity reasoning, which uses tags, knowledge products, and relations among people, is possible. In addition, as related users can be searched using related tags, the techniques can also be employed to establish collaboration models or semantic communities.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2271-2280
• /
• 1998

In this paper, we propose a method to retneve english written korcan names efficientl, and design a multilingual name retrieval system, It is very difficult to retrieve english-written korean names in typical IR sytems. For example, "홍길동" is written in english as vanous forms such like "Hong, gildong", "Gildong Hong", "Hong kil dong", "Hong kil dong" and so on, We not only propose a rule-based querv expansion method to retrieve english-written korean names efficiently but also design a multiligual name retneval system which is consisted of query classifier, exception handler, query expander, query executor, exception list and rulebase, Finally we will try to show that english-written korean names could be efficiently retrieved with rule based name generator.