Introducing Partial Matching Approach in Association Rules for Better Treatment of Missing Values

Simple item page
dc.creatorBashir, Shariq
dc.creatorRazzaq, Saad
dc.creatorMaqbool, Umer
dc.creatorTahir, Sonya
dc.creatorBaig, Abdul Rauf
dc.date2009-04-21
dc.date.accessioned2026-07-07T13:06:56Z
dc.date.available2026-07-07T13:06:56Z
dc.descriptionHandling missing values in training datasets for constructing learning models or extracting useful information is considered to be an important research task in data mining and knowledge discovery in databases. In recent years, lot of techniques are proposed for imputing missing values by considering attribute relationships with missing value observation and other observations of training dataset. The main deficiency of such techniques is that, they depend upon single approach and do not combine multiple approaches, that why they are less accurate. To improve the accuracy of missing values imputation, in this paper we introduce a novel partial matching concept in association rules mining, which shows better results as compared to full matching concept that we described in our previous work. Our imputation technique combines the partial matching concept in association rules with k-nearest neighbor approach. Since this is a hybrid technique, therefore its accuracy is much better than as compared to those techniques which depend upon single approach. To check the efficiency of our technique, we also provide detail experimental results on number of benchmark datasets which show better results as compared to previous approaches.
dc.identifierhttps://arxiv.org/abs/0904.3321
dc.identifierhttp://arxiv.org/abs/0904.3321
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227938
dc.subjectDatabases
dc.subjectArtificial Intelligence
dc.subjectData Structures and Algorithms
dc.titleIntroducing Partial Matching Approach in Association Rules for Better Treatment of Missing Values
dc.typetext

Files

Collections

arXiv