메뉴 건너뛰기




Volumn 5, Issue 1, 2002, Pages 5-40

Asymmetric missing-data problems: Overcoming the lack of negative data in preference ranking

Author keywords

Imbalanced training data; Incomplete data problems; Information retrieval; Personalization; User modeling

Indexed keywords


EID: 11244278806     PISSN: 13864564     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012714523368     Document Type: Article
Times cited : (6)

References (51)
  • 6
    • 0028424239 scopus 로고
    • Improving generalization with active learning
    • Cohn D, Atlas L and Ladner R (1994) Improving generalization with active learning. Machine Learning, 15(2):201-221.
    • (1994) Machine Learning , vol.15 , Issue.2 , pp. 201-221
    • Cohn, D.1    Atlas, L.2    Ladner, R.3
  • 7
    • 0018711255 scopus 로고
    • Using probabilistic models of document retrieval without relevance information
    • Croft W and Harper D (1979) Using probabilistic models of document retrieval without relevance information. Journal of Documentation, 35:285-295.
    • (1979) Journal of Documentation , vol.35 , pp. 285-295
    • Croft, W.1    Harper, D.2
  • 10
    • 84976789577 scopus 로고
    • Personalized information delivery An analysis of information filtering methods
    • Foltz PW and Dumais ST (1992) Personalized information delivery An analysis of information filtering methods. Communications of the ACM, 35(12):51-60. http://www-psychnmsuedu/~pfoltz/cacm/cacm.html.
    • (1992) Communications of the ACM , vol.35 , Issue.12 , pp. 51-60
    • Foltz, P.W.1    Dumais, S.T.2
  • 12
    • 0002393292 scopus 로고
    • Ranking algorithms
    • Frakes WB and Baeza-Yates R, Eds., Prentice-Hall, Boston, MA
    • Harman D (1992) Ranking algorithms. In: Frakes WB and Baeza-Yates R, Eds., Information Retrieval. Data Structures and Algorithms Prentice-Hall, Boston, MA. pp. 363-392.
    • (1992) Information Retrieval. Data Structures and Algorithms , pp. 363-392
    • Harman, D.1
  • 17
    • 0002714543 scopus 로고    scopus 로고
    • Making large-scale svm learning practical
    • Schoelkopf B, Burges C and Smola A, Eds.. MIT Press
    • Joachims T (1999) Making large-scale svm learning practical. In: Schoelkopf B, Burges C and Smola A, Eds.. Advances in Kernel Methods - Support Vector Learning. MIT Press.
    • (1999) Advances in Kernel Methods - Support Vector Learning
    • Joachims, T.1
  • 19
    • 0031162639 scopus 로고    scopus 로고
    • ANATANAGONOMY: A personalized newspaper on the world wide web
    • Kamba T. Sahagami H and Koseki Y (1997) ANATANAGONOMY: A personalized newspaper on the world wide web. Int J. Human-Compuer Studies, 46:789-803
    • (1997) Int J. Human-Compuer Studies , vol.46 , pp. 789-803
    • Kamba, T.1    Sahagami, H.2    Koseki, Y.3
  • 23
    • 84957069091 scopus 로고    scopus 로고
    • Naive (bayes) at forty: The independence assumption in information retrieval
    • Lewis DD (1998) Naive (bayes) at forty: The independence assumption in information retrieval. In: Proceedings of the 10th European Conference on Machine Learning, pp. 4-15. http://www.research.att.comm/ ~lewis/papers/lewis98bps.
    • (1998) Proceedings of the 10th European Conference on Machine Learning , pp. 4-15
    • Lewis, D.D.1
  • 35
    • 0033886806 scopus 로고    scopus 로고
    • Text classification from labeled and unlabeled documents using EM
    • Nigam K, McCallum AK, Thrun S and Mitchell T (2000) Text classification from labeled and unlabeled documents using EM. Machine Learning, 39(2):103-134.
    • (2000) Machine Learning , vol.39 , Issue.2 , pp. 103-134
    • Nigam, K.1    McCallum, A.K.2    Thrun, S.3    Mitchell, T.4
  • 36
    • 0031168547 scopus 로고    scopus 로고
    • Learning and revising user profiles: The identification of interesting web sites
    • Pazzani M and Billsus D (1997) Learning and revising user profiles: The identification of interesting web sites. Machine Learning, 27:313-331. http://www.ics.uci,edu/~pazzani/publications/SW-MLJ.pdf
    • (1997) Machine Learning , vol.27 , pp. 313-331
    • Pazzani, M.1    Billsus, D.2
  • 39
    • 0003243224 scopus 로고    scopus 로고
    • Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods
    • Smola A. Bartlett P, Scholkopf B and Schuurmans D, Eds., MIT Press
    • Platt J (2000) Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. In Smola A. Bartlett P, Scholkopf B and Schuurmans D, Eds., Advances in Large-Margin Classifiers (Neural Information Processing), MIT Press.
    • (2000) Advances in Large-Margin Classifiers (Neural Information Processing)
    • Platt, J.1
  • 40
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping Program
    • Porter M (1980) An algorithm for suffix stripping Program (Automated Library and Information Systems ), 14(3):130-137.
    • (1980) Automated Library and Information Systems , vol.14 , Issue.3 , pp. 130-137
    • Porter, M.1
  • 42
    • 0016958419 scopus 로고
    • Relevance weighting of search terms
    • Robertson SE and Sparck-Jones K (1976) Relevance weighting of search terms JASIS pp. 129-176.
    • (1976) JASIS , pp. 129-176
    • Robertson, S.E.1    Sparck-Jones, K.2
  • 48
    • 84976806698 scopus 로고
    • Automating the creation of information filters
    • Stevens C (1992) Automating the creation of information filters. Communications of the ACM, 35(12).48.
    • (1992) Communications of the ACM , vol.35 , Issue.12 , pp. 48
    • Stevens, C.1


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