• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.447-450
• /
• 2003

In this research, we propose an automatic knowledge acquisition and composite knowledge expression mechanism based on machine learning and relational database. Most of traditional approaches to develop a knowledge base and inference engine of expert systems were based on IF-THEN rules, AND-OR graph, Semantic networks, and Frame separately. However, there are some limitations such as automatic knowledge acquisition, complicate knowledge expression, expansibility of knowledge base, speed of inference, and hierarchies among rules. To overcome these limitations, many of researchers tried to develop an automatic knowledge acquisition, composite knowledge expression, and fast inference method. As a result, the adaptability of the expert systems was improved rapidly. Nonetheless, they didn't suggest a hybrid and generalized solution to support the entire process of development of expert systems. Our proposed mechanism has five advantages empirically. First, it could extract the specific domain knowledge from incomplete database based on machine learning algorithm. Second, this mechanism could reduce the number of rules efficiently according to the rule extraction mechanism used in machine learning. Third, our proposed mechanism could expand the knowledge base unlimitedly by using relational database. Fourth, the backward inference engine developed in this study, could manipulate the knowledge base stored in relational database rapidly. Therefore, the speed of inference is faster than traditional text -oriented inference mechanism. Fifth, our composite knowledge expression mechanism could reflect the traditional knowledge expression method such as IF-THEN rules, AND-OR graph, and Relationship matrix simultaneously. To validate the inference ability of our system, a real data set was adopted from a clinical diagnosis classifying the dermatology disease.

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

Fuzzy information retrieval which uses the concept of fuzzy relation is able to retrieve documents in the way based on not morphology but semantics, dissimilar to traditional information retrieval theories. Fuzzy information retrieval logically consists of three sets : the set of documents, the set of terms and the set of queries. It maintains a fuzzy relational matrix which describes the relationship between documents and terms and creates a thesaurus with fuzzy relational product. It also provides the user with documents which are relevant to his query. However, there are some problems on building a thesaurus with fuzzy relational product such that it has big time complexity and it uses fuzzy values to be processed with flating-point. Actually, fuzzy values have to be expressed and processed with floating-point. However, floating-point operations have complex logics and make the system be slow. If it is possible to exchange fuzzy values with binary values, we could expect sp eding up building the thesaurus. In addition, binary value expressions require just a bit of memory space, but floating -point expression needs couple of bytes. In this study, we suggest a new method of building a thesaurus, which accelerates the operation of the system by pre-applying an ${\alpha}$-cut. The experiments show the improvement of performance and reliability of the system.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.49-52
• /
• 2003

In this research, we propose a mechanism to develop an inference engine and expert systems based on relational database and SQL (structured query language). Generally, former researchers had tried to develop an expert systems based on text-oriented knowledge base and backward/forward (chaining) inference engine. In these researches, however, the speed of inference was remained as a tackling point in the development of agile expert systems. Especially, the forward inference needs more times than backward inference. In addition, the size of knowledge base, complicate knowledge expression method, expansibility of knowledge base, and hierarchies among rules are the critical limitations to develop an expert systems. To overcome the limitations in speed of inference and expansibility of knowledge base, we proposed a relational database-oriented knowledge base and forward inference engine. Therefore, our proposed mechanism could manipulate the huge size of knowledge base efficiently, and inference with the large scaled knowledge base in a short time. To this purpose, we designed and developed an SQL-based forward inference engine using relational database. In the implementation process, we also developed a prototype expert system and presented a real-world validation data set collected from medical diagnosis field.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.452-455
• /
• 2005

In order to reproduce the traffic accident, It must save the data automatically which traffic accident 30 seconds before using black box. The Black Box can detect traffic crash accidents automatically, and record the vehicle's motion and driver's maneuvers during a pre-defined time Belied before and after the accident. But it is not easy for the police to catch running away criminal. Because, criminal can remove proof if it is 2 hours or 3 hours at least. Therefore, in this paper, in order to catch a hit and run driver in the traffic accident road, it developed an structured Query Language Server and made parts database algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.165-170
• /
• 2011

Due to advances in hardware performance, user-friendly interfaces are becoming one of the major concerns in information systems. Linguistic conversation is a very natural way of human communications. Fuzzy techniques have been employed to liaison the discrepancy between the qualitative linguistic terms and quantitative computerized data. This paper deals with linguistic queries using clustering results on data sets, which are intended to retrieve the close clusters or distant clusters from the clustering results. In order to support such queries, a fuzzy technique-based method is proposed. The method introduces distance membership functions, namely, close and distant membership functions which transform the metric distance between two objects into the degree of closeness or farness, respectively. In order to measure the degree of closeness or farness between two clusters, both cluster closeness measure and cluster farness measure which incorporate distance membership function and cluster memberships are considered. For the flexibility of clustering, fuzzy clusters are assumed to be formed. This allows us to linguistically query close or distant clusters by constructing fuzzy relation based on the measures.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.7 no.4
• /
• pp.274-278
• /
• 2007

As XML becomes the standard of digital data exchange format we need to manage a lot of XML data effectively. Unlike tables in relational model XML documents are not structural. That makes it difficult to store XML documents as tables in relational model. To solve these problems there have been significant researches in relational database systems. There are two kinds of approaches: 1) One way is to decompose XML documents so that elements of XML match fields of relational tables. 2) The other one stores a whole XML document as a field of relational table. In this paper we adopted the second approach to store XML documents because sometimes it is not easy for us to decompose XML documents and in some cases their element order in documents are very meaningful. We suggest an efficient table schema to store only inverted index as tables to retrieve required data from XML data fields of relational tables and shows SQL translations that correspond to XML full-text retrievals. The functionalities of XML retrieval are based on the W3C XQuery which includes full-text retrievals. In this paper we show the superiority of our method by comparing the performances in terms of a response time and a space to store inverted index. Experiments show our approach uses less space and shows faster response times.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.5
• /
• pp.419-425
• /
• 2001

A method to detect lots of porno documents on the internet is presented in this parer. The proposed method applies fuzzy inference mechanism to the conventional information retrieval techniques. First, several example sites on porno arc provided by users and then candidate words representing for porno documents are extracted from theme documents. In this process, lexical analysis and stemming are performed. Then, several values such as tole term frequency(TF), the document frequency(DF), and the Heuristic Information(HI) Is computed for each candidate word. Finally, fuzzy inference is performed with the above three values to weight candidate words. The weights of candidate words arc used to determine whether a liven site is sexual or not. From experiments on small test collection, the proposed method was shown useful to detect the sexual sites automatically.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.351-356
• /
• 2000

The important thing of Information Retrieval System is to satisfy is to satisfy the user's requriement in searching Information Retrieval system ranks documents by weights in document, then Retrieved document context does not consist with given query. This paper proposes a new method of document retrieval based on extended fuzzy concept networks. there are four of fuzzy relationships between concept; fuzzy positive combination, fuzzy negative combination, fuzzy generalization, and fuzzy specilalization. After modeling an extended fuzzy concept network by relation matrix and relevance matrix, we measured similarties.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.3
• /
• pp.163-172
• /
• 2016

Electric load forecasting is essential for effective power system planning and operation. Complex and nonlinear relationships exist between the electric loads and their exogenous factors. In addition, time-series load data has non-stationary characteristics, such as trend, seasonality and anomalous day effects, making it difficult to predict the future loads. This paper proposes a locally-weighted polynomial neural network (LWPNN), which is a combination of a polynomial neural network (PNN) and locally-weighted regression (LWR) for daily shortterm peak load forecasting. Model over-fitting problems can be prevented effectively because PNN has an automatic structure identification mechanism for nonlinear system modeling. LWR applied to optimize the regression coefficients of LWPNN only uses the locally-weighted learning data points located in the neighborhood of the current query point instead of using all data points. LWPNN is very effective and suitable for predicting an electric load series with nonlinear and non-stationary characteristics. To confirm the effectiveness, the proposed LWPNN, standard PNN, support vector regression and artificial neural network are applied to a real world daily peak load dataset in Korea. The proposed LWPNN shows significantly good prediction accuracy compared to the other methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.743-748
• /
• 2003

In this research, we propose a mechanism to develop an inference engine and expert systems based on relational database (RDB) and SQL (structured query language). Generally, former researchers had tried to develop an expert systems based on text-oriented knowledge base and backward/forward (chaining) inference engine. In these researches, however, the speed of inference was remained as a tackling point in the development of agile expert systems. Especially, the forward inference needs more times than backward inference. In addition, the size of knowledge base, complicate knowledge expression method, expansibility of knowledge base, and hierarchies among rules are the critical limitations to develop an expert system. To overcome the limitations in speed of inference and expansibility of knowledge base, we proposed a relational database-oriented knowledge base and forward inference engine. Therefore, our proposed mechanism could manipulate the huge size of knowledge base efficiently. and inference with the large scaled knowledge base in a short time. To this purpose, we designed and developed an SQL-based forward inference engine using relational database. In the implementation process, we also developed a prototype expert system and presented a real-world validation data set collected from medical diagnosis field.