loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Patrick G. Clark 1 and Jerzy W. Grzymala-Busse 2

Affiliations: 1 University of Kansas, United States ; 2 University of Kansas and University of Information Technology and Management, United States

ISBN: 978-989-758-035-2

Keyword(s): Data Mining, Rough Set Theory, Probabilistic Approximations, MLEM2 Rule Induction Algorithm, Attribute-concept Values, "Do Not Care" Conditions.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Biomedical Engineering ; Business Analytics ; Cardiovascular Technologies ; Computing and Telecommunications in Cardiology ; Data Analytics ; Data Engineering ; Data Mining ; Databases and Information Systems Integration ; Datamining ; Decision Support Systems ; Decision Support Systems, Remote Data Analysis ; Enterprise Information Systems ; Health Engineering and Technology Applications ; Health Information Systems ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Sensor Networks ; Signal Processing ; Soft Computing ; Symbolic Systems

Abstract: In this paper we study the complexity of rule sets induced from incomplete data sets with two interpretations of missing attribute values: attribute-concept values and “do not care” conditions. Experiments are conducted on 176 data sets, using three kinds of probabilistic approximations (lower, middle and upper) and the MLEM2 rule induction system. The goal of our research is to determine the interpretation and approximation that produces the least complex rule sets. In our experiment results, the size of the rule set is smaller for attribute-concept values for 12 combinations of the type of data set and approximation, for one combination the size of the rule sets is smaller for “do not care” conditions and for the remaining 11 combinations the difference in performance is statistically insignificant (5% significance level). The total number of conditions is smaller for attribute-concept values for ten combinations, for two combinations the total number of conditions is smal ler for “do not care” conditions, while for the remaining 12 combinations the difference in performance is statistically insignificant. Thus, we may claim that attribute-concept values are better than “do not care” conditions in terms of rule complexity. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 100.26.182.28

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Clark, P. and Grzymala-Busse, J. (2014). Complexity of Rule Sets Induced from Incomplete Data with Attribute-concept Values and "Do Not Care" Conditions.In Proceedings of 3rd International Conference on Data Management Technologies and Applications - Volume 1: DATA, ISBN 978-989-758-035-2, pages 56-63. DOI: 10.5220/0005003400560063

@conference{data14,
author={Patrick G. Clark. and Jerzy W. Grzymala{-}Busse.},
title={Complexity of Rule Sets Induced from Incomplete Data with Attribute-concept Values and "Do Not Care" Conditions},
booktitle={Proceedings of 3rd International Conference on Data Management Technologies and Applications - Volume 1: DATA,},
year={2014},
pages={56-63},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005003400560063},
isbn={978-989-758-035-2},
}

TY - CONF

JO - Proceedings of 3rd International Conference on Data Management Technologies and Applications - Volume 1: DATA,
TI - Complexity of Rule Sets Induced from Incomplete Data with Attribute-concept Values and "Do Not Care" Conditions
SN - 978-989-758-035-2
AU - Clark, P.
AU - Grzymala-Busse, J.
PY - 2014
SP - 56
EP - 63
DO - 10.5220/0005003400560063

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.