• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.5
• /
• pp.18-27
• /
• 2006

Rapid increase of the amount of music data demands for a new method that allows efficient similarity retrieval of music genre using audio features in music databases. To build this similarity retrieval, an indexing techniques that support audio features as a time-series pattern and data mining technologies are needed. In this paper, we address the development of a system that retrieves similar genre music based on the indexing techniques. We first propose the structure of content-based music genre retrieval system based on the time-series pattern index file and data mining technologies. In addition, we implement the time-series pattern index file using audio features and present performance analysis of the time-series pattern index file for similar genre retrieval. The experiments are performed on real data to verify the performance of the proposed method.

• The KIPS Transactions:PartB
• /
• v.17B no.2
• /
• pp.125-138
• /
• 2010

The purpose of this research is to enhance document recognition system which is essential for developing full-text retrieval system of the document image data stored in the digital library of a public institution. To achieve this purpose, the main tasks of this research are: 1) analyzing the document image data and then developing its image preprocessing technology and document structure analysis one, 2) building its specialized knowledge base consisting of document layout and property, character model and word dictionary, respectively. In addition, developing the management tool of this knowledge base, the document recognition system is able to handle the various types of the document image data. Currently, we developed the prototype system of document recognition which is combined with the specialized knowledge base and the library of document structure analysis, respectively, adapted for the document image data housed in National Archives of Korea. With the results of this research, we plan to build up the test-bed and estimate the performance of document recognition system to maximize the utilization of full-text retrieval system.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.243-256
• /
• 2008

With rapid growth of Internet, the amount of information in the Web is increasing exponentially. However, information on the current Web is understandable only for human, and thus it makes the exact information retrieval difficult. For solving this problem, the Semantic Web is suggested and we must use ontology languages that can endow data to semantics for implementing it. One of the representative ontology languages is OWL(Web Ontology Language) adopted as a recommendation by the World-Wide Web Consortium. OWL has richer expression power and formal semantics than other ontology languages such as RDF and RDF-S. In addition, OWL includes hierarchical structure information between classes or properties. Therefore, an efficient OWL storage model considering hierarchical structure for effective information retrieval on the Semantic Web is required. In this paper, we suggest the XPOS(XPath-based OWL Storage) model including hierarchy information between classes or properties as XPath form and enabling intuitive and effective information retrieval. Also, we show the comparative evaluation results on the performance of XPOS model, Sesame, and the XML storage-based storage model regarding query processing.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.1
• /
• pp.129-154
• /
• 1998

In these days the online full-text database are increasing, but conventional full-text information retrieval system has been proved with high recall ratio and low precision ratio. One of the disadvantages of full-text IR system is that it is not designed to reflect the user's information need it is due to the fact that full-text IR system has been designed based on physical and logical structure of document without considering the content of document. Therefore, the purpose of the study examined feasibility of document content structure in full-text IR system by resolving such disadvantages of conventional system. 180 Journal articles have been analyzed to find common structure of document content and finally general model of the structure of journal articles were developed. The result shows that have relation to between user's cogntive schema structure, user's information need and contents structure of document. Thus it is concluded that full-text IR system need to be designed by using document content structure in order to meet user's information need more effectively.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.6
• /
• pp.1-9
• /
• 1994

Astorage structure using signatures is proposed to evaluate efficently queries including conditions of nested attributes in the nested relational databases This method stores a subrelation signature into the storage structure for a nested tuple with its subrelation pointer. During query processing steps, the subrelation signatures are matched first with the nested predicates in the query. When the match operation completes with success then physical retrieval of the subrelation occurrs resulting in reduction of disk 1/Os.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.69-82
• /
• 2004

A moving object has a special feature that it's spatial location, shape and size are changed as time goes. These changes of the object accompany the continuous movement that is called the trajectory. In this paper, we propose an index structure that users can retrieve the trajectory of a moving object with the access of a page. We also propose the multi-complex query that is a new query type for trajectory retrieval. In order to prove the excellence of our method, we compare and analyze the performance for query time and storage space through experiments in various environments. It is shown that our method outperforms the existing index structures when processing spatio-temporal trajectory queries on moving objects.

• Journal of the Korean Society for information Management
• /
• v.15 no.3
• /
• pp.73-93
• /
• 1998

Conventional full-text information retrieval system has been proved with high recall ratio and low precision ratio. One of the disadvantages of full-text IR system is that it is not designed to reflect the user's information need. It is due to the fact that full-text IR system has been designed based on physical and logical structure of document without considering the content of document. The purpose of the study is to develop more effective full-text IR system by resolving such disadvantages of conventional system. The study has developed new method of designing full-text IR system by using Content Structure Markup Language(CSML) other than conventioanal SGML.

• Journal of the Korean Society for information Management
• /
• v.14 no.1
• /
• pp.77-105
• /
• 1997

The study confirmed that the methods for expanding headings and combined structures among the headings, subdivisions, qualifiers and inverted terms were diverse, and that the headings used for similar purposes do not have identical structural forms. It is also found that the standard symbols representing generic relationship in theasurus, which are introduced in the list of subject headings, do not show precisely the hiearchical relationship of phrase headings. MeSH in pre-coordinated system will be available for retrieval in the computer environment because it can make a link between headings and subdivisions in searching stage. The changes in retrieval circumstances and the seeking behaviors of the users demand that a new structure of subject headings be developed. It was proposed that the modification of the structure in the Hangul subject headings be essential.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.377-382
• /
• 2010

With the advent of flash memory based new storage device (SSD), there is considerable interest within the computer industry in using flash memory based storage devices for many different types of application. The dynamic index structure of large text collections has been a primary issue in the Information Retrieval Applications among them. Previous studies have proven the three approaches to be effective: In- Place, merge-based index structure and a combination of both. The above-mentioned strategies have been researched with the traditional storage device (HDD) which has a constraint on how keep the contiguity of dynamic data. However, in case of the new storage device, we don' have any constraint contiguity problems due to its low access latency time. But, although the new storage device has superiority such as low access latency and improved I/O throughput speeds, it is still not well suited for traditional dynamic index structures because of the poor random write throughput in practical systems. Therefore, using the experimental performance evaluation of various index maintenance schemes on the new storage device, we propose an efficient index structure for new storage device that improves significantly the index maintenance speed without degradation of query performance.

• International conference on construction engineering and project management
• /
• 2020.12a
• /
• pp.505-509
• /
• 2020

Twitter is a useful medium to grasp various damage situations that have occurred in society. However, it is a laborious task to spot damage-related topics according to time in the environment where information is constantly produced. This paper proposes a methodology of constructing a knowledge structure by combining the BERT-based classifier and the community detection techniques to discover the topics underlain in the damage information. The methodology consists of two steps. In the first step, the tweets are classified into the classes that are related to human damage, infrastructure damage, and industrial activity damage by a BERT-based transfer learning approach. In the second step, networks of the words that appear in the damage-related tweets are constructed based on the co-occurrence matrix. The derived networks are partitioned by maximizing the modularity to reveal the hidden topics. Five keywords with high values of degree centrality are selected to interpret the topics. The proposed methodology is validated with the Hurricane Harvey test data.