• Title/Summary/Keyword: generalized knowledge

Search Result 169, Processing Time 0.026 seconds

SRC-Stat Package for Fitting Double Hierarchical Generalized Linear Models (이중 다단계 일반화 선형모형 적합을 위한 SRC-stat의 사용)

  • Noh, Maengseok;Ha, Il Do;Lee, Youngjo;Lim, Johan;Lee, Jaeyong;Oh, Heeseok;Shin, Dongwan;Lee, Sanggoo;Seo, Jinuk;Park, Yonhtae;Cho, Sungzoon;Park, Jonghun;Kim, Youkyung;You, Kyungsang
    • The Korean Journal of Applied Statistics
    • /
    • v.28 no.2
    • /
    • pp.343-351
    • /
    • 2015
  • We introduce how to fit random effects models via a SRC-Stat statistical package. This package has been developed to fit double hierarchical generalized linear models where mean and dispersion parameters for the variance of random effects and residual variance (overdispersion) can be modeled as random-effect models. The estimates of fixed effects, random effects and variances are calculated by a hierarchical likelihood method. We illustrate the use of our package with practical data-sets.

Generalization of Zero-Knowledge Proof of Polynomial Equality (다항식 상등성 영지식 증명의 일반화)

  • Kim, Myungsun;Kang, Bolam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.5
    • /
    • pp.833-840
    • /
    • 2015
  • In this paper, we are interested in a generalization of zero-knowledge interactive protocols between prover and verifier, especially to show that the product of an encrypted polynomial and a random polynomial, but published by a secure commitment scheme was correctly computed by the prover. To this end, we provide a generalized protocol for proving that the resulting polynomial is correctly computed by an encrypted polynomial and another committed polynomial. Further we show that the protocol is also secure in the random oracle model. We expect that our generalized protocol can play a role of building blocks in implementing secure multi-party computation including private set operations.

Development of Expert Systems using Automatic Knowledge Acquisition and Composite Knowledge Expression Mechanism

  • Kim, Jin-Sung
    • 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.

  • PDF

Reciprocity Structure, Solidarity, and Exchange Benefits in Online Communities (온라인 커뮤니티 교환구조, 결속력, 교환혜택에 관한 연구)

  • Han, Eunyoung;Kim, Kyung Kyu;Lee, Ae Ri
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.12
    • /
    • pp.448-462
    • /
    • 2021
  • Only a few studies investigated the relationship between exchange structure and solidarity in online communities and even reported conflicting results. This study attempts to shed lights on this relationship by introducing a moderating variable, i.e., exchange benefits, based on the social exchange theory. Also, distributed knowledge is considered as a determinant of exchange structure. The results of a field study from 380 online communities show that both direct and generalized exchange structures have positive effects on community solidarity, but their effects vary depending on the level of exchange benefits. When exchange benefits are high, generalized exchange influences community solidarity more than direct exchange does, whereas at a low level of benefits there are no significant differences between the two exchange structures. Also distributed knowledge turns out to be a significant influencer of generalized exchange.

Self-Evolving Expert Systems based on Fuzzy Neural Network and RDB Inference Engine

  • Kim, Jin-Sung
    • Journal of Intelligence and Information Systems
    • /
    • v.9 no.2
    • /
    • pp.19-38
    • /
    • 2003
  • In this research, we propose the mechanism to develop self-evolving expert systems (SEES) based on data mining (DM), fuzzy neural networks (FNN), and relational database (RDB)-driven forward/backward inference engine. Most researchers had tried to develop a text-oriented knowledge base (KB) and inference engine (IE). However, this approach had some limitations such as 1) automatic rule extraction, 2) manipulation of ambiguousness in knowledge, 3) expandability of knowledge base, and 4) speed of inference. To overcome these limitations, knowledge engineers had tried to develop an automatic knowledge extraction mechanism. As a result, the adaptability of the expert systems was improved. Nonetheless, they didn't suggest a hybrid and generalized solution to develop self-evolving expert systems. To this purpose, we propose an automatic knowledge acquisition and composite inference mechanism based on DM, FNN, and RDB-driven inference engine. Our proposed mechanism has five advantages. First, it can extract and reduce the specific domain knowledge from incomplete database by using data mining technology. Second, our proposed mechanism can manipulate the ambiguousness in knowledge by using fuzzy membership functions. Third, it can construct the relational knowledge base and expand the knowledge base unlimitedly with RDBMS (relational database management systems) module. Fourth, our proposed hybrid data mining mechanism can reflect both association rule-based logical inference and complicate fuzzy relationships. Fifth, RDB-driven forward and backward inference time is shorter than the traditional text-oriented inference time.

  • PDF

Data Mining and FNN-Driven Knowledge Acquisition and Inference Mechanism for Developing A Self-Evolving Expert Systems

  • Kim, Jin-Sung
    • Proceedings of the KAIS Fall Conference
    • /
    • 2003.11a
    • /
    • pp.99-104
    • /
    • 2003
  • In this research, we proposed the mechanism to develop self evolving expert systems (SEES) based on data mining (DM), fuzzy neural networks (FNN), and relational database (RDB)-driven forward/backward inference engine. Most former researchers tried to develop a text-oriented knowledge base (KB) and inference engine (IE). However, thy have some limitations such as 1) automatic rule extraction, 2) manipulation of ambiguousness in knowledge, 3) expandability of knowledge base, and 4) speed of inference. To overcome these limitations, many of researchers had tried to develop an automatic knowledge extraction and refining mechanisms. As a result, the adaptability of the expert systems was improved. Nonetheless, they didn't suggest a hybrid and generalized solution to develop self-evolving expert systems. To this purpose, in this study, we propose an automatic knowledge acquisition and composite inference mechanism based on DM, FNN, and RDB-driven inference. Our proposed mechanism has five advantages empirically. First, it could extract and reduce the specific domain knowledge from incomplete database by using data mining algorithm. Second, our proposed mechanism could manipulate the ambiguousness in knowledge by using fuzzy membership functions. Third, it could construct the relational knowledge base and expand the knowledge base unlimitedly with RDBMS (relational database management systems). Fourth, our proposed hybrid data mining mechanism can reflect both association rule-based logical inference and complicate fuzzy logic. Fifth, RDB-driven forward and backward inference is faster than the traditional text-oriented inference.

  • PDF

A Note on Computing the Crisp Order Context of a Fuzzy Formal Context for Knowledge Reduction

  • Singh, Prem Kumar;Kumar, Ch. Aswani
    • Journal of Information Processing Systems
    • /
    • v.11 no.2
    • /
    • pp.184-204
    • /
    • 2015
  • Fuzzy Formal Concept Analysis (FCA) is a mathematical tool for the effective representation of imprecise and vague knowledge. However, with a large number of formal concepts from a fuzzy context, the task of knowledge representation becomes complex. Hence, knowledge reduction is an important issue in FCA with a fuzzy setting. The purpose of this current study is to address this issue by proposing a method that computes the corresponding crisp order for the fuzzy relation in a given fuzzy formal context. The obtained formal context using the proposed method provides a fewer number of concepts when compared to original fuzzy context. The resultant lattice structure is a reduced form of its corresponding fuzzy concept lattice and preserves the specialized and generalized concepts, as well as stability. This study also shows a step-by-step demonstration of the proposed method and its application.

Stochastic Initial States Randomization Method for Robust Knowledge Transfer in Multi-Agent Reinforcement Learning (멀티에이전트 강화학습에서 견고한 지식 전이를 위한 확률적 초기 상태 랜덤화 기법 연구)

  • Dohyun Kim;Jungho Bae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.27 no.4
    • /
    • pp.474-484
    • /
    • 2024
  • Reinforcement learning, which are also studied in the field of defense, face the problem of sample efficiency, which requires a large amount of data to train. Transfer learning has been introduced to address this problem, but its effectiveness is sometimes marginal because the model does not effectively leverage prior knowledge. In this study, we propose a stochastic initial state randomization(SISR) method to enable robust knowledge transfer that promote generalized and sufficient knowledge transfer. We developed a simulation environment involving a cooperative robot transportation task. Experimental results show that successful tasks are achieved when SISR is applied, while tasks fail when SISR is not applied. We also analyzed how the amount of state information collected by the agents changes with the application of SISR.

On the generalized truncated least squares adaptive algorithm and two-stage design method with application to adaptive control

  • Yamamoto, Yoshihiro;Nikiforuk, Peter-N.;Gupta, Madam-M.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10b
    • /
    • pp.7-12
    • /
    • 1993
  • This paper presents a generalized truncated least, squares adaptive algorithm and a two-stage design method. The proposed algorithm is directly derived from the normal equation of the generalized truncated least squares method (GTLSM). The special case of the GTLSM, the truncated least squares (TLS) adaptive algorithm, has a distinct features which includes the case of minimum steps estimator. This algorithm seemed to be best in the deterministic case. For real applications in the presence of disturbances, the GTLS adaptive algorithm is more effective. The two-stage design method proposed here combines the adaptive control system design with a conventional control design method and each can be treated independently. Using this method, the validity of the presented algorithms are examined by the simulation studies of an indirect adaptive control.

  • PDF

Performance Evaluation of Decision Fusion Rules of Wireless Sensor Networks in Generalized Gaussian Noise (Generalized Gaussian Noise에서의 무선센서 네트워크의 Decision Fusion Rule의 성능 분석에 관한 연구)

  • Park, Jin-Tae;Koo, In-Soo;Kim, Ki-Seon
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.97-98
    • /
    • 2006
  • Fusion of decisions from multiple distributed sensor nodes is studied in this work. Based on the canonical parallel fusion model, we derive the optimal likelihood ratio based fusion rule with the assumptions of the generalized Gaussian noise model and the arbitrary fading channel. This optimal fusion rule, however, requires the complete knowledge of the channels and the detection performance of local sensor nodes. To mitigate these requirements and to provide near optimum performance, we derive suboptimum fusion rules by using high and low signal-to-noise ratio (SNR) approximations to the optimal fusion rule. Performance evaluation is conducted through simulations.

  • PDF