메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 461-466

Extraction of relationship among Kansei words by expert system using rough set analysis

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; MAPPING; NONLINEAR SYSTEMS; PSYCHOLOGY COMPUTING; REGRESSION ANALYSIS; ROUGH SET THEORY; USER INTERFACES;

EID: 33745726222     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AMT.2005.1505397     Document Type: Conference Paper
Times cited : (7)

References (9)
  • 2
    • 0344339135 scopus 로고    scopus 로고
    • Rough approximation of a preference relation by dominance relations
    • S. Greco, and R. Slowinski, "Rough approximation of a preference relation by dominance relations,"European Journal of Operational Research, Vol. 117, pp. 63-83, 1999.
    • (1999) European Journal of Operational Research , vol.117 , pp. 63-83
    • Greco, S.1    Slowinski, R.2
  • 5
    • 0028497290 scopus 로고
    • Maximum likelihood training of probabilistic neural networks
    • R. L. Streit and T. E. Luginbuhl, "Maximum likelihood training of probabilistic neural networks,"IEEE Trans. NN, Vol. 5, No. 3, pp. 764-783, 1994.
    • (1994) IEEE Trans. NN , vol.5 , Issue.3 , pp. 764-783
    • Streit, R.L.1    Luginbuhl, T.E.2
  • 6
    • 0002629270 scopus 로고
    • Maximum-likelihood from incomplete data via the em algorithm
    • A. P. Dempster, N. M. Laird and D. B. Rubin, "Maximum-likelihood from incomplete data via the EM algorithm, J. Royal Statist. Soc. Ser. B, Vol. 39, pp. 1-38, 1977.
    • (1977) J. Royal Statist. Soc. Ser. B , vol.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.