Skip to main content
Springer Nature Link
Log in

An Incremental Rule Induction Algorithm Based on Ordering Relations

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2009)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5589))

Included in the following conference series:

  • 2721 Accesses

Abstract

Based on multi-dominance discernibility matrices, an incremental algorithm INRIDDM is proposed by means of dominance-based rough set approach. For the incremental algorithm, when a new object arrives, after updating one row or one column in the matrix, we could get the updated rule sets. Computation analysis and experimental results show that the incremental algorithm INRIDDM is superior to other non-incremental algorithms on dealing with large data sets.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Greco, S., Matarazzo, B., Slowinski, R., Stefanowinski, J.: An algorithm for induction of decision rules consistent with the dominance principle. In: Proceedings of Rough Sets and Current Trends in Computing, pp. 304–313 (2000)

    Google Scholar 

  2. Greco, S., Slowinski, R., Stefanowski, J., Zurawski, M.: Incremental versus non-incremental rule induction for multicriteria classification. In: Peters, J.F., Skowron, A., Dubois, D., Grzymała-Busse, J.W., Inuiguchi, M., Polkowski, L. (eds.) Transactions on Rough Sets II. LNCS, vol. 3135, pp. 33–53. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Jia, X.Y., Shang, L., Chen, J.J.: Rule induction algrithom based on dominance-based on rough set approach (in Chinese). Journal of Jiangnan University (Natural Science edn.) 6(6), 686–689 (2007)

    Google Scholar 

  4. Pawlak, Z.: Rough Sets. In: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    Google Scholar 

  5. Shan, N., Ziarko, W.: An incremental learning algorithm for constructing decision rules. In: Rough Sets, Fuzzy Sets and Knoledge Discovery, pp. 326–334. Springer, Heidelberg (1993)

    Google Scholar 

  6. Yao, Y.Y.: Mining high order decision rules. In: Rough Set Theory and Granular Computing, pp. 125–135 (2003)

    Google Scholar 

  7. Yao, Y.Y., Zhou, B., Chen, Y.H.: Interpreting low and high order rules: a granular computing approach. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 371–380. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China, 210093

    Xiuyi Jia, Lin Shang, Jiajun Chen & Xinyu Dai

Authors
  1. Xiuyi Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Shang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiajun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xinyu Dai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Surveying and Engineering, University of Southern Queensland, QLD 4350, Australia

    Peng Wen

  2. School of Information Technology, Queensland University of Technology, QLD 4001, Brisbane, Australia

    Yuefeng Li

  3. Institute of Mathematics, Warsaw University of Technology, Koszykowa 86, 02008, Warsaw, Poland

    Lech Polkowski

  4. Department of Computer Science, University of Regina, S4S 0A2, Regina, Saskatchewan, Canada

    Yiyu Yao

  5. Faculty of Medicine, Department of Medical Informatics, Shimane University, 89-1 Enya-cho, Izumo, 693-8501, Shimane, Japan

    Shusaku Tsumoto

  6. Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jia, X., Shang, L., Chen, J., Dai, X. (2009). An Incremental Rule Induction Algorithm Based on Ordering Relations. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds) Rough Sets and Knowledge Technology. RSKT 2009. Lecture Notes in Computer Science(), vol 5589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02962-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02962-2_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02961-5

  • Online ISBN: 978-3-642-02962-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics