Log In Sign Up

Clustering and Classification with Non-Existence Attributes: A Sentenced Discrepancy Measure Based Technique

by   Y. A. Joarder, et al.

For some or all of the data instances a number of independent-world clustering issues suffer from incomplete data characterization due to losing or absent attributes. Typical clustering approaches cannot be applied directly to such data unless pre-processing by techniques like imputation or marginalization. We have overcome this drawback by utilizing a Sentenced Discrepancy Measure which we refer to as the Attribute Weighted Penalty based Discrepancy (AWPD). Using the AWPD measure, we modified the K-MEANS++ and Scalable K-MEANS++ for clustering algorithm and k Nearest Neighbor (kNN) for classification so as to make them directly applicable to datasets with non-existence attributes. We have presented a detailed theoretical analysis which shows that the new AWPD based K-MEANS++, Scalable K-MEANS++ and kNN algorithm merge into a local prime among the number of iterations is finite. We have reported in depth experiments on numerous benchmark datasets for various forms of Non-Existence showing that the projected clustering and classification techniques usually show better results in comparison to some of the renowned imputation methods that are generally used to process such insufficient data. This technique is designed to trace invaluable data to: directly apply our method on the datasets which have Non-Existence attributes and establish a method for detecting unstructured Non-Existence attributes with the best accuracy rate and minimum cost.


page 1

page 2

page 3

page 4


Missing Data Imputation for Classification Problems

Imputation of missing data is a common application in various classifica...

Nearest neighbor ratio imputation with incomplete multi-nomial outcome in survey sampling

Nonresponse is a common problem in survey sampling. Appropriate treatmen...

Using MM principles to deal with incomplete data in K-means clustering

Among many clustering algorithms, the K-means clustering algorithm is wi...

On the Existence of Kernel Function for Kernel-Trick of k-Means

This paper corrects the proof of the Theorem 2 from the Gower's paper [p...

Robust and Efficient Fuzzy C-Means Clustering Constrained on Flexible Sparsity

Clustering is an effective technique in data mining to group a set of ob...

Spatial Transformer K-Means

K-means defines one of the most employed centroid-based clustering algor...