Skip to main content
SpringerLink
Log in

FCV1: A new fast greedy covering algorithm

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, a new covering algorithm called FCV1 is presented. FCV1 comprises two algorithms, one of which is able to fast search for a partial rule and exclude the large portion of negative examples, the other algorithm incorporates the more optimized greedy set-covering algorithm, and runs on a small portion of training examples. Hence, the training process of FCV1 is much faster than that of AQ15.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Quinlan J R. Learning logical definitions from relations.Machine Learning, 1990, 5: 239–266.

    Google Scholar 

  2. Quinlan J R. Induction of decision trees.Machine Learning, 1986, 1: 81–106.

    Google Scholar 

  3. Michalski R S, Mozetic I, Hong J R, Lavrac N The multi-purpose incremental learning system AQ15 and its testing application to three medical domains. InProceedings of the Fifth National Conference on Artificial Intelligence, Philadelphia, PA: Morgan Kaufmann, 1986, pp.1041–1045.

    Google Scholar 

  4. Quinlan J R.C4.5: Programs for Machine Learning. Morgan Kaufmann, 1990.

  5. Holte R C. Very simple classification rule performs well on most commonly used databases.Machine Learning, 1990, 11(1): 63–90.

    Article  MathSciNet  Google Scholar 

  6. Utgoff P E. An improved algorithm for incremental induction of decision trees. InProceedings of the Eleventh International Conference on Machine Learning, New Brunswick, NJ: Morgan Kaufmann, 1994.

    Google Scholar 

  7. Michalski R S, Larson J B. Selection of the most representative training examples and incremental generation of VL1 hypotheses: the underlying methodology and the description of programs ESEL and AQ11. Technical Report 867, Computer Science Department, University of Illinois.

  8. Hong J R AE1: An extension matrix approximate method for the general covering problem.International Journal of Computer and Information Science, 1985, 14(6): 421–437.

    Article  MATH  Google Scholar 

  9. Wu X D. HCV: A heuristic covering algorithm for extension matrix approach. Technical Report No.: Edinburgh DAI 578, Department of Computer Science, University of Edinburgh, 1992.

  10. Ray S, Lee W, Morgan C, Airth-Kindree W. Computer sleep stage scoring — An expert system approach. Technical Report, Department of Computer Science, University of Illinois, 1985.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Harbin Institute of Technology, 150001, Harbin, P.R. China

    Chen Bin & Hong Yong

Authors
  1. Chen Bin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong Yong
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by National Natural Science Foundation of China and the Research Fund of Harbin Institute of Technology.

Chen Bin, male, was born in 1968, and received his Ph.D. degree in 1997. His major is machine learning and computational learning theory.

Hong Yong, male, Ph.D. candidate, was born in 1973, and received his M.S. degree in 1997. His major is machine learning and its applications.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, B., Hong, Y. FCV1: A new fast greedy covering algorithm. J. of Comput. Sci. & Technol. 13, 369–374 (1998). https://doi.org/10.1007/BF02946625

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946625

Keywords

Search

Navigation