SCOPUS 정보 검색 플랫폼

Volumn 24, Issue , 2005, Pages 331-358

Fast Algorithms for Classification Using Class Cover Catch Digraphs

a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 67649670115 PISSN: 01697161 EISSN: None Source Type: Book Series
DOI: 10.1016/S0169-7161(04)24012-3 Document Type: Review

Times cited : (4)

References (12)

1
- 0016557674
- Multidimensional binary search trees used for associative searches
- Bentley J.L. Multidimensional binary search trees used for associative searches. Comm. ACM 18 9 (1975) 509-517
- (1975) Comm. ACM , vol.18 , Issue.9 , pp. 509-517
- Bentley, J.L.¹

2
- 11944253901
- Cambridge University Press, Cambridge
- Bollobás B. Random Graphs (2001), Cambridge University Press, Cambridge
- (2001) Random Graphs
- Bollobás, B.¹

3
- 0000301097
- A greedy heuristic for the set-covering problem
- Chvatal V. A greedy heuristic for the set-covering problem. Math. Oper. Res. 4 3 (1979) 233-235
- (1979) Math. Oper. Res. , vol.4 , Issue.3 , pp. 233-235
- Chvatal, V.¹

4
- 84945709355
- An algorithm for finding best matches in logarithmic expected time
- Friedman J.H., Bentley J.L., and Finkel R.A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3 3 (1977) 209-226
- (1977) ACM Trans. Math. Softw. , vol.3 , Issue.3 , pp. 209-226
- Friedman, J.H.¹ Bentley, J.L.² Finkel, R.A.³

6
- 26944437593
- Wiley, Hoboken, NJ
- Marchette D.J. Random Graphs for Statistical Pattern Recognition (2004), Wiley, Hoboken, NJ
- (2004) Random Graphs for Statistical Pattern Recognition
- Marchette, D.J.¹

7
- 0037209410
- Characterizing the scale dimension of a high dimensional classification problem
- Marchette D.J., and Priebe C.E. Characterizing the scale dimension of a high dimensional classification problem. Pattern Recognition 36 (2003) 45-60
- (2003) Pattern Recognition , vol.36 , pp. 45-60
- Marchette, D.J.¹ Priebe, C.E.²

9
- 0026221865
- Analysis of a greedy heuristic for finding small dominating sets in graphs
- Parekh A.K. Analysis of a greedy heuristic for finding small dominating sets in graphs. Inform. Process. Lett. 39 (1991) 237-240
- (1991) Inform. Process. Lett. , vol.39 , pp. 237-240
- Parekh, A.K.¹

10
- 0037899011
- Classification using class cover catch digraphs
- Priebe C., Marchette D., Devinney J., and Socolinsky D. Classification using class cover catch digraphs. J. Classification (2003) 3-23
- (2003) J. Classification , pp. 3-23
- Priebe, C.¹ Marchette, D.² Devinney, J.³ Socolinsky, D.⁴

11
- 0010568432
- On the distribution of the domination number for random class cover catch digraphs
- Priebe C.E., DeVinney J.G., and Marchette D.J. On the distribution of the domination number for random class cover catch digraphs. Statist. Probab. Lett. 55 3 (2001) 239-246
- (2001) Statist. Probab. Lett. , vol.55 , Issue.3 , pp. 239-246
- Priebe, C.E.¹ DeVinney, J.G.² Marchette, D.J.³

12
- 67649673992
- Data compression by quantization
- Wegman E.J., and Khumbah N.-A. Data compression by quantization. Comput. Sci. Statist. 33 (2001). http://www.galaxy.gmu.edu/interface/I01/I2001Proceedings/EWegman/DataCompressionbyQuantization.pdf
- (2001) Comput. Sci. Statist. , vol.33
- Wegman, E.J.¹ Khumbah, N.-A.²

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