High-dimensional Density Estimation for Data Mining Tasks

被引:3
作者
Kuleshov, Alexander [1 ]
Bernstein, Alexander [1 ,2 ]
Yanovich, Yury [2 ]
机构
[1] Skolkovo Inst Sci & Technol, Moscow, Russia
[2] RAS, Kharkevich Inst Informat Transmiss Problems, Moscow, Russia
来源
2017 17TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW 2017) | 2017年
基金
俄罗斯科学基金会;
关键词
High-dimensional manifold valued data; Density on manifold estimation; Dimensionality Reduction; Density on feature space estimation; Manifold learning; PROBABILITY DENSITY; MANIFOLDS; REDUCTION;
D O I
10.1109/ICDMW.2017.74
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Consider a problem of estimating an unknown high dimensional density whose support lies on unknown low-dimensional data manifold. This problem arises in many data mining tasks, and the paper proposes a new geometrically motivated solution for the problem in manifold learning framework, including an estimation of an unknown support of the density. Firstly, tangent bundle manifold learning problem is solved resulting in transforming high dimensional data into their low-dimensional features and estimating the Riemannian tensor on the Data manifold. After that, an unknown density of the constructed features is estimated with the use of appropriate kernel approach. Finally, with the use of estimated Riemannian tensor, the final estimator of the initial density is constructed.
引用
收藏
页码:523 / 530
页数:8
相关论文
共 56 条
[1]  
[Anonymous], ARXIV12126031V1CSLG
[2]  
[Anonymous], ARXIV12081065V2STATC
[3]  
[Anonymous], 2004, Advances in neural information processing systems, DOI DOI 10.5555/2976040.2976138
[4]  
[Anonymous], 2015, Data mining: the textbook
[5]  
[Anonymous], 2015, GLARMA PACKAGE
[6]  
[Anonymous], 1996, MATRIX COMPUTATION
[7]  
[Anonymous], 2013, ALIEN CITIES CONSUMP
[8]  
[Anonymous], 2012, HDB COMPUTATIONAL ST
[9]  
[Anonymous], 2009, Manifolds and differential geometry
[10]  
[Anonymous], 2013, INT J SOFTW INF