What is the Intrinsic Dimension of Your Binary Data?-and How to Compute it Quickly

被引:0
|
作者
Hanika, Tom [1 ]
Hille, Tobias [2 ,3 ]
机构
[1] Univ Hildesheim, Intelligent Informat Syst, Hildesheim, Germany
[2] Univ Kassel, Knowledge & Data Engn Grp, Kassel, Germany
[3] Univ Kassel, Interdisciplinary Res Ctr Informat Syst Design, Kassel, Germany
关键词
intrinsic dimension; high-dimensional data; binary data; extrinsic dimension;
D O I
10.1007/978-3-031-67868-4_7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Dimensionality is an important aspect for analyzing and understanding (high-dimensional) data. In their 2006 ICDM paper Tatti et al. answered the question for a (interpretable) dimension of binary data tables by introducing a normalized correlation dimension. In the present work we revisit their results and contrast them with a concept based notion of intrinsic dimension (ID) recently introduced for geometric data sets. To do this, we present a novel approximation for this ID that is based on computing concepts only up to a certain support value. We demonstrate and evaluate our approximation using all available datasets from Tatti et al., which have between 469 and 41271 extrinsic dimensions. (Source code and more figures are available at https://codeberg.org/thille/bd-gid).
引用
收藏
页码:97 / 112
页数:16
相关论文
共 50 条