• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.131-142
• /
• 2002

This paper announces that, with the emergence of the imaginary university for the remote education, which is based on Web due to the education change, the introduction of the Multimedia contents system using computers and the Internet becomes serious. For this reason, this paper suggests search system for managing the imaginary university documents. For the success of the document management of the imaginary university, document search is regarded as an important issue as well as the executive support and search system of the document management. This paper plans and embodies the imaginary university XML document search system to establish the foundation of increasing efficiency o( affairs using XML document, by aiming at the fact that it will be highlighted as a representative application field as well as the efficiency of the executive affairs, by applying of Multimedia documentary creation system, which is about the imaginary university XML documentary that it is seen distinctly an effect of administrative work being a consequence of new technique application of computers.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.5
• /
• pp.501-509
• /
• 2002

SGML(ISO 8879) has been proliferated to support various document styles and to transfer documents into different platforms. SGML documents have logical structure information in addition to contents. As SGML documents are widely used, there is an increasing need for database storage and retrieval system using the logical structure of documents. However. traditional search engines using document indexes cannot exploit the logical structure. In this Paper, we have developed an SGML document storage system, which is DTD-independent and store the document type and the document instance separately by using Grove which is the document model for DSSSL and HyTime. We have used the Object Store, an object-oriented DBMS, to store the structure information appropriately without any loss of structural information. Also, we have supported a index structure for search efficiency like the relational DBMS, and constructed an effective user interface which combines content-based search with structure-based search.

• Journal of the Korea Convergence Society
• /
• v.10 no.6
• /
• pp.41-47
• /
• 2019

It is very important to search for and obtain an example of a similar judgment in case of court judgment. The existing judge's document search uses a method of searching through key-words entered by the user. However, if it is necessary to input an accurate keyword and the keyword is unknown, it is impossible to search for the necessary document. In addition, the detected document may have different contents. In this paper, we want to improve the effectiveness of the method of vectorizing a document into a three-dimensional space, calculating cosine similarity, and searching close documents in order to search an accurate judge's example. Therefore, after analyzing the similarity of words used in the judge's example, a method is provided for extracting the mode and inserting it into the text of the text, thereby providing a method for improving the cosine similarity of the document to be retrieved. It is hoped that users will be able to provide a fast, accurate search trying to find an example of a tax-related judge through the proposed model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.424-428
• /
• 2004

Study related to a system that saves a n document, and to search is consisting actively and has a lot of cases to have left emphasis in the function that these systems efficiently save a XML document and can search. Also, It has a table or the storage structure which was especially designed in order to save a XML document and can save structure information of a document in addition to contents of a XML document together and can efficiently do content retrieval of a XML document or a structure search with an early base. As for this paper, a design implemented the data which the many different kinds of database that had currently used had with you so that did recycling and shared conversion and this XML file in Web, and output can become a XML format through various interrace.

• Journal of Information Technology and Architecture
• /
• v.9 no.3
• /
• pp.323-331
• /
• 2012

With the advancement of the area of knowledge and information, Intellectual Property, especially, patents have captured attention more and more emergent. The increasing need for efficient way of patent information search has been essential, but the prevailing patent search engines have included too many noises for the results due to the Boolean models. This has occasioned too much time for the professional experts to investigate the results manually. In this paper, we reveal the differences between the conventional document search and patent search and analyze the limitations of existing patent search. Furthermore, we propose a specialized in patent search, so that the relationship between the keywords within each document and their significance within each patent document search keyword can be identified. Which in turn, the keywords and the relationships have been appointed a ranking for this patent in the upper ranks and the noise in the data sub-ranked. Therefore this approach is proposed to significantly reduce noise ratio of the data from the search results. Finally, in, we demonstrate the superiority of the proposed methodology by comparing the Kipris dataset.

• Journal of KIISE:Databases
• /
• v.33 no.5
• /
• pp.538-550
• /
• 2006

XML Keyword search enables us to get information easily without knowledge of structure of documents and returns specific and useful partial document results instead of whole documents. Element level query processing makes it possible, but computational complexity, as the number of documents grows, increases significantly overhead costs. In this paper, we present document-level ranking scheme over XML documents which predicts results of element-level processing to reduce processing cost. To do this, we propose the notion of 'keyword proximity' - the correlation of keywords in a document that affects the results of element-level query processing using path information of occurrence nodes and their resemblances - for document ranking process. In benefit of document-centric view, it is possible to reduce processing time using ranked document list or filtering of low scored documents. Our experimental evaluation shows that document-level processing technique using ranked document list is effective and improves performance by the early termination for top-k query.

• IE interfaces
• /
• v.10 no.2
• /
• pp.79-90
• /
• 1997

Documents in a traditional PDM(Product Data Management) system have been managed in a form of scanned document files or electronic documents developed by specific tools. Though each tool manages documents with its own systematical methods, it has drawbacks in data search, data integration and interchange, etc. For this reason, in this research we propose an efficient document management system for PDM by using the SGML(Standard Generalized Markup Language), one of CALS and ISO standards for document interchanges. Among documents to be managed in PDM, the engineering change notification (ECN) is taken into account. The DTD (Document Type Definition) has been constucted based on the logical analysis of the documents format, In addition, based on the DTD, DB classes have been designed by object-oriented paradigms and a prototype for document input/output and search has been developed using UniSQL ORDBMS (Object-Relational DBMS) and PowerBuilder under the client/server environment.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.51-63
• /
• 2001

In this paper, we design and implement a XML document retrieval system to support structure-based retrieval using the BRS/Search system that is a commercial search engine, The implemented system in this paper represents the logical structure of XML documents as the directory structure of the Unix file system. In addition, we define the database schema of BRS/Search system to store documents, We also implement a ETID extractor, a structure information extractor, a storage manager and a query processor additionally to support content retrieval, structure retrieval, mixed retrieval and attribute retrieval in the BRS/Search system.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.503-509
• /
• 2017

In this paper, the copy mechanism and input feeding are applied to recurrent neural network(RNN)-search model in a Korean-document summarization in an end-to-end manner. In addition, the performances of the document summarizations are compared according to the model and the tokenization format; accordingly, the syllable-unit, morpheme-unit, and hybrid-unit tokenization formats are compared. For the experiments, Internet newspaper articles were collected to construct a Korean-document summary data set (train set: 30291 documents; development set: 3786 documents; test set: 3705 documents). When the format was tokenized as the morpheme-unit, the models with the input feeding and the copy mechanism showed the highest performances of ROUGE-1 35.92, ROUGE-2 15.37, and ROUGE-L 29.45.

• The Journal of the Korea Contents Association
• /
• v.7 no.5
• /
• pp.16-26
• /
• 2007

Because it is difficult on existing document retrieval systems to visualize the search result, search results show document titles and short summaries of the parts that include the search keywords. If the result list is long, it is difficult to examine all the documents at once and to find a relation among them. This study uses clustering to classify similar documents into groups to make it easy to grasp the relations among the searched documents. Also, this study proposes a two-level visualization algorithm such that, first, the center of clusters is projected to low-dimensional space by using multi-dimensional scaling to help searchers grasp the relation among clusters at a glance, and second, individual documents are drawn in low-dimensional space based on the center of clusters using the orbital model as a basis to easily confirm similarities among individual documents. This study is tested on the benchmark data and the real data, and it shows that it is possible to visualize search results in real time.