Clustering Categorical Data Based on Distance Vectors
基于距离向量的分类数据聚类AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：分类数据聚类不等同于离散选择模型，摘要没有所列细分的充分依据。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
基于距离向量的分类数据聚类
- 研究问题
- 如何对分类数据自动识别簇及其数量，并避免逐轮更新全部观测的类别归属，同时考察结果对输入顺序的敏感性？
- 方法与思路
- 作者基于Hamming距离向量和Pearson卡方型统计量定位簇中心，每轮提取并移除一个簇，直至剩余数据无显著簇。
- 材料陈述的贡献
- 摘要称算法自动确定簇数，划分唯一且不受输入顺序影响，并报告在所用模拟和真实数据中优于两个比较算法。
- 阅读关注点
- 应核对显著簇判定、停止规则与唯一性依据，并审查性能指标、比较算法设置及复杂度和运行时间的计算条件。
- 阅读边界
- 仅据OpenAlex索引摘要，稿件版本未注明；数据与数值未提供，所称数量级改善仅是作者陈述，不能推断普遍优势。
原文摘要
We introduce a novel statistical procedure for clustering categorical data based on Hamming distance (HD) vectors. The proposed method is conceptually simple and computationally straightforward, because it does not require any specific statistical models or any convergence criteria. Moreover, unlike most currently existing algorithms that compute the class membership or membership probability for every data point at each iteration, our algorithm sequentially extracts clusters from the given dataset. That is, at each iteration our algorithm strives to identify only one cluster, which will then be deleted from the dataset at the next iteration; this procedure repeats until there are no more significant clusters in the remaining data. Consequently, the number of clusters can be determined automatically by the algorithm. As for the identification and extraction of a cluster, we first locate the cluster center by using a Pearson chi-squared–type statistic on the basis of HD vectors. The partition of the dataset produced by our algorithm is unique and insensitive to the input order of data points. The performance of the proposed algorithm is examined using both simulated and real world datasets. Comparisons with two well-known clustering algorithms, K-modes and AutoClass, show that the proposed algorithm substantially outperforms these competitors, with the classification rate or the information gain typically improved by several orders of magnitude. Computational complexity and run time comparisons are also provided.