journal article·2023Open access

Multi-Attribute Couplings-Based Euclidean and Nominal Distances for Unlabeled Nominal Data

Lei Gu, Furong Zhang, Li Ma

Computers, Materials & Continua· Volume 75· Issue 3

Abstract

Learning unlabeled data is a significant challenge that needs to handle complicated relationships between nominal values and attributes. Increasingly, recent research on learning value relations within and between attributes has shown significant improvement in clustering and outlier detection, etc. However, typical existing work relies on learning pairwise value relations but weakens or overlooks the direct couplings between multiple attributes. This paper thus proposes two novel and flexible multi-attribute couplings-based distance (MCD) metrics, which learn the multi-attribute couplings and their strengths in nominal data based on information theories: self-information, entropy, and mutual information, for measuring both numerical and nominal distances. MCD enables the application of numerical and nominal clustering methods on nominal data and quantifies the influence of involving and filtering multi-attribute couplings on distance learning and clustering performance. Substantial experiments evidence the above conclusions on 15 data sets against seven state-of-the-art distance measures with various feature selection methods for both numerical and nominal clustering.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Advanced Clustering Algorithms Research · Face and Expression Recognition · Rough Sets and Fuzzy Logic

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (32)

Show source-provided references
1. Agresti · Wiley Series in Probability and Statistics · 200710.1002/0470114754 ↗
2. Couping learning of complex interactions10.1016/j.ipm.2014.08.007 ↗
3. Non-iidness learning in behavioral and social data10.1093/comjnl/bxt084 ↗
4. Bock · Studies in Classification, Data Analysis, and Knowledge Organization · 200010.1007/978-3-642-57155-8 ↗
5. A dissimilarity measure for the k-modes clustering algorithm10.1016/j.knosys.2011.07.011 ↗
6. A new distance metric for unsupervised learning of categorical data
7. Unsupervised coupled metric similarity for non-iid categorical data10.1109/TKDE.2018.2808532 ↗
8. Extensions to the k-means algorithm for clustering large data sets with categorical values10.1023/A:1009769707641 ↗
9. Transformation of nominal features into numeric in supervised multiclass problems based on the weight of evidence parameter
10. Berry · Survey of Text Mining: Clustering, Classification, and Retrieval · 2003
11. Cure: Flexible categorical data representation by hierarchical coupling learning10.1109/TKDE.2018.2848902 ↗
12. Coupled fuzzy k-nearest neighbors classification of imbalanced non-iid categorical data
13. Coupled attribute analysis on numerical data
14. Metric-based auto-instructor for learning mixed data representation
15. Sparse modeling-based sequential ensemble learning for effective outlier detection in high-dimensional numeric data
16. Document similarity analysis via involving both explicit and implicit semantic couplings
17. Vine copula-based asymmetry and tail dependence modeling
18. Coupled behavior analysis for capturing coupling relationships in group-based market manipulations
19. Proakis · Upper Saddle River · 2001
20. Categorical data clustering: Hat similarity measure to recommend?10.1016/j.eswa.2014.09.012 ↗
21. A method to compute distance between wo categorical values of same attribute in unsupervised learning or categorical data set10.1016/j.patrec.2006.06.006 ↗
22. An association-based dissimilarity measure or categorical data10.1016/j.patrec.2005.06.002 ↗
23. From context to distance: Learning dissimilarity for categorical data clustering10.1145/2133360.2133361 ↗
24. Coupled nominal similarity in unsupervised learning
25. Coupled attribute similarity learning on categorical data
26. Manning · Introduction to information retrieval · 200810.1017/CBO9780511809071 ↗
27. Minimum redundancy feature selection from microarray gene expression data
28. Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy
29. UCI Machine Learning Repository. 2007. [Online]. Available: https://archive.ics.uci.edu/ml/index.php
30. A survey of kernel and spectral methods for clustering10.1016/j.patcog.2007.05.018 ↗
31. Survey of clustering algorithms10.1109/TNN.2005.845141 ↗
32. Embedding-based representation of categorical data by hierarchical value coupling learning