Hidden Inverted Specific-Class Distance Measure for Nominal Attributes

The inverted specific-class distance measure (ISCDM) is a popular distance metric that uses conditional probability term to calculate the distance between two nominal attribute values, but the reliability of the conditional probability term is limited by the attribute independence assumption, which leads to the suboptimal performance in applications involving sophisticated attribute dependencies. To obtain more accurate conditional probability estimation, in this study, we derive an enhanced ISCDM by leveraging structure extension to alleviate the unrealistic attribute assumption. We denominate the resulting model as the hidden inverted specific-class distance measure (HISCDM). In HISCDM, the structure extension scheme of hidden naive bayes is adopted to find the weighted dependence relationships between attributes, and then is incorporated into the conditional probability estimation. The comprehensive experimental results demonstrate that our proposed HISCDM significantly outperforms all other methods used for comparison in terms of classification accuracy.

• Publication year

  2025

• Venue

  ACM Transactions on Knowledge Discovery from Data

• Publication date

  2025-09-25

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/3769293
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Deep hashing image retrieval based on hybrid neural network and optimized metric learning

  2024cited by this paper
• Effective Methods of Categorical Data Encoding for Artificial Intelligence Algorithms

  2024cited by this paper
• A linear transportation Lp distance for pattern recognition

  2023cited by this paper
• Using differential evolution for an attribute-weighted inverted specific-class distance measure for nominal attributes

  2022cited by this paper
• Autoencoder-based deep metric learning for network intrusion detection

  2021cited by this paper
• Radial Basis Functions

  2021cited by this paper
• A Deep-Learned Embedding Technique for Categorical Features Encoding

  2021cited by this paper
• Fine-grained attribute weighted inverted specific-class distance measure for nominal attributes

  2021cited by this paper
• Gain ratio weighted inverted specific-class distance measure for nominal attributes

  2020cited by this paper
• Finding Multiple Roots of Nonlinear Equation Systems via a Repulsion-Based Adaptive Differential Evolution

  2020cited by this paper
• Class-specific attribute value weighting for Naive Bayes

  2020cited by this paper
• Effective metric learning with co-occurrence embedding for collaborative recommendations

  2020cited by this paper
• A new locally adaptive k-nearest neighbor algorithm based on discrimination class

  2020cited by this paper
• A neighborhood rough set model with nominal metric embedding

  2020cited by this paper
• CURE: Flexible Categorical Data Representation by Hierarchical Coupling Learning

  2019cited by this paper
• Class-specific attribute weighted naive Bayes

  2019cited by this paper
• Averaged one-dependence inverted specific-class distance measure for nominal attributes

  2019influential reference
• Using fine-tuned conditional probabilities for data transformation of nominal attributes

  2019cited by this paper
• A Correlation-Based Feature Weighting Filter for Naive Bayes

  2019cited by this paper
• Using differential evolution for improving distance measures of nominal values

  2018cited by this paper
• Two improved attribute weighting schemes for value difference metric

  2018cited by this paper
• Efficient kNN Classification With Different Numbers of Nearest Neighbors

  2018cited by this paper
• Toward value difference metric with attribute weighting

  2017cited by this paper
• Coupling learning of complex interactions

  2015cited by this paper
• Local value difference metric

  2014cited by this paper
• Data Mining Practical Machine Learning Tools and Techniques

  2014cited by this paper
• Selective Value Difference Metric

  2013cited by this paper
• Specific-class distance measures for nominal attributes

  2013cited by this paper
• Parameter extraction of solar cell models using repaired adaptive differential evolution

  2013cited by this paper
• Weighted average of one-dependence estimators†

  2012cited by this paper
• One Dependence Value Difference Metric

  2011cited by this paper
• KEEL Data-Mining Software Tool: Data Set Repository, Integration of Algorithms and Experimental Analysis Framework

  2011cited by this paper
• A Novel Bayes Model: Hidden Naive Bayes

  2009cited by this paper
• An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons

  2008cited by this paper
• Statistical Comparisons of Classifiers over Multiple Data Sets

  2006cited by this paper
• Not So Naive Bayes: Aggregating One-Dependence Estimators

  2005cited by this paper
• Instance-based learning algorithms

  2004cited by this paper
• Performance prediction of paging workloads using lightweight tracing

  2003cited by this paper
• Data Mining: Practical Machine Learning Tools and Techniques - Book Review

  2002cited by this paper
• Probability Based Metrics for Nearest Neighbor Classification and Case-Based Reasoning

  1999cited by this paper
• Self-Organizing Maps, Second Edition

  1997cited by this paper
• Bayesian Network Classifiers

  1997cited by this paper
• Discriminant Adaptive Nearest Neighbor Classification

  1995cited by this paper
• Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning

  1993cited by this paper
• The multi-class metric problem in nearest neighbour discrimination rules

  1990cited by this paper
• Toward memory-based reasoning

  1986cited by this paper
• Least squares quantization in PCM

  1982cited by this paper
• The optimal distance measure for nearest neighbor classification

  1981cited by this paper
• The Distance-Weighted k-Nearest-Neighbor Rule

  1976cited by this paper
• Approximating discrete probability distributions with dependence trees

  1968cited by this paper

• No citing papers are available for this paper.