메뉴 건너뛰기




Volumn 163, Issue 1, 2008, Pages 115-142

A probabilistic framework for the design of instance-based supervised ranking algorithms in an ordinal setting

Author keywords

Instance based learning; Monotone classification; Stochastic dominance; Supervised ranking

Indexed keywords


EID: 49249099254     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-008-0326-1     Document Type: Article
Times cited : (59)

References (27)
  • 2
    • 84990617887 scopus 로고
    • Automatic generation of symbolic multiattribute ordinal knowledge-based DSSs: Methodology and applications
    • 6
    • A. Ben-David 1992 Automatic generation of symbolic multiattribute ordinal knowledge-based DSSs: Methodology and applications Decision Sciences 23 6 1357 1372
    • (1992) Decision Sciences , vol.23 , pp. 1357-1372
    • Ben-David, A.1
  • 3
    • 0010910030 scopus 로고
    • Monotonicity maintenance in information-theoretic machine learning algorithms
    • 1
    • A. Ben-David 1995 Monotonicity maintenance in information-theoretic machine learning algorithms Machine Learning 19 1 29 43
    • (1995) Machine Learning , vol.19 , pp. 29-43
    • Ben-David, A.1
  • 13
  • 21
  • 24
    • 9444280557 scopus 로고    scopus 로고
    • Classification trees for problems with monotonicity constraints
    • 1
    • R. Potharst A. J. Feelders 2002 Classification trees for problems with monotonicity constraints SIGKDD Explorations 4 1 1 10
    • (2002) SIGKDD Explorations , vol.4 , pp. 1-10
    • Potharst, R.1    Feelders, A.J.2
  • 25
    • 33744584654 scopus 로고
    • Induction of decision trees
    • J. R. Quinlan 1986 Induction of decision trees Machine Learning 1 81 106
    • (1986) Machine Learning , vol.1 , pp. 81-106
    • Quinlan, J.R.1


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