arrow
返回

Dimensionality Reduction for Categorical Data

delete2023-04-01
delete6
delete
OA
AI
D
Debajyoti Bera *
R
Rameshwar Pratap
B
Bhisham Dev Verma
DOI:10.1109/TKDE.2021.3132373delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Categorical attributes are those that can take a discrete set of values, e.g., colours. This work is about compressing vectors over categorical attributes to low-dimension discrete vectors. The current hash-based methods compressing vectors over categorical attributes to low-dimension discrete vectors do not provide any guarantee on the Hamming distances between the compressed representations. Here we present FSketch to create sketches for a sparse categorical data and an estimator to estimate the pairwise Hamming distances among the uncompressed data only from their sketches. We claim that these sketches can be used in the usual data mining tasks in place of the original data without compromising the quality of the task. For that we ensure that the sketches also are categorical, sparse, and the Hamming distance estimates are reasonably precise. Both the sketch construction and the Hamming distance estimation algorithms require just a single-pass; furthermore, changes to a data point can be incorporated into its sketch in an efficient manner. The compressibility depends upon how sparse the data is and is independent of the original dimension - making our algorithm attractive for many real-life scenarios. Our claims are backed by rigorous theoretical analysis of the properties of FSketch and supplemented by extensive comparative evaluations with related algorithms on some real-world datasets. We show that FSketch is significantly faster, and the accuracy obtained by using its sketches are among the top for the standard unsupervised tasks of RMSE, clustering and similarity search.
Keyword:
Encoding
Dimensionality reduction
Task analysis
Hamming distance
Standards
Tools
Machine learning algorithms
sketching
feature hashing
clustering
classification
similarity search

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.8K
被引数:
3.2W

机构

I
indian institute of technology system (iit system)
学者数:
9.5W
论文数: 9.9W
被引数: 93
I
Indraprastha Institute of Information Technology Delhi
学者数:
933
论文数: 689
被引数: 558
引用论文

引用论文

Effective Data-Aware Covariance Estimator From Compressed Data
err2020-01-01
err2
errOAAI
errChen, Xixian; Yang, Haiqin; Zhao, Shenglin; Lyu, Michael R.; King, Irwin
err分享
err收藏
err分享
err收藏
Gender ratio in dyslexia阅读障碍的性别比例
err1998-12-01
err0
PREAI
errT. R. Miles; M. N. Haslum; T. J. Wheeler
err分享
err收藏
Potential Negative Consequences of Adding Phosphorus‐Based Fertilizers to Immobilize Lead in Soil
err2008-09-01
err0
PREAI
errDouglas W. Kilgour; Rebecca B. Moseley; Mark O. Barnett; Kaye S. Savage; Philip M. Jardine
err分享
err收藏
学者 查看更多内容