Nothing Special   »   [go: up one dir, main page]

Skip to main content

Decision Rule Clustering—Comparison of the Algorithms

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2023)

Abstract

In this paper, we present the complexity of decision rule clustering. When the rules are first clustered, then in the inference process we do review only the representatives of the rule clusters. This shortens the inference time significantly, because we search only k rule cluster representatives instead of n rules, where \(k << n\). The main goal of the research was to examine the two well-known clustering algorithms: the K-means and the AHC, in the context of rule-based knowledge representation. We tested different clustering approaches, distance measures, clustering methods, and values for the parameter representing the number of created rule clusters. We studied the clustering time and cluster quality indices. This paper is the first step of a more extensive study. After we have checked which algorithm clustering the rules faster in the knowledge base, we will propose our own version of the inference algorithm for rule clusters, a modification of the classic forward chaining process (on rules). Next, we will carry out experiments that are a continuation of those carried out for this work. These experiments will focus on analyzing the times of the classical inference process and its modification and the efficiency of inference, which will be measured, among others, by the frequency of successful conclusions of inference for both versions of inference algorithms. In this way, we will check whether, by clustering the rules and generating the conclusions on clusters of rules while significantly reducing the reasoning time, we can maintain high efficiency of reasoning.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Age of the patient: (1) young, (2) pre-presbyopic, (3) presbyopic, spectacle prescription: (1) myope, (2) hypermetrope, astigmatic: (1) no, (2) yes and tear production rate: (1) reduced, (2) normal.

  2. 2.

    1 : hard contact lenses, 2: soft contact lenses and 3:no contact lenses. Class distribution is following: 1: 4, 2: 5 and 3: 15.

References

  1. Steinbach, M.S., Karypis, G., Kumar, V.: A Comparison of Document Clustering Techniques. Department of Computer Science and Engineering, Computer Science (2000)

    Google Scholar 

  2. Karthikeyan, B., George, D.J., Manikandan, G., Thomas, T.: A comparative study on k-means clustering and agglomerative hierarchical clustering. Int. J. Emerg. Trends Eng. Res. 8(5) (2020). https://doi.org/10.30534/ijeter/2020/20852020

  3. Saleena, T.S., Sathish, A.J., Joseph, A.: Comparison of k-means algorithm and hierarchical algorithm using Weka tool. Int. J. Adv. Res. Comput. Commun. Eng. IJARCCE 7(7), 74–79 (2018)

    Google Scholar 

  4. Jabbar, A.M.: Local and global outlier detection algorithms in unsupervised approach: a review. Iraqi J. Electr. Electron. Eng. Coll. Eng. 17(1), 1–12 (2021)

    Article  MathSciNet  Google Scholar 

  5. Nowak-Brzezińska, A., Horyń, C.: Outliers in rules - the comparision of LOF, COF and K-means algorithms. Procedia Comput. Sci. 176, 1420–1429 (2020)

    Article  Google Scholar 

  6. Grzymała-Busse, J.W.: A comparison of rule induction using feature selection and the LEM2 algorithm. In: Stańczyk, U., Jain, L.C. (eds.) Feature Selection for Data and Pattern Recognition. SCI, vol. 584, pp. 163–176. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-45620-0_8

    Chapter  Google Scholar 

  7. Machine Learning Repository. www.archive.ics.uci.edu/ml/datasets/diabetes.com. Accessed Dec 2022

  8. Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, Hoboken (2005)

    Google Scholar 

  9. Legany, C., Juhasz, S., Babos, A.: Cluster validity measurement techniques. In: Knowledge Engineering and Data Bases, WSEAS, USA, pp. 388–393 (2006)

    Google Scholar 

  10. Machine Learning Repository. www.archive-beta.ics.uci.edu/dataset/146/statlog+landsat+satellite. Accessed Dec 2022

  11. Machine Learning Repository. www.archive-beta.ics.uci.edu/dataset/365/polish+companies+bankruptcy+data. Accessed Dec 2022

  12. Machine Learning Repository. www.archive-beta.ics.uci.edu/dataset/106/water+treatment+plant. Accessed Dec 2022

  13. Machine Learning Repository. www.archive-beta.ics.uci.edu/dataset/372/htru2. Accessed Dec 2022

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Igor Gaibei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nowak-Brzezińska, A., Gaibei, I. (2023). Decision Rule Clustering—Comparison of the Algorithms. In: Campagner, A., Urs Lenz, O., Xia, S., Ślęzak, D., Wąs, J., Yao, J. (eds) Rough Sets. IJCRS 2023. Lecture Notes in Computer Science(), vol 14481. Springer, Cham. https://doi.org/10.1007/978-3-031-50959-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-50959-9_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-50958-2

  • Online ISBN: 978-3-031-50959-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics