skip to main content
10.1145/3409334.3452076acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
short-paper

Modification and complexity analysis of an incremental learning algorithm under the VPRS model

Published:10 May 2021Publication History

ABSTRACT

This article introduced the modification of an incremental learning algorithm and summarized its performance via the complexity analysis. The algorithm was originally proposed in the context of classic rough set theory, utilizing the hierarchy of probabilistic decision tables as the classifier. The variable precision rough set model (VPRS model) is an extension of the classic rough set theory with unique features. When implemented under the VPRS model, the algorithm has to be modified; for example, some of its strategies can be merged and additional operations are required. Initially, the algorithm was modified into a version specifically suitable for the field of face recognition. This article further reformulated the algorithm so that it can be potentially applied in different areas and, after that, analyzed its complexity.

References

  1. X. Chen and W. Ziarko. 2010. Rough Set-based Incremental Learning Approach for Face Recognition. In the Seventh International Conference on Rough Sets and Current Trends in Computing (RSCTC 2010), Warsaw, Poland, 2010, pp. 356--365.Google ScholarGoogle Scholar
  2. J. Katzberg and W. Ziarko. 1994. Variable Precision Rough Sets with Asymmetric Bounds. In: Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer, London, UK, 1994, pp. 167--177.Google ScholarGoogle ScholarCross RefCross Ref
  3. Z. Pawlak. 1991. Rough Sets: Theoretical Aspects of Reasoning About Data, Kluwer, 1991.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Z. Pawlak and S.K.M. Wong and W. Ziarko. 1988. Rough Sets: Probabilistic versus Deterministic Approach. In International Journal of Man-Machine Studies, 29, 1988, pp. 81--95.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. N. Vlajic. 2004. Algorithm Analysis: If-else Statements, Recursive Algorithms, [www documents] 2004 URL: http://www.cse.yorku.ca/course_archive/2003-04/S/2011/pdf/DatStr_011_AlgorithmAnalysisContinued.pdf.Google ScholarGoogle Scholar
  6. W. Ziarko. 2003. Acquisition of Hierarchy-structured Probabilistic Decision Tables and Rules from Data. In Expert Systems, Vol. 20, No. 5, 2003, pp. 305--310.Google ScholarGoogle ScholarCross RefCross Ref
  7. W. Ziarko, 2005. Incremental Learning and Evaluation of Structures of Rough Decision Tables. In Transaction on Rough Sets, Springer Verlag, Vol. 3700, 2005, pp. 162--177.Google ScholarGoogle ScholarCross RefCross Ref
  8. W. Ziarko. 2006. Partition Dependencies in Hierarchies of Probabilistic Decision Tables. In Rough Sets and Knowledge Technology: First International Conference (RSKT 2006), Chongqing, China, 2006, pp. 42--49.Google ScholarGoogle Scholar
  9. W. Ziarko. 2008. Probabilistic Dependencies in Linear Hierarchies of Decision Tables. In Transactions on Rough Sets IX, LNCS 5390, 2008, pp. 444--454.Google ScholarGoogle Scholar
  10. W. Ziarko. 1993. Variable Precision Rough Sets Model. In Journal of Computer and System Sciences, Vol. 46, No. 1, 1993, pp. 39--59.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Modification and complexity analysis of an incremental learning algorithm under the VPRS model

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      ACM SE '21: Proceedings of the 2021 ACM Southeast Conference
      April 2021
      263 pages
      ISBN:9781450380683
      DOI:10.1145/3409334
      • Conference Chair:
      • Kazi Rahman,
      • Program Chair:
      • Eric Gamess

      Copyright © 2021 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 10 May 2021

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper

      Acceptance Rates

      Overall Acceptance Rate178of377submissions,47%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader