• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2786-2796
• /
• 1998

Extraction of interesting and general knowledge from large spatial database is an important task in the development of geographical information system and knowledge-base systems. In this paper, we propose a spatial data mining system using generalization method; In this system, we extend an existing generalization mining and design a rulebase to support deriving new spatial knowledge. For this purpose, we propose an interleaved method which integrates spatial data dominated and nonspatial data dominated mining and construct a rulebase to extract topological relationship between spatial objects.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.1
• /
• pp.99-117
• /
• 1999

Since query language is used as a handy tool to obtain information from a database, a more intelligent query answering system is needed to provide user-friendly and fault-tolerant human-machine Interface. Frequently, database users prefer less rigid querying structure, one which allows for vagueness in composing queries, and want the system to understand the intent behind a query. When there is no matching data available, users would rather receive approximate answers than a null information response. This paper presents a knowledge abstraction database that facilitates the development of such a fault-tolerant and intelligent database system. The proposed knowledge abstraction database adepts a multilevel knowledge representation scheme called the knowledge abstraction hierarchy(KAH), extracts semantic data relationships from the underlying database, and provides query transformation mechanisms using query generalization and specialization steps. In cooperation with the underlying database, the knowledge abstraction database accepts vague queries and allows users to pose approximate queries as well as conceptually abstract queries. Specifically. four types of vague queries are discussed, including approximate selection, approximate join, conceptual selection, and conceptual Join. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database application systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.537-541
• /
• 2001

This study is to construct ODBC Database based Web, which has a structure of Web server and Database server connected with Database concerning server demand for the purpose of the efficient record, use and management of various document data. Each ASP OLE DB ran be saved and inferred by measuring CLC and ULC. That makes to record, use and management of document data more convenient. For the application of the suggested of the system this study is to put together into 6 categories and generalize the synthetic opinion column of high school student document.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.3
• /
• pp.217-224
• /
• 2011

This paper proposes DDPT(Dynamic Data Protection Technique) which solves the problem of private information exposure occurring in a dynamic database environment. The DDPT in this paper generates the MAG(Multi-Attribute Generalization) rules using multi-attributes generalization algorithm, and the EC(equivalence class) satisfying the k-anonymity according to the MAG rules. Whenever data is changed, it reconstructs the EC according to the MAC rules, and protects the identification exposure which is caused by the EC change. Also, it measures the information loss rates of the EC which satisfies the ${\ell}$-diversity. It keeps data accuracy by selecting the EC which is less than critical value and enhances private information protection.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.13 no.1
• /
• pp.77-83
• /
• 1995

This paper is concentrated on map generalization in digital environment for automated multi-scale map pro-duction using conventional hardcopy maps. Line generalization is urgently required process to prepare small scale digital map database when large scale map databases are available. This paper outlines a new approach to the line generalization when preparing small scale map on the basis of existing large scale distal map. Line generalizations are conducted based on zero-crossing algorithm using six sheets of 115,000 scale YEOSU area which produced by National Geographic Institute. The results are compared to Douglas-Peucker algorithm and manual method. The study gives full details of the data reduction rates and alternatives based on the proposed algorithm.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.108-117
• /
• 1996

In this paper, we propose a new type of recurrent neural network architecture in which each output unit is connected with itself and fully-connected with other output units and all hidden units. The proposed recurrent network differs from Jordan's and Elman's recurrent networks in view of functions and architectures because it was originally extended from the multilayer feedforward neural network for improving the discrimination and generalization power. We also prove the convergence property of learning algorithm of the proposed recurrent neural network and analyze the performance of the proposed recurrent neural network by performing recognition experiments with the totally unconstrained handwritten numeral database of Concordia University of Canada. Experimental results confirmed that the proposed recurrent neural network improves the discrimination and generalization power in recognizing spatial patterns.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.837-848
• /
• 2005

A multi-scale database is a set of spatial database, covering same geographic area with different scales and it can be derived from pre-existing databases. In the derivation processes of a new multi-scale spatial database, the geometries and topological relations on the source database can be transformed and the transformation can be the cause of the lack of integrity Therefore, it is necessary to assess the transformation whether it is consistent or not after the derivation process of a new multi-scale database. Thus, we propose assessment methods for the topological consistency between a source database and a derived multi-scale database in this paper. In particular, we focus on the case that 2-dimensional objects are collapsed to 1-dimensional ones in the derivation process of a multi-scale database. We also describe implementation of the assessment methods and show the results of the implementation with experimental data.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.122-127
• /
• 1998

This paper suggests an integrated method for discovering knowledge from a large database. Our approach applies an attribute-oriented concept hierarchy ascension technique to extract generalized data from actural data in databases, induction of decision trees to measure the value of information, and knowledge reduction of rough set theory to remove dispensable attributes and attribute values. The integrated algorithm first reduce the size of database for the concept generalization, reduces the number of attributes by way of elimination condition attributes which have little influence on decision attribute, and finally induces simplified decision rules removing the dispensable attribute values by analyzing the dependency relationships among the attributes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.333-338
• /
• 2017

Recently, because of the mobile device generalization tendency, a lot of new mobile applications which need mobile database on mobile devices appear. SQLite, Realm, etc. are representative mobile databases, and they are the database engines which are suitable for small devices that have large resource restriction and are used a lot in mobile devices based on Linux. These engines are open source programs and have advantages which are lighter weight and faster speed than general purpose databases. This paper focuses on the performance experiments and analysis of SQLite, which is front runner in mobile database fields. Considering the target mobile environments, the test is performed at Linux environment. And this paper implements performance test program and performs performance experiment of SQLite database to test search efficiency. The experiment is processed by comparison with the results of a Oracle database working out at the same environment.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1665-1680
• /
• 1997

The Entity-Relationship (E-R) model is widely used not only to increase understanding between user and designer, but also to model the relationship of real world data appropriately when designing database system in many application areas. It should be then transformed into an Object-Oriented database model which gives good merits to represent and manipulate data efficiently. Therefore, a method of transforming an E-R model into an Object-Oriented database model should be studied, but without losing any semantics of concept for the E-R model. This paper not only deals with transformation rules taking as input the elements of E-R model and delivering the elements of an Object-Oriented database model, but also improves the concept of generalization and aggregation inheritance. The paper also presents a method of transformation of relationship depending on these rules. The proposed method that obtains Object-Oriented database schema from an E-R model with preserving the properties of the E-R model is shown with examples. The method presented is able to be used to the logical database design.