SCOPUS 정보 검색 플랫폼

Volumn 41, Issue 8, 2008, Pages 2665-2673

A 'No Panacea Theorem' for classifier combination

Author keywords

'No Free Lunch' theorems; Gaussian mixtures; Probability density functions

Indexed keywords

COMPUTATIONAL METHODS; GAUSSIAN DISTRIBUTION; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING;

CLASSIFIER COMBINATION; GAUSSIAN MIXTURES;

THEOREM PROVING;

EID: 42749086845 PISSN: 00313203 EISSN: None Source Type: Journal
DOI: 10.1016/j.patcog.2008.01.022 Document Type: Article

Times cited : (16)

References (13)

1
- 0001942829
- Neural networks and the bias/variance dilemma
- Geman S., Bienenstock E., and Doursat R. Neural networks and the bias/variance dilemma. Neural Comput. 4 1 (1992) 1-58
- (1992) Neural Comput. , vol.4 , Issue.1 , pp. 1-58
- Geman, S.¹ Bienenstock, E.² Doursat, R.³

2
- 0030085913
- Analysis of decision boundaries in linearly combined neural classifiers
- Tumer K., and Ghosh J. Analysis of decision boundaries in linearly combined neural classifiers. Pattern Recognition 29 2 (1996) 341-348
- (1996) Pattern Recognition , vol.29 , Issue.2 , pp. 341-348
- Tumer, K.¹ Ghosh, J.²

3
- 0032021555
- On combining classifiers
- Kittler J., Hatef M., Duin R.P.W., and Matas J. On combining classifiers. IEEE Trans. Pattern Anal. Mach. Intell. 20 3 (1998) 226-239
- (1998) IEEE Trans. Pattern Anal. Mach. Intell. , vol.20 , Issue.3 , pp. 226-239
- Kittler, J.¹ Hatef, M.² Duin, R.P.W.³ Matas, J.⁴

4
- 14644422971
- Wiley, Hoboken, NJ
- Kuncheva L.I. Combining Pattern Classifiers-Methods and Algorithms (2004), Wiley, Hoboken, NJ
- (2004) Combining Pattern Classifiers-Methods and Algorithms
- Kuncheva, L.I.¹

5
- 42749093344
- D.H. Wolpert, W.G. Macready, No free lunch theorems for search, Technical Report SFI-TR-95-02-010, Santa Fe Institute, Santa Fe, NM, 1995.
- D.H. Wolpert, W.G. Macready, No free lunch theorems for search, Technical Report SFI-TR-95-02-010, Santa Fe Institute, Santa Fe, NM, 1995.

6
- 0031118203
- No free lunch theorems for optimization
- Wolpert D.H., and Macready W.G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1 1 (1997) 67-82
- (1997) IEEE Trans. Evol. Comput. , vol.1 , Issue.1 , pp. 67-82
- Wolpert, D.H.¹ Macready, W.G.²

7
- 42749083329
- D.H. Wolpert, The supervised learning no-free-lunch theorems, Technical Report MS 269-01, NASA Ames Research Center, Moffett Field, CA, 2001.
- D.H. Wolpert, The supervised learning no-free-lunch theorems, Technical Report MS 269-01, NASA Ames Research Center, Moffett Field, CA, 2001.

9
- 0032663729
- Lower bound for Bayes error estimation
- Antos A., Devroye L., and Györfi L. Lower bound for Bayes error estimation. IEEE Trans. Pattern Anal. Mach. Intell. 20 7 (1999) 643-645
- (1999) IEEE Trans. Pattern Anal. Mach. Intell. , vol.20 , Issue.7 , pp. 643-645
- Antos, A.¹ Devroye, L.² Györfi, L.³

10
- 25944454000
- Clarendon Press, Oxford, UK
- Grimmett G.R., and Stirzaker D.R. Probability and Random Process (1992), Clarendon Press, Oxford, UK
- (1992) Probability and Random Process
- Grimmett, G.R.¹ Stirzaker, D.R.²

11
- 34047223581
- R. Hu, R.I. Damper, A 'No Panacea Theorem' for multiple classifier combination, in: Proceedings of the 18th International Conference on Pattern Recognition, Hong Kong, China, 2006, pp. 1250-1253.
- R. Hu, R.I. Damper, A 'No Panacea Theorem' for multiple classifier combination, in: Proceedings of the 18th International Conference on Pattern Recognition, Hong Kong, China, 2006, pp. 1250-1253.

12
- 0004063133
- Prentice-Hall, Englewood Cliffs, NJ
- Wilson S.G. Digital Modulation and Coding (1996), Prentice-Hall, Englewood Cliffs, NJ
- (1996) Digital Modulation and Coding
- Wilson, S.G.¹

13
- 0004082156
- McGraw-Hill, New York, NY
- Proakis J. Digital Communications (2001), McGraw-Hill, New York, NY
- (2001) Digital Communications
- Proakis, J.¹

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