메뉴 건너뛰기




Volumn 9, Issue 1, 2009, Pages 209-218

Similarity computing model of high dimension data for symptom classification of Chinese traditional medicine

Author keywords

Chinese traditional medicine; Data mining; Similarity computing; Symptom classification; Vector space

Indexed keywords

BOOLEAN FUNCTIONS; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; VECTORS;

EID: 53749097741     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2008.04.005     Document Type: Article
Times cited : (9)

References (23)
  • 3
    • 33645724205 scopus 로고    scopus 로고
    • Minimax-optimal classification with dyadic decision trees
    • Scott C., and Nowak R.D. Minimax-optimal classification with dyadic decision trees. IEEE Trans. Inf. Theory 52 April (4) (2006) 1335-1353
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.April 4 , pp. 1335-1353
    • Scott, C.1    Nowak, R.D.2
  • 4
    • 33749240206 scopus 로고    scopus 로고
    • Multi-class pattern classification using neural networks
    • Ou G., and Murphey Y.L. Multi-class pattern classification using neural networks. Pattern Recognit. 40 January (1) (2007) 4-18
    • (2007) Pattern Recognit. , vol.40 , Issue.January 1 , pp. 4-18
    • Ou, G.1    Murphey, Y.L.2
  • 5
    • 33750943823 scopus 로고    scopus 로고
    • Neural network classification of homomorphic segmented heart sounds
    • Gupta C.N., Palaniappan R., Swaminathan S., and Krishnan S.M. Neural network classification of homomorphic segmented heart sounds. Appl. Soft Comput. 7 January (1) (2007) 286-297
    • (2007) Appl. Soft Comput. , vol.7 , Issue.January 1 , pp. 286-297
    • Gupta, C.N.1    Palaniappan, R.2    Swaminathan, S.3    Krishnan, S.M.4
  • 7
    • 34047249450 scopus 로고    scopus 로고
    • Ensembling evidential k-nearest neighbor classifiers through multi-modal perturbation
    • Alti{dotless}nçay H. Ensembling evidential k-nearest neighbor classifiers through multi-modal perturbation. Appl. Soft Comput. 7 June (3) (2007) 1072-1083
    • (2007) Appl. Soft Comput. , vol.7 , Issue.June 3 , pp. 1072-1083
    • Altinçay, H.1
  • 8
    • 85008014387 scopus 로고    scopus 로고
    • Some effective techniques for Naive Bayes text classification
    • Kim S.B., Han K.S., Rim H.C., and Myaeng S.H. Some effective techniques for Naive Bayes text classification. IEEE Trans. Knowl. Data Eng. 18 November (11) (2006) 1457-1466
    • (2006) IEEE Trans. Knowl. Data Eng. , vol.18 , Issue.November 11 , pp. 1457-1466
    • Kim, S.B.1    Han, K.S.2    Rim, H.C.3    Myaeng, S.H.4
  • 9
    • 33644830072 scopus 로고    scopus 로고
    • Multisurface proximal support vector machine classification via generalized eigenvalues
    • Mangasarian O.L., and Wild E.W. Multisurface proximal support vector machine classification via generalized eigenvalues. IEEE Trans. Pattern Anal. Machine 28 January (1) (2006) 69-74
    • (2006) IEEE Trans. Pattern Anal. Machine , vol.28 , Issue.January 1 , pp. 69-74
    • Mangasarian, O.L.1    Wild, E.W.2
  • 10
    • 34047266673 scopus 로고    scopus 로고
    • Text classification: a least square support vector machine approach
    • Mitra V., Wang C.J., and Banerjee S. Text classification: a least square support vector machine approach. Appl. Soft Comput. 7 June (3) (2007) 908-914
    • (2007) Appl. Soft Comput. , vol.7 , Issue.June 3 , pp. 908-914
    • Mitra, V.1    Wang, C.J.2    Banerjee, S.3
  • 11
    • 0036360689 scopus 로고    scopus 로고
    • Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation, and nearest neighbor search
    • Aggarwal C. Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation, and nearest neighbor search. Proceedings of the ACM SIGMOD Conference (2002) 452-463
    • (2002) Proceedings of the ACM SIGMOD Conference , pp. 452-463
    • Aggarwal, C.1
  • 18
    • 33746412073 scopus 로고    scopus 로고
    • Learning weighted metrics to minimize nearest-neighbor classification error
    • Paredes R., and Vidal E. Learning weighted metrics to minimize nearest-neighbor classification error. IEEE Trans. Pattern Anal. Machine 28 July (7) (2006) 1100-1110
    • (2006) IEEE Trans. Pattern Anal. Machine , vol.28 , Issue.July 7 , pp. 1100-1110
    • Paredes, R.1    Vidal, E.2
  • 20
    • 0037492265 scopus 로고    scopus 로고
    • Efficient search for approximate nearest neighbor in high dimensional spaces
    • Kushilevitz E., Ostrovsky R., and Rabani Y. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30 2 (2000) 451-474
    • (2000) SIAM J. Comput. , vol.30 , Issue.2 , pp. 451-474
    • Kushilevitz, E.1    Ostrovsky, R.2    Rabani, Y.3
  • 21
    • 84945709831 scopus 로고
    • Algorithm 97: shortest path
    • Floyd RobertW. Algorithm 97: shortest path. Commun. ACM 5 June (6) (1962) 345
    • (1962) Commun. ACM , vol.5 , Issue.June 6 , pp. 345
    • Floyd, RobertW.1


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