메뉴 건너뛰기




Volumn 9, Issue 3, 1998, Pages 217-230

Incremental Feature Selection

Author keywords

Dimensionality reduction; Feature selection; Machine learning; Pattern recognition

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; OPTIMIZATION; PROBABILISTIC LOGICS;

EID: 0032206482     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008363719778     Document Type: Article
Times cited : (189)

References (30)
  • 2
    • 0000217085 scopus 로고    scopus 로고
    • Tolerating noisy, irrelevant and novel attributes in instance-bassed learning algorithm
    • D.W. Aha, "Tolerating noisy, irrelevant and novel attributes in instance-bassed learning algorithm," International Journal of Man-Machine Studies, vol. 36, no. 1, 1992.
    • International Journal of Man-Machine Studies , vol.36 , Issue.1 , pp. 1992
    • Aha, D.W.1
  • 3
    • 0017535866 scopus 로고
    • A branch and bound algorithm for feature subset selection
    • September
    • P.M. Narendra and K. Fukunaga, "A branch and bound algorithm for feature subset selection," IEEE Trans, on Computer, vol. C-26, no. 9, pp. 917-922, September 1977.
    • (1977) IEEE Trans, on Computer , vol.C-26 , Issue.9 , pp. 917-922
    • Narendra, P.M.1    Fukunaga, K.2
  • 6
    • 0031078007 scopus 로고    scopus 로고
    • Feature selection: Evaluation, application, and small sample performance
    • A. Jain and D. Zongker, "Feature selection: Evaluation, application, and small sample performance," IEEE Trans, on Pattern Analysis and Machine Intelligence, vol. 19, no. 2, pp. 153-158, 1997.
    • (1997) IEEE Trans, on Pattern Analysis and Machine Intelligence , vol.19 , Issue.2 , pp. 153-158
    • Jain, A.1    Zongker, D.2
  • 9
    • 0019094381 scopus 로고
    • A critical evaluation of intrinsic dimensionality algorithms
    • edited by E.S. Gelsema and L.N. Kanal, Morgan Kaufmann Publishers, Inc.
    • N. Wyse, R. Dubes, and A.K. Jain, "A critical evaluation of intrinsic dimensionality algorithms," in Pattern Recognition in Practice, edited by E.S. Gelsema and L.N. Kanal, Morgan Kaufmann Publishers, Inc., pp. 415-425, 1980.
    • (1980) Pattern Recognition in Practice , pp. 415-425
    • Wyse, N.1    Dubes, R.2    Jain, A.K.3
  • 12
    • 0028496468 scopus 로고
    • Learning Boolean concepts in the presence of many irrelevant features
    • November
    • H. Almuallim and T.G. Dietterich, "Learning Boolean concepts in the presence of many irrelevant features," Artificial Intelligence, vol. 69, nos. 1-2, pp. 279-305, November 1994.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 279-305
    • Almuallim, H.1    Dietterich, T.G.2
  • 15
    • 33744584654 scopus 로고
    • Induction of decision trees
    • J.R. Quinlan, "Induction of decision trees," Machine Learning, vol. 1, no. 1, pp. 81-106, 1986.
    • (1986) Machine Learning , vol.1 , Issue.1 , pp. 81-106
    • Quinlan, J.R.1
  • 16
    • 0025389210 scopus 로고
    • Boolean feature discovery in empirical learning
    • G. Pagallo and D. Haussler, "Boolean feature discovery in empirical learning," Machine Learning, vol. 5, pp. 71-99, 1990.
    • (1990) Machine Learning , vol.5 , pp. 71-99
    • Pagallo, G.1    Haussler, D.2
  • 18
    • 0002715112 scopus 로고    scopus 로고
    • A probabilistic approach to feature selection - A filter solution
    • edited by L. Saitta, Morgan Kaufmann Publishers
    • H. Liu and R. Setiono, "A probabilistic approach to feature selection - a filter solution," in Proceedings of International Conference on Machine Learning (ICML-96), edited by L. Saitta, Morgan Kaufmann Publishers, 1996, pp. 319-327.
    • (1996) Proceedings of International Conference on Machine Learning (ICML-96) , pp. 319-327
    • Liu, H.1    Setiono, R.2
  • 24
    • 0003408496 scopus 로고    scopus 로고
    • Irvine, CA: University of California, Department of Information and Computer Science
    • C.J. Merz and P.M. Murphy, "UCI repository of machine learning databases," http://www.ics.uci.edu/~mlearn/ MLRepository.html. Irvine, CA: University of California, Department of Information and Computer Science, 1996.
    • (1996) UCI Repository of Machine Learning Databases
    • Merz, C.J.1    Murphy, P.M.2
  • 25
    • 0003539213 scopus 로고
    • The Monk's problems: A performance comparison of different learning algorithms
    • Carnegie Mellon University
    • S.B. Thrun et al., "The Monk's problems: A performance comparison of different learning algorithms," Technical Report CMU-CS-91-197, Carnegie Mellon University, 1991.
    • (1991) Technical Report CMU-CS-91-197
    • Thrun, S.B.1
  • 27
    • 0028447220 scopus 로고
    • Deliberation scheduling for problem solving in time-constrained environments
    • M. Boddy and T.L. Dean, "Deliberation scheduling for problem solving in time-constrained environments," Artificial Intelligence, vol. 67, no. 2, pp. 245-285, 1994.
    • (1994) Artificial Intelligence , vol.67 , Issue.2 , pp. 245-285
    • Boddy, M.1    Dean, T.L.2


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