메뉴 건너뛰기




Volumn 21, Issue 3, 2006, Pages 381-398

Noisy-or classifier

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; MATHEMATICAL MODELS; TEXT PROCESSING;

EID: 33645293420     PISSN: 08848173     EISSN: 1098111X     Source Type: Journal    
DOI: 10.1002/int.20141     Document Type: Conference Paper
Times cited : (27)

References (16)
  • 2
    • 0001861652 scopus 로고
    • A new look at causal independence
    • Lopez de Mantaras R, Poole D, editors
    • Heckerman D, Breese JS. A new look at causal independence. In: Lopez de Mantaras R, Poole D, editors. Proc Tenth Conf on Uncertainty in AI; 1994. pp 286-292.
    • (1994) Proc Tenth Conf on Uncertainty in AI , pp. 286-292
    • Heckerman, D.1    Breese, J.S.2
  • 3
    • 0002047712 scopus 로고
    • A generalization of the Noisy-or model
    • Heckerman D, Mamdani A, editors
    • Srinivas S. A generalization of the Noisy-Or model. In: Heckerman D, Mamdani A, editors. Proc Ninth Conf on Uncertainty in AI; 1993. pp 208-215.
    • (1993) Proc Ninth Conf on Uncertainty in AI , pp. 208-215
    • Srinivas, S.1
  • 4
    • 0037323094 scopus 로고    scopus 로고
    • An efficient factorization for the noisy MAX
    • Dìez FJ, Galán SF. An efficient factorization for the noisy MAX. Int J Intell Syst 2003;18:165-177.
    • (2003) Int J Intell Syst , vol.18 , pp. 165-177
    • Dìez, F.J.1    Galán, S.F.2
  • 5
    • 8444222225 scopus 로고    scopus 로고
    • Exploiting functional dependence in Bayesian network inference
    • Darwiche A, Friedman N, editors
    • Vomlel J. Exploiting functional dependence in Bayesian network inference. In: Darwiche A, Friedman N, editors. Proc 18th Conf on Uncertainty in Artificial Intelligence (UAI 2002); 2002. pp 528-535.
    • (2002) Proc 18th Conf on Uncertainty in Artificial Intelligence (UAI 2002) , pp. 528-535
    • Vomlel, J.1
  • 6
    • 33645292778 scopus 로고    scopus 로고
    • Tensor rank-one decomposition of probability tables
    • Savicky P, Vomlel J. Tensor rank-one decomposition of probability tables. Research Report DAR-UTIA 2005/26. Available at http://staff.utia.cas.cz/vomlel/ rank-one-decomposition. pdf.
    • Research Report , vol.DAR-UTIA 2005-26
    • Savicky, P.1    Vomlel, J.2
  • 7
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the em algorithm
    • Dempster AP, Laird NM, Rubin DB. Maximum likelihood from incomplete data via the EM algorithm. J Roy Stat Soc Ser B 1977;39:1-38.
    • (1977) J Roy Stat Soc Ser B , vol.39 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 9
    • 58149210716 scopus 로고
    • The em algorithm for graphical association models with missing data
    • Lauritzen SL. The EM algorithm for graphical association models with missing data. Comput Stat Data Anal 1995;19:191-201.
    • (1995) Comput Stat Data Anal , vol.19 , pp. 191-201
    • Lauritzen, S.L.1
  • 11
    • 70350335356 scopus 로고
    • Logistic discrimination
    • Krishnaiah PR, Kanal LN, editors. Amsterdam: North-Holland
    • Anderson JA. Logistic discrimination. In: Krishnaiah PR, Kanal LN, editors. Handbook of statistics, vol 2. Amsterdam: North-Holland; 1982. pp 169-191.
    • (1982) Handbook of Statistics , vol.2 , pp. 169-191
    • Anderson, J.A.1
  • 14
    • 0003120218 scopus 로고    scopus 로고
    • Fast training of support vector machines using sequential minimal optimization
    • Schölkopf B, Burges C, Smola A, editors. Cambridge, MA: MIT Press
    • Platt J. Fast training of support vector machines using sequential minimal optimization. In: Schölkopf B, Burges C, Smola A, editors. Advances in kernel methods - Support vector learning. Cambridge, MA: MIT Press; 1998.
    • (1998) Advances in Kernel Methods - Support Vector Learning
    • Platt, J.1


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