RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Exact Inference for Three-way Interaction Effects

        전수영 한국자료분석학회 2013 Journal of the Korean Data Analysis Society Vol.15 No.1

        The contingency table analysis is generally based on the log-linear model conditioning on sufficient statistics. We can easily design algorithms to maintain these conditions, but it is often very difficult to ensure irreducibility, particularly, in no three-way interaction test. Recently, Cheon (2012) applied the stochastic approximation Monte Carlo algorithm (SAMC, Liang et al., 2007) to approximate the exact test of mutual independence in multiway contingency table. In this paper, we propose a method using SAMC to approximate the exact test for the contingency table as a test of the null hypothesis of no three-way interaction among variables. The proposed method avoids reducibility problem and its performance has been investigated on three real datasets, comparing with existing importance sampling and Markov chain Monte Carlo methods. The numerical results are in favor of our method in terms of quality of estimates.

      • KCI등재

        Shadowed set approximation of fuzzy sets based on nearest quota of fuzziness

        T. O. William-West,A. M. Ibrahim,A. F. D. Kana 원광대학교 기초자연과학연구소 2019 ANNALS OF FUZZY MATHEMATICS AND INFORMATICS Vol.17 No.2

        Shadowed set approximation of fuzzy sets has been introduced and enhanced to exploit some optimization-based principles which define the quality of its approximation. It found its applications in granular computing, cluster computing and recommender systems. This paper introduces a new approach accompanied with an algorithm; based on a principle of uncertainty invariance, to simplify fuzzy sets by inducing its best approximation which possesses the nearest quota of fuzziness as encountered in the original fuzzy set. Some numerical examples are provided to demonstrate how to implement the proposed method. The new approach is useful in preserving the uncertainty and information inherently associated with a given fuzzy set. A comparative study is made with related methods. The results of some evaluation indices on the approximation effectiveness illustrate the essence of the proposed method.

      • KCI등재

        On balance of uncertainty in shadowed sets

        M. A. Ibrahim,T. O. William-West,A. F. D. Kana,D. Singh 원광대학교 기초자연과학연구소 2020 ANNALS OF FUZZY MATHEMATICS AND INFORMATICS Vol.19 No.3

        A shadowed set, $S$, facilitates crisp decision-making with a fuzzy set $F$. It is constructed with the aid of different optimization-based principles. Among these principles, the requirement of uncertainty balance guarantees preservation of the uncertainty of $F$ in $S$. In order to gain further insight on uncertainty balance, some essential mathematical properties which characterize uncertainty-balance-based objective function, $J(\alpha)$, are studied. These properties provide theoretical explanation for interpreting and analyzing $J(\alpha)$ and its ensuing optimum partition threshold $\alpha$. Two senses of uncertainty balance are discussed in this paper. Their combined efficiency in enhancing clustering results is illustrated with the aid of synthetic data set used in shadowed $C$-means clustering. Finally a need for five-region shadowed sets, $S_5$, is pointed out. A closed-form formula for determining its optimum thresholds is proposed and exemplified on typical fuzzy set and synthetic dataset.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼