• Journal of KIISE:Software and Applications
• /
• v.36 no.10
• /
• pp.861-873
• /
• 2009

There are many reasons that fail to get appropriate information in information retrieval. Allomorph is one of the reasons for search failure due to keyword mismatch. This research proposes a method to construct alternative word candidates automatically in order to minimize search failure due to keyword mismatch. Assuming that two words have similar meaning if they have similar co-occurrence words, the proposed method uses the concept of concentration, association word set, cosine similarity between association word sets and a filtering technique using confidence. Performance of the proposed method is evaluated using a manually extracted alternative list. Evaluation results show that the proposed method outperforms the context window overlapping in precision and recall.

• Journal of the Korean Society for information Management
• /
• v.12 no.2
• /
• pp.85-101
• /
• 1995

Conventional indexing sytstems support only full-text indexing method for electronic documents and do not use logical structure of documents in retrieval. Most electronic documents are in different formats depending on various systems. Also, they only indicate physical style of the document without considering any logical structure. Thus, in the effort to standardize the exchange of documents. IS0 developed SGML(Stadard Generalized Markup Language) which contains information about logical structure of the documents. In this paper, to resolve the disadvantages of full-text indexing method and to use standard document format. indexing system for SGML document is designed and implemented. In this system, user can assign indexing domain on elements, thus the logical structure of document is reflected in retrieving information. Various retrieval methods can be implemented by using the structural information of the document. In addition, automatic indexing for SGML Hangul document is supported in this system

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.27-40
• /
• 2003

The inverted index widely used in the existing information retrieval field should be extended for XML documents to support containment queries by XML information retrieval systems. In this paper, we consider that there are two methods in storing the inverted index and processing containment queries for XML documents as the previous work suggested: using a RDBMS or using an inverted lift engine. It has two drawbacks to extend the inverted index in the previous work. One is that using a RDBMS is moth worse in the performance than using an inverted list engine. The other is that when containment queries are processed in a RDBMS, there is an increase in the number of a join operation as the path length of a query increases and a join operation always happens between large fables. In this paper. we extend the inverted index in a different way to solve these problems and show the effectiveness of using a RDBMS.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.726-730
• /
• 2009

The proliferation of the web and digital photography has drastically increased multimedia data and has resulted in the need of the high quality internet service based on the moving picture like user generated contents(UGC). The keyword-based search on large scale images and video collections is too expensive and requires much manual intervention. Therefore the web search engine may provide the content-based retrieval on the multimedia data for search accuracy and customer satisfaction. In this paper, we propose a novel distributed index structure based on multiple length signature files according to data distribution. In addition, we describe how our scalable index technique can be used to find the nearest neighbors in the cluster environments.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.730-733
• /
• 2004

Recently XML (eXtensible Markup Language) is becoming the standard for exchanging the documents on the web. And as the amount of information is increasing because of the development of the technique in the Internet, semantic web is becoming to appear for more exact result of information retrieval than the existing one on the web. Ontology which is the basis of the semantic web provides the basic knowledge system to express a particular knowledge. So it can show the exact result of the information retrieval. Ontology defines the particular concepts and the relationships between the concepts about specific domain and it has the hierarchy similar to the taxonomy. In this paper, we propose the generation of semi-automatic ontology based on XML documents that are interesting to many researchers as the means of knowledge expression. To construct the ontology in a particular domain, we suggest the algorithm to determine the domain. So we determined that the domain of ontology is to extract the information of movie on the web. And we used the generalized association rules, one of data mining methods, to generate the ontology, using the tag and contents of XML documents. And XTM (XML Topic Maps), ISO Standard, is used to construct the ontology as an ontology language. The advantage of this method is that because we construct the ontology based on the terms frequently used documents related in the domain, it is useful to query and retrieve the related domain.

• The Journal of the Korea Contents Association
• /
• v.13 no.1
• /
• pp.19-29
• /
• 2013

In the current Internet environment where there is high space complexity of information, search engines aim to provide accurate information that users want. But content-based method adopted by most of search engines cannot be used as an effective tool in the current Internet environment. As content-based method gives different weights to each web page using morphological characteristics of vocabulary, the method has its drawbacks of not being effective in distinguishing each web page. To resolve this problem and provide useful information to the users, this paper proposes an evaluation method based on categories. Category-based evaluation method is to extend query to semantic relations and measure the similarity to web pages. In applying weighting to web pages, category-based evaluation method utilizes user response to web page retrieval and categories of query and thus better distinguish web pages. The method proposed in this paper has the advantage of being able to effectively provide the information users want through search engines and the utility of category-based evaluation technique has been confirmed through various experiments.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1165-1173
• /
• 2012

One of the most popular technologies in Web2.0 is tagging, and it widely applies to Web content as well as multimedia data such as image and video. Web users have expected that tags by themselves would be reused in information search and maximize the search efficiency, but wrong tag by irresponsible Web users really has brought forth a incorrect search results. In past papers, we have gathered various information resources and tags scattered in Web, mapped one tag onto other tags, and clustered these tags according to the corelation between them. A 3-tag based search algorithm which use the clustered tags of past papers, is proposed in this paper. For performance evaluation of the proposed algorithm, our algorithm is compared with image search result of Flickr, typical tag based site, and is evaluated in accuracy and recall factor.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1397-1403
• /
• 2015

A named entity(NE) dictionary is an important resource for the performance of NE recognition. However, it is not easy to construct a NE dictionary manually since human annotation is time consuming and labor-intensive. To save construction time and reduce human labor, we propose a semi-automatic system for the construction of a NE dictionary. The proposed system constructs a pseudo-document with Wiki-categories per NE class by using an active learning technique. Then, it calculates similarities between Wiki entries and pseudo-documents using the BM25 model, a well-known information retrieval model. Finally, it classifies each Wiki entry into NE classes based on similarities. In experiments with three different types of NE class sets, the proposed system showed high performance(macro-average F1-score of 0.9028 and micro-average F1-score 0.9554).

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.32 no.4C
• /
• pp.149-157
• /
• 2012

In order to investigate the soil disturbance induced by anchor-shoe for PVD installation and the anchoring mechanism, a new two dimensional testing system was developed. By using the developed testing system, 1g and centrifuge model tests were performed, simulating the driving-retrieval process of both conventional symmetric anchor shoe and new asymmetric anchor shoe. Various size anchor-shoes were simulated and the results were compared. The images recorded during the installation were analyzed by image processing technique. The results of the image analysis presented the clay disturbance depending on the size and type of anchor shoe. In addition, from the retrieval process, the anchoring mechanism was revealed and the holding capacity was measured. As results, the size of anchor shoe influences the soil disturbance and holding capacity. The new asymmetric anchor shoe reduces the soil disturbance and improves anchoring performance.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.