메뉴 건너뛰기




Volumn 28, Issue 10, 2015, Pages 123-128

A randomized approximation convex hull algorith m for high dimensions

Author keywords

Classification; Convex hull; Data selection problem; Neural networks; Regression; Support vector machines

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY; DATA REDUCTION; EMBEDDED SYSTEMS; NEURAL NETWORKS; SUPPORT VECTOR MACHINES; SUPPORT VECTOR REGRESSION;

EID: 84992504864     PISSN: None     EISSN: 24058963     Source Type: Conference Proceeding    
DOI: 10.1016/j.ifacol.2015.08.119     Document Type: Conference Paper
Times cited : (14)

References (16)
  • 3
    • 0019898255 scopus 로고
    • Approximation algorithms for convex hulls
    • BENTLEY, J. L., PREPARATA, F. P. & FAUST, M. G. 1982. Approximation algorithms for convex hulls. Commun. ACM, 25, 64-68.
    • (1982) Commun. ACM , vol.25 , pp. 64-68
    • Bentley, J.L.1    Preparata, F.P.2    Faust, M.G.3
  • 4
    • 0001702902 scopus 로고
    • Applications of random sampling in computational geometry. 2
    • CLARKSON, K. L. & SHOR, P. W. 1989. APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY. 2. Discrete & Computational Geometry, 4, 387-421.
    • (1989) Discrete & Computational Geometry , vol.4 , pp. 387-421
    • Clarkson, K.L.1    Shor, P.W.2
  • 7
    • 49649136358 scopus 로고
    • An efficient algorithm for determining the convex hull of a finite planar set
    • GRAHAM, R. L. 1972. An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set Inf. Process. Lett., 1 , 2.
    • (1972) Inf. Process. Lett. , vol.1 , pp. 2
    • Graham, R.L.1
  • 9
    • 84876326000 scopus 로고    scopus 로고
    • Large data sets classification using convex-concave hull and support vector machine
    • LOPEZ CHAU, A., LI, X. & YU, W. 2013. Large data sets classification using convex-concave hull and support vector machine. Soft Computing, 17, 793-804.
    • (2013) Soft Computing , vol.17 , pp. 793-804
    • Lopez Chau, A.1    Li, X.2    Yu, W.3
  • 13
    • 0012472541 scopus 로고
    • The upper bound theorem for polytopes - An easy proof of its asymptotic version
    • SEIDEL, R. 1995. THE UPPER BOUND THEOREM FOR POLYTOPES - AN EASY PROOF OF ITS ASYMPTOTIC VERSION. Computational Geometry-Theory and Applications, 5, 115-116.
    • (1995) Computational Geometry-Theory and Applications , vol.5 , pp. 115-116
    • Seidel, R.1
  • 15
    • 33646474181 scopus 로고    scopus 로고
    • [Online]. MathWorld - A Wolfram Web Resource
    • WEISSTEIN, E. W. 2014a. Plane [Online]. MathWorld - A Wolfram Web Resource. Available: http://mathworld.wolfram.com/Plane.html.
    • (2014) Plane
    • Weisstein, E.W.1
  • 16
    • 84872041337 scopus 로고    scopus 로고
    • [Online]. MathWorld - A Wolfram Web Resource
    • WEISSTEIN, E. W. 2014b. Point-Plane Distance. [Online]. MathWorld - A Wolfram Web Resource. Available: http://mathworld.wolfram.com/Point-PlaneDistance.html.
    • (2014) Point-Plane Distance
    • Weisstein, E.W.1


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