Creating Level Set Trees Using One-Class Support Vector Machines 


Vol. 42,  No. 1, pp. 86-92, Jan.  2015


PDF

  Abstract

A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.


  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

G. Lee, "Creating Level Set Trees Using One-Class Support Vector Machines," Journal of KIISE, JOK, vol. 42, no. 1, pp. 86-92, 2015. DOI: .


[ACM Style]

Gyemin Lee. 2015. Creating Level Set Trees Using One-Class Support Vector Machines. Journal of KIISE, JOK, 42, 1, (2015), 86-92. DOI: .


[KCI Style]

Gyemin Lee, "Creating Level Set Trees Using One-Class Support Vector Machines," 한국정보과학회 논문지, 제42권, 제1호, 86~92쪽, 2015. DOI: .


[Endnote/Zotero/Mendeley (RIS)]  Download


[BibTeX]  Download



Search




Journal of KIISE

  • ISSN : 2383-630X(Print)
  • ISSN : 2383-6296(Electronic)
  • KCI Accredited Journal

Editorial Office

  • Tel. +82-2-588-9240
  • Fax. +82-2-521-1352
  • E-mail. chwoo@kiise.or.kr