Abstract
In this work the subject of the application of clustering as a knowledge extraction method from real-world data is discussed. The authors analyze the influence of different clustering parameters on the efficiency of the knowledge mining process for rules/rules clusters. In the course of the experiments, nine different objects similarity measures and four clusters similarity measures have been examined in order to verify their impact on the size of the created clusters and the size of their representatives. The experiments have revealed that there is a strong relationship between the parameters used in the clustering process and future efficiency levels of the knowledge mined from such structures: some parameters guarantee to produce shorter/longer representatives of the created rules clusters as well as smaller/greater clusters’ sizes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Rules have been extensively used in knowledge representation and reasoning. This is very space efficient as only a relatively small number of facts needs to be stored in the KB and the rest can be derived from the inference rules. Such a natural way of knowledge representation makes the rules easily understood by people not involved in the expert system building.
- 2.
The idea is new but it is based on the authors’ previous research, where the idea of clustering rules was introduced.
- 3.
If both compared objects have the same attribute and this attribute has the same value for both objects then add 1 to a given similarity measure. If otherwise, do nothing. To eliminate one of the problems of SMC, which favours the longest rules, the authors also used Jaccards Index.
- 4.
However the authors see the necesssity to analyze the meaning of methods for creating clusters’ representatives and their influence on the overall efficiency.
- 5.
At this stage some data about sole attributes are also gathered (max. and min. of numerical attributes, the number of times when a categorical attribute had a given value), as they are used in some similarity measures.
References
Bazan, J.G., Szczuka, M.S., Wróblewski, J.: A new version of rough set exploration system. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 397–404. Springer, Heidelberg (2002). doi:10.1007/3-540-45813-1_52
Berrado, A., Runger, G.: Using metarules to organize and group discovered association rules. Data Min. Knowl. Discov. 14(3), 409–431 (2007)
Chemchem, A., Drias, H., Djenouri, Y.: Multilevel clustering of induction rules for web meta-knowledge. Adv. Intell. Syst. Comput. 206, 43–54 (2013)
Dubes, R., Jain, A.: Clustering techniques: the user’s dilemma. Pattern Recogn. 8(4), 247–260 (1976)
Goodall, D.: A new similarity index based on probability. Biometrics 22, 882–907 (1966)
Hashizume, A., Yongguang, B., Du, X., Ishii, N.: Generating representative from clusters of association rules on numeric attributes. In: Liu, J., Cheung, Y., Yin, H. (eds.) IDEAL 2003. LNCS, vol. 2690, pp. 605–613. Springer, Heidelberg (2003). doi:10.1007/978-3-540-45080-1_82
He, J., Chen, B., Hu, H.J., Harrison, R., Tai, P., Dong, Y., Pan, Y.: Rule clustering and super-rule generation for transmembrane segments prediction. In: IEEE Computational Systems Bioinformatics Conference, Workshops and Poster Abstracts, pp. 224–227 (2005)
Latkowski, R., Mikołajczyk, M.: Data decomposition and decision rule joining for classification of data with missing values. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 254–263. Springer, Heidelberg (2004). doi:10.1007/978-3-540-25929-9_30
Lee, O., Gray, P.: Knowledge base clustering for KBS maintenance. J. Softw. Maint. Evol. 10(6), 395–414 (1998)
Lenty, B., Swamix, A., Widomy, J.: Clustering association rules. Stanford University
Lichman, M.: UCI machine learning repository (2013). http://archive.ics.uci.edu/ml
Nowak-Brzezińska, A.: Mining rule-based knowledge bases. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds.) BDAS 2015-2016. CCIS, vol. 613, pp. 94–108. Springer, Cham (2016). doi:10.1007/978-3-319-34099-9_6
Nowak-Brzezińska, A.: Mining rule-based knowledge bases inspired by rough set theory. Fundam. Inform. 148, 35–50 (2016)
Nowak-Brzezińska, A., Rybotycki, T.: Visualization of medical rule-based knowledge bases. J. Med. Inf. Technol. 24, 91–98 (2015)
Prentzas, J., Hatzilygeroudis, I.: Improving efficiency of merging symbolic rules into integrated rules: splitting methods and mergability criteria. Expert Syst. 32(2), 244–260 (2015)
Reynolds, A.P., Richards, G., Rayward-Smith, V.J.: The application of K-medoids and PAM to the clustering of rules. In: Yang, Z.R., Yin, H., Everson, R.M. (eds.) IDEAL 2004. LNCS, vol. 3177, pp. 173–178. Springer, Heidelberg (2004). doi:10.1007/978-3-540-28651-6_25
Rybotycki, T.: Wizualizacja struktur hierarchicznych dla regulowych baz wiedzy, Sosnowiec (2015)
Shneiderman, B.: Tree visualization with tree-maps: 2-d space-filling approach. Trans. Graphics (TOG) 11, 92–99 (1992). Association for Computing Machinery, New York
Wetzel, K.: Pebbles - using circular treemaps to visualize disk usage (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Nowak-Brzezińska, A., Rybotycki, T. (2017). Influence of Similarity Measures for Rules and Clusters on the Efficiency of Knowledge Mining in Rule-Based Knowledge Bases. In: Kozielski, S., Mrozek, D., Kasprowski, P., Małysiak-Mrozek, B., Kostrzewa, D. (eds) Beyond Databases, Architectures and Structures. Towards Efficient Solutions for Data Analysis and Knowledge Representation. BDAS 2017. Communications in Computer and Information Science, vol 716. Springer, Cham. https://doi.org/10.1007/978-3-319-58274-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-58274-0_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58273-3
Online ISBN: 978-3-319-58274-0
eBook Packages: Computer ScienceComputer Science (R0)