메뉴 건너뛰기




Volumn , Issue , 1995, Pages 45-51

Rapid Quality Estimation of Neural Network Input Representations

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK INPUTS; NETWORK REPRESENTATION; NEURAL-NETWORKS; PATTERN RECOGNITION PROBLEMS; QUALITY ESTIMATION; QUALITY MEASURES; REAL-WORLD;

EID: 17444401278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (16)
  • 1
    • 0028496468 scopus 로고
    • Learning Boolean concepts in the presence of many irrelevant features
    • Almuallim, H. & Dietterich, T. (1994). Learning Boolean concepts in the presence of many irrelevant features. Artificial Intelligence, 69 (1-2):279-305.
    • (1994) Artificial Intelligence , vol.69 , Issue.1-2 , pp. 279-305
    • Almuallim, H.1    Dietterich, T.2
  • 3
    • 0028468293 scopus 로고
    • Using mutual information for selecting features in supervised neural net learning
    • Battiti, R. (1994). Using mutual information for selecting features in supervised neural net learning. IEEE Transactions on Neural Networks, 5 (4):537-550.
    • (1994) IEEE Transactions on Neural Networks , vol.5 , Issue.4 , pp. 537-550
    • Battiti, R.1
  • 5
    • 0006500676 scopus 로고
    • Greedy attribute selection
    • New Brunswick, NJ. Morgan Kaufmann
    • Caruana, R. & Freitag, D. (1994). Greedy attribute selection. In Machine Learning: Proc 11th Intl Conf, (pp. 28-36), New Brunswick, NJ. Morgan Kaufmann.
    • (1994) Machine Learning: Proc 11th Intl Conf , pp. 28-36
    • Caruana, R.1    Freitag, D.2
  • 6
    • 0006477520 scopus 로고
    • Selecting salient features for machine learning from large candidate pools through parallel decision-tree construction
    • Kitano, H. & Hendler, J., eds., MIT Press, Cambridge, MA
    • Cherkauer, K. & Shavlik, J. (1994). Selecting salient features for machine learning from large candidate pools through parallel decision-tree construction. In Kitano, H. & Hendler, J., eds., Massively Parallel Artificial Intel. MIT Press, Cambridge, MA.
    • (1994) Massively Parallel Artificial Intel
    • Cherkauer, K.1    Shavlik, J.2
  • 8
    • 84968814721 scopus 로고
    • Learning to predict reading frames in E. coli DNA sequences
    • Wailea, HI. IEEE Computer Society Press
    • Craven, M. & Shavlik, J. (1993). Learning to predict reading frames in E. coli DNA sequences. In Proc 26th Hawaii Intl Conf on System Science, (pp. 773-782), Wailea, HI. IEEE Computer Society Press.
    • (1993) Proc 26th Hawaii Intl Conf on System Science , pp. 773-782
    • Craven, M.1    Shavlik, J.2
  • 9
    • 0028579416 scopus 로고
    • Branching on attribute values in decision tree generation
    • Seattle, WA. AAAI/MIT Press
    • Fayyad, U. (1994). Branching on attribute values in decision tree generation. In Proc 12th Natl Conf on Artificial Intel, (pp. 601-606), Seattle, WA. AAAI/MIT Press.
    • (1994) Proc 12th Natl Conf on Artificial Intel , pp. 601-606
    • Fayyad, U.1
  • 10
    • 85099325734 scopus 로고
    • Irrelevant features and the subset selection problem
    • New Brunswick, NJ. Morgan Kaufmann
    • John, G., Kohavi, R., & Pfleger, K. (1994). Irrelevant features and the subset selection problem. In Machine Learning: Proc 11th Intl Conf, (pp. 121-129), New Brunswick, NJ. Morgan Kaufmann.
    • (1994) Machine Learning: Proc 11th Intl Conf , pp. 121-129
    • John, G.1    Kohavi, R.2    Pfleger, K.3
  • 11
    • 0003317812 scopus 로고
    • Fast non-linear dimension reduction
    • San Francisco, CA. Morgan Kaufmann
    • Kambhatla, N. & Leen, T. (1994). Fast non-linear dimension reduction. In Advances in Neural Info Processing Sys (vol 6), (pp. 152-159), San Francisco, CA. Morgan Kaufmann.
    • (1994) Advances in Neural Info Processing Sys , vol.6 , pp. 152-159
    • Kambhatla, N.1    Leen, T.2
  • 12
    • 0027002164 scopus 로고
    • The feature selection problem: Traditional methods and a new algorithm
    • San Jose, CA. AAAI/MIT Press
    • Kira, K. & Rendell, L. (1992). The feature selection problem: Traditional methods and a new algorithm. In Proc 10th Natl Conf on Artificial Intel, (pp. 129-134), San Jose, CA. AAAI/MIT Press.
    • (1992) Proc 10th Natl Conf on Artificial Intel , pp. 129-134
    • Kira, K.1    Rendell, L.2
  • 13
    • 33744584654 scopus 로고
    • Induction of decision trees
    • Quinlan, J. (1986). Induction of decision trees. Machine Learning, 1:81-106.
    • (1986) Machine Learning , vol.1 , pp. 81-106
    • Quinlan, J.1
  • 15
    • 0002875106 scopus 로고
    • Improving the design of induction methods by analyzing algorithm functionality and data-based concept complexity
    • Chambéry, France. Morgan Kaufmann
    • Rendell, L. & Ragavan, H. (1993). Improving the design of induction methods by analyzing algorithm functionality and data-based concept complexity. In Proc 13th Intl Joint Conf on Artificial Intel, (pp. 952-958), Chambéry, France. Morgan Kaufmann.
    • (1993) Proc 13th Intl Joint Conf on Artificial Intel , pp. 952-958
    • Rendell, L.1    Ragavan, H.2
  • 16
    • 84901616862 scopus 로고
    • Online learning with random representations
    • Amherst, MA. Morgan Kaufmann
    • Sutton, R. & Whitehead, S. (1993). Online learning with random representations. In Machine Learning: Proc 10th Intl Conf, (pp. 314-321), Amherst, MA. Morgan Kaufmann.
    • (1993) Machine Learning: Proc 10th Intl Conf , pp. 314-321
    • Sutton, R.1    Whitehead, S.2


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