Abstract
We present a strategy, together with its computational implementation, to intelligently analyze the internal structure of inductivelyderived data clusters in terms of symbolic cluster-defining rules. We present a symbolic rule extraction workbench that leverages rough sets theory to inductively extract CNF form symbolic rules from un-annotated continuous-valued data-vectors. Our workbench purports a hybrid rule extraction methodology, incorporating a sequence of methods to achieve data clustering, data discretization and eventually symbolic rule discovery via rough sets approximation. The featured symbolic rule extraction workbench will be tested and analyzed using biomedical datasets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal R., Gehrke J., Gunopulos D., Raghavan P.: Automatic subspace clustering of high dimensional data for data mining applications. Proc. ACM-SIGMOD Int. Conf. Management of Data, Seattle, Washington (1998)
Pawlak, Z.: Rough Sets. In: Lin T.Y., Cercone N.(eds.): Rough Sets and Data Mining: Analysis of Imprecise Data. Kluwer Academic Publishers, Dordrecht (1997)
Abidi, S.S.R., Goh, A., Hoe, K.M.: Specification of Healthcare Expert Systems Using a Multi-Mechanism Rule Extraction Pipeline. Proc. Int. ICSC Congress on Intelligent Systems and Applications, Sydney (2000)
Abidi, S.S.R., Hoe, K.M., Goh, A.: Healthcare Simulation Model Specification Featuring Multi-Stage Neural Network Rule Extraction. Proc. 4th Int. Eurosim Congress, Netherlands (2001)
Bottou L., Bengio, Y.: Convergence Properties of the K-Means Algorithms. Proc. 7th Int. Conf. on Neural Information Processing Systems, Denver (1994)
Liu, H., Setiono, R.: Chi2: Feature Selection and Discretization of Numeric Attributes. Proc. 7th Int. Conf. on Tools with AI, Washington D.C (1995)
Kohavi, R., Sahami, M.: Error-based and Entropy-based Discretization of Continuous Features. Proc. Int. Conf. on Knowledge Discovery and Data Mining (1996)
Quinlan, R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, CA (1993)
Tickle A., Andrews R., Golea M., Diederich J.: The Truth Will Come To Light: Directions and Challenges in Extracting the Knowledge Embedded Within Trained Artificial Neural Networks. In: IEEE Trans. on Neural Networks 9(6) (1998)
Bazan, J.G, Skowron, A.J., Synak, P.: Discovery of Decision Rules from Experimental Data. Proc. Int. W’shop on Rough Sets and Soft Computing, CA (1994)
Wróblewski, J.: Finding Minimal Reducts using Genetic Algorithms. Proc. 2nd Annual Joint Conf. on Information Sciences, Wrightsville Beach, NC. USA (1995)
Michalski, R.S.: A Theory and Methodology of Inductive Learning. In: Michalski, R.S., Carbonell, J.G. & Mitchell, T.M. (eds): Machine Learning, An Artificial Approach. Tioga Publishing, Palo Alto (1983)
Brazdil, P., Torgo, L.: Knowledge Acquisition Via Knowledge Integration. In: Current Trends in Knowledge Acquisition, IOS Press (1990)
Blake, C.L., Merz, C.J.: UCI Repository of machine learning databases (http://www.ics.uci.edu/~mlearn/MLRepository.html). Uni. of California Irvine.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abidi, S.S.R., Hoe, K.M., Goh, A. (2001). Analyzing Data Clusters: A Rough Sets Approach to Extract Cluster-Defining Symbolic Rules. In: Hoffmann, F., Hand, D.J., Adams, N., Fisher, D., Guimaraes, G. (eds) Advances in Intelligent Data Analysis. IDA 2001. Lecture Notes in Computer Science, vol 2189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44816-0_25
Download citation
DOI: https://doi.org/10.1007/3-540-44816-0_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42581-6
Online ISBN: 978-3-540-44816-7
eBook Packages: Springer Book Archive