skip to main content
10.1145/1088622.1088668acmconferencesArticle/Chapter ViewAbstractPublication Pagesk-capConference Proceedingsconference-collections
Article

Using rough set to induce dependencies between attributes where there are a large amount of missing values: a SARS data application

Authors Info & Claims
Published:02 October 2005Publication History

ABSTRACT

Because of the amount of missing values in our SARS data set is very large, to fill in them wholly with the existing methods is impossible or the results of being filled in are not reliable. Only taking two attributes into account can avoid using the large amount of missing values, which is the feature of rough set that other machine learning method cannot hold. In this paper, we induced some rules based on rough set from the SARS data set that have not been detected by medical experts in clinic practice.

References

  1. V.N. Vapnik: Statistical Learning Theory. John Wiley & Sons, (1998). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Panther, J. G., Digital Communications, 3rd ed., Addison-Wesley, San Francisco, CA (1999).Google ScholarGoogle Scholar
  3. Jonathan, I., Maletic Andrian Marcus.: Data Cleaning: Beyond Integrity Analysis. Division of Computer Science, 2(2000).Google ScholarGoogle Scholar
  4. Z. Pawlak: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publisher, Norwell, MA, (1991). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Using rough set to induce dependencies between attributes where there are a large amount of missing values: a SARS data application

    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
      K-CAP '05: Proceedings of the 3rd international conference on Knowledge capture
      October 2005
      234 pages
      ISBN:1595931635
      DOI:10.1145/1088622

      Copyright © 2005 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: 2 October 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate55of198submissions,28%
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader