• The Journal of Information Systems
• /
• v.18 no.3
• /
• pp.327-349
• /
• 2009

Traditional keyword-based searching methods suffer from low accuracy and high complexity due to the rapid growth in the amount of information. Accordingly, many researchers attempt to implement a so-called semantic search which is based on the semantics of the user's query. Semantic information can be described using a semantic modeling language, such as Topic Map. In this paper, we propose a new method to map a topic map to a traditional Relational Database (RDB) without any information loss. Although there have been a few attempts to map topic maps to RDB, they have paid scant attention to handling multi-role topics. In this paper, we propose a new storage structure to map multi-role topics to traditional RDB. The proposed structure consists of a mapping table, role tables, and content tables. Additionally, we devise a query translator to convert a user's query to one appropriate to the proposed structure.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.966-969
• /
• 2012

This study suggests a query conversion method based on Topic Maps MetaData Registry(TMDR) in order to solve heterogeneity problems distributed in networks and to integrate data efficiently. In order to integrate distributed data, TMDR provides global schema and it solves heterogeneity problem within local data using query conversion method. After analyzing relationship between Meta Schema Ontology(MSO) of eXtended Meta Data Registry(XMDR) and Topic Maps, this method allows integrated access through Meta Location(ML) which manages accessing information of local data. The processing method is to produce a global query for global processing by using TMDR and then to make the produced global query approach to systems distributed through networks so that allows integrated access at the end. For this, we propose a method to convert a global query into a query which is adaptive to local query.

• Journal of Information Science Theory and Practice
• /
• v.1 no.3
• /
• pp.33-46
• /
• 2013

Despite limited success, today's information retrieval (IR) systems are not intelligent or reliable. IR systems return poor search results when users formulate their information needs into incomplete or ambiguous queries (i.e., weak queries). Therefore, one of the main challenges in modern IR research is to provide consistent results across all queries by improving the performance on weak queries. However, existing IR approaches such as query expansion are not overly effective because they make little effort to analyze and exploit the meanings of the queries. Furthermore, word sense disambiguation approaches, which rely on textual context, are ineffective against weak queries that are typically short. Motivated by the demand for a robust IR system that can consistently provide highly accurate results, the proposed study implemented a novel topic detection that leveraged both the language model and structural knowledge of Wikipedia and systematically evaluated the effect of query disambiguation and topic-based retrieval approaches on TREC collections. The results not only confirm the effectiveness of the proposed topic detection and topic-based retrieval approaches but also demonstrate that query disambiguation does not improve IR as expected.

• Journal of KIISE:Software and Applications
• /
• v.31 no.4
• /
• pp.488-497
• /
• 2004

This paper describes the hybrid document summarization using the indicative summarization and the query-based summarization. The learning models are built from teaming documents in order to extract topic phrases. We use Naive Bayesian, Decision Tree and Supported Vector Machine as the machine learning algorithm. The system extracts topic phrases automatically from new document based on these models and outputs the summary of the document using query-based summarization which considers the extracted topic phrases as queries and calculates the locality-based similarity of each topic phrase. We examine how the topic phrases affect the summarization and how many phrases are proper to summarization. Then, we evaluate the extracted summary by comparing with manual summary, and we also compare our summarization system with summarization mettled from MS-Word.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.6
• /
• pp.223-234
• /
• 2021

Recent advances in the 4th Industrial Revolution have accelerated the change of the shopping behavior from offline to online. Search queries show customers' information needs most intensively in online shopping. However, there are not many search query research in the field of search, and most of the prior research in the field of search query research has been studied on a limited topic and data-based basis based on researchers' qualitative judgment. To this end, this study defines the type of search query with data-based quantitative methodology by applying machine learning to search research query field to define the 15 topics of search query by conducting topic modeling based on search query and clicked document information. Furthermore, we present a new classification system of new search query types representing searching behavior characteristics by extracting key variables through principal component analysis and analyzing. The results of this study are expected to contribute to the establishment of effective search services and the development of search systems.

• Journal of Korean Library and Information Science Society
• /
• v.52 no.1
• /
• pp.79-108
• /
• 2021

Information retrieval in the health field has several challenges. Health information terminology is difficult for consumers (laypeople) to understand. Formulating a query with professional terms is not easy for consumers because health-related terms are more familiar to health professionals. If health terms related to a query are automatically added, it would help consumers to find relevant information. The proposed query expansion (QE) models show how to expand a query using MeSH terms. The documents were represented by MeSH terms (i.e. Bag-of-MeSH), found in the full-text articles. And then the MeSH terms were used to generate LDA (Latent Dirichlet Analysis) topic models. A query and the top k retrieved documents were used to find MeSH terms as topic words related to the query. LDA topic words were filtered by threshold values of topic probability (TP) and word probability (WP). Threshold values were effective in an LDA model with a specific number of topics to increase IR performance in terms of infAP (inferred Average Precision) and infNDCG (inferred Normalized Discounted Cumulative Gain), which are common IR metrics for large data collections with incomplete judgments. The top k words were chosen by the word score based on (TP *WP) and retrieved document ranking in an LDA model with specific thresholds. The QE model with specific thresholds for TP and WP showed improved mean infAP and infNDCG scores in an LDA model, comparing with the baseline result.

• KIISE Transactions on Computing Practices
• /
• v.23 no.11
• /
• pp.611-616
• /
• 2017

In the area of Information Retrieval, Query Expansion is a well-known technique that uses external knowledge to increase an inquiry generated by users. However, ambiguous words used in the query decrease the performance of search tools. In this paper, we propose a solution to the above problem, by using domain knowledge which identifies the meaning of words in the query. In particular, we present a domain centered query expansion technique that magnifies a query using domains. By comparing with various query expansion models, we demonstrate that the proposed model performs better than the other models.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.2
• /
• pp.690-696
• /
• 2016

Search engines that rely on morphological matching of user query and web document content do not support individual interests. This research proposes a personalized web search scheme that returns the results that reflect the users' query intent and personal preferences. The performance of the personalized search depends on using an effective user profiling strategy to accurately capture the users' personal interests. In this study, the user profiles are the databases of topic words and customized weights based on the recent user queries and the frequency of topic words in click history. To determine the precise meaning of ambiguous queries and topic words, this strategy uses WordNet to calculate the semantic relatedness to words in the user profile. The experiments were conducted by installing a query expansion and re-ranking modules on the general web search systems. The results showed that this method has 92% precision and 82% recall in the top 10 search results, proving the enhanced performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.718-720
• /
• 2008

In this paper, the study focus on continuous query in EPC Information Services(EPCIS) middleware which is a component of RFID system. We can consider EPCIS as a data stream system with a repository. In our work continuous query is implemented in two query execution model. One is standing query model another is traditional query execution model in which continuous query run over database periodically. Furthermore a balance strategy is presented. It is used to determine which continuous query implementation model is suitable for the query. Finally we conclude our work and issue some research topic for future work.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.109-111
• /
• 2004

대표적인 시맨틱 웹 서비스 발견 기술은 OWL-S와 MIT의 Process Handbook이 있다. 그러나. OWL-S는 개발 초기 단계이기 때문에, 아직 효과적인 웹 서비스 발견을 제공하기에는 몇 가지 제약 조건을 가지고 있다. 예를 들어. 정보 전송을 위한 제악 조건과 실행에 따른 상태 변환 정보를 정의하고 있지 않다. 또한. 사용자가 원하는 프로세스들의 시맨틱 정보들을 정의하고 있지 않다. 반면, MIT Process Handbook은 OWL-S와 같이 서비스 모델에 대한 상세한 정보들을 정의하고 있지 않아, 서비스 작성에 필요한 서비스들을 찾기가 어렵다. 그러므로, 본 논문에서는 Topic Maps 기반의 TM-S(Topic Maps for Service)를 제안하였다.