Xindong Wu
ABSTRACT
HCV is a heuristic attribute-based induction algorithm based on the newly-developed extension matrix approach. By dividing the positive examples (PE) of a specific class in a given example set into intersecting groups and adopting a set of strategies to find a heuristic conjunctive formula in each group which covers all the group's positive examples and none of the negative examples (NE), it can find a covering formula in form of variable-valued logic for PE against NE in low-order polynomial time. This paper presents the HCV algorithm in detail and provides a performance comparison of HCV with other inductive algorithms such as ID3 and AQ11.
- Bloedorn et al 92.E. Bloedorn, R.S. Michalski, and J. Wnek, AQ17 - A Multistrategy Constructive Learning System, Reports of Machine Learning and Inference Laboratory, Center for Artificial Intelligence, George Mason University, USA, 1992.Google Scholar
- Cestnik et al 87.B. Cestnik, I. Kononenko, and I. Bratko, ASSISTANT 86: A Knowledge-Elicitation Tool for Sophisticated Users, Progress in Machine Learning, I. Bratko and N. Lavrac (Eds.), Wilmslow: Sigma Press, England, 1987.Google Scholar
- Clark et al 89.P. Clark and T. Niblett, The CN2 Induction Algorithm, Machine Learning, 3(1989), 261-283. Google ScholarDigital Library
- Feigenbaum 81.E.A. Feigenbaum, Expert Systems in the 1980s, Infotech Stale of lhe Art Report on Machine Intelligence, A. Bond (Ed.), Maidenhead: Pergamon-Infotech, 1981.Google Scholar
- Hong 85.J. Hong, AEI: An Extension Matrix Approximate Method for the General Covering Problem, International Journal of Computer and Information Sciences, 14(1985), 6: 421-437.Google Scholar
- Hong et al 87.J.R. Hong and C. Uhrik, The Extension Matrix Approach to Attribute-Based Learning, Progress in Machine Learning, I. Bratko and N. Lavrac (Eds.), Wilmslow: Sigma Press, England, 1987.Google Scholar
- Hunt et al 66.E.B. Hunt, J. Marin and P.T. Stone, Experiments in Induction, Academic Press, New York, 1966.Google Scholar
- Michalski 75.R.S. Michalski, Variable-Valued Logic and Its Applications to Pattern Recognition and Machine Learning, Computer Science and Multiple- Valued Logic Theory and Applications, D.C. Rine (Ed.), Amsterdam: North-Holland, 1975, 506-534.Google Scholar
- Michalski et al 78.R.S. Michalski and J. Larson, Selection of Most Representative Training Exampies and Incremental Generation of VL1 Hypothesis- the Underlying Methodology and Description of Programs ESEL and AQll, Tech. Report UIUCDCS-R-78-867, Dept. of Computer Science, Univ. of Illinois at Champaign-Urbana, 1978.Google Scholar
- Michalski et al 86.R.S. Michalski, I. Mozetie, J. tlong and N. Lavrac, The Multi-Purpose Incremental Learning System AQ15 and Its Testing Application to Three Medical Domains, Proceedings of AAAI 1986, 1986, 1041-1045.Google ScholarDigital Library
- Quinlan 79.J.R. Quinlan, Discovering Rules by Induction from Large Collections of Examples, Introductory Readings in Expert Systems, D. Michie (Ed.), Gordon and Breach, London, 1979, 33--46.Google Scholar
- Quinlan 86.J.R. Quinlan, Induction of Decision Trees, Machine Learning, 1(1986), 81-106. Google ScholarDigital Library
- Quinlan 89.J.R. Quinlan, Requirements for Knowledge Discovery in Databases, Proceedings of IJCAI- 89 Workshop on Knowledge Discovery in Databases, Detroit, USA, 1989, xiv.Google Scholar
- Quinlan 92.J.R. Quinlan, C.t.5: Programs for Machine Learning, Morgan Kaufmann Publishers, 1992. Google ScholarDigital Library
- Thrun et al 91.S.B. Thrun, et al., The MONK's Problems- A Performance Comparison of Different Learning Algorithms, CMU-CS-gl-lgT, School of Computer Science, Carnegie Mellon University, 1991.Google Scholar
- Utgoff 89.P.E. Utgoff, Incremental Induction of Decision Trees, Machine Learning, 4(1989), 161-186. Google ScholarDigital Library
- Valiant 84.L.G. Valiant, A Theory of the Learnable, Communications of the ACM, 27(1984), 11: 1134- 1142. Google ScholarDigital Library
- Wu 92a.X. Wu, Optimization Problems in Extension Matrixes, Science in China, Series A, Chinese edition: 35(1992), 2: 200-207; English edition, 35(1992), 3: 363-373.Google Scholar
- Wu 92b.X. Wu, HCV: A Heuristic Covering Algorithm for Extension Matrix Approach, DAI Research Paper No. 578, Department of Artificial Intelligence, University of Edinburgh, 1992.Google Scholar
- Wu 92c.X. Wu, HCV User's Manual (Release 1.0 June 1992), DAI Technical Paper No. g, Department of Artificial intelligence, University of Edinburgh, 1992.Google Scholar
- Wu 92d.X. Wu, Inductive Learning: Algorithms and Frontiers, Artificial Intelligence Review, 6(1992).Google Scholar
Index Terms
- The HCV induction algorithm
Recommendations
Docking assay of small molecule antivirals to p7 of HCV
Display Omitted Binding poses of antivirals to monomers and hexameric bundles of p7 of HCV.Guanidine based ligands bind better than derivatives of adamantanes and iminosugars.Binding of the best candidates is at the site of the loop.Hydrogen bonding and ...
Small molecule ligand docking to genotype specific bundle structures of hepatitis C virus (HCV) p7 protein
Display Omitted Binding poses of antivirals to hexameric bundles of p7 of HCV genotype 5a and 1b.LeadIT suggests guanidinium compounds then imino sugars, adamantanes.Rescoring with HYDE reverses the order.Favored binding sites within the pore and at ...
Analysis of HCV Envelope Proteins Interacting with Human Proteins
FBIT '07: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information TechnologiesDespite much progress in clinical and basic research on hepatitis C virus (HCV), interactions between HCV proteins and human proteins is not fully understood. HCV envelope proteins have many cellular targets in human proteins and affect several ...
Comments