Concise, intelligible, and approximate profiling of multiple classes

International Journal of Human Computer Studies

Volumn 53, Issue 3, 2000, Pages 411-436

  Valdés Pérez, Raúl E ^a   Pereira, Francisco ^a   Pericliev, Vladimir ^b  

^a Carnegie Mellon University   (United States)

^b INSTITUTE OF MATHEMATICS AND INFORMATICS   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; NATURAL SCIENCES COMPUTING; PSYCHOLOGY COMPUTING; SOCIAL SCIENCES COMPUTING; STATISTICAL METHODS;

CONCISE ALL PAIRS PROFILING METHOD; MULTIPLE CLASSES;

ARTIFICIAL INTELLIGENCE;

EID: 0342906645     PISSN: 10715819     EISSN: None     Source Type: Journal    
DOI: 10.1006/ijhc.2000.0397     Document Type: Article

References (41)

1. ALMUALLIM H., DIETTERICH T. G. Learning Boolean concepts in the presence of many irrelevant features. Artificial Intelligence. 63:1994;279-305.
2. BLAKE, C. KEOGH, E. MERZ, C. UCI repository of machine learning databases, www.ics.uci.edu/-mlearn/mlrepository.html , Department of Information and Computer Science, University of California, Irvine, CA.
3. BLUM A., LANGLEY P. Selection of relevant features and examples in machine learning. Artificial Intelligence. 97:1997;245-271.
4. BOHANEC M., BRATKO I. Trading accuracy for simplicity in decision trees. Machine Learning. 15:1994;223-250.
5. BOLAND M., MURPHY R. After sequencing: quantitative analysis of protein localization. IEEE Eng. Med. Biol. Mag. 18:1999;115-119.
6. BREIMAN L., FRIEDMAN J., OLSHEN R., STONE C. Classification and Regression Trees. 1984;Chapman & Hall, New York.
7. CHERRY C., HALLE M., JAKOBSON R. Toward the logical description of languages in their phonemic aspect. Language. 29:1953;34-47.
8. CHVATAL V. A greedy heuristic for the set covering problem. Mathematics of Operations Research. 4:1979;233-235.
9. CLARK P., NIBLETT T. The cn2 induction algorithm. Machine Learning. 3:1989;261-283.
10. GAREY M. R., JOHNSON D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W. H. Freeman, San Francisco.
11. GOOD P. Permutation Tests. 1994;Springer-Verlag, New York.
12. GOODENOUGH W. H. Componential analysis. Science. 156:1967;1203-1209.
13. 2-reforming of methane on transition metal surfaces. Surface Science. 417:1998;82-96.
14. HOLTE R. C. Very simple classification rules perform well on most commonly used datasets. Machine Learning. 3:1993;63-91.
15. HONG S. J. R-MINI: An iterative approach for generating minimal rules from examples. IEEE Transactions on Knowledge and Data Engineering. 9:1997;709-717.
16. IBA W., WOGULIS J., LANGLEY P. Trading off simplicity and coverage in incremental concept learning. Proceedings of the 5th International Conference on Machine Learning. 1988;Morgan Kaufmann, Los Altos. p. 73-79.
17. KAUTZ W. Fault testing and diagnosis in combinatorial digital circuits. IEEE Transactions on Computing. C17:1968;352-366.
18. LANGLEY P., SIMON H., BRADSHAW G., ZYTKOW J. Scientific Discovery: Computational Explorations of the Creative Processes. 1987;MIT Press, Cambridge.
19. LEECH G. N. Semantics. 1974;Pelican, Harmondsworth.
20. LOUNSBURY F. The structural analysis of kinship semantics. LUNT H. Proceedings of the 9th International Congress of Linguistics. 1964;1073-1090 Mouton and Co, The Hague.
21. LOUNSBURY F. Another view of the Trobrian kinship categories. American Anthropologist. 67:1965;142-185.
22. MACWHINNEY B., FELDMAN H., SACCO K., VALDÉZ PÉREZ R. E. Online measures of basic language skills in children with early focal brain lesion. Brain and Language. 2000.
23. MICHALSKI R., CHILAUSKY S. Learning by being told and learning from examples: an experimental comparison of the two methods of knowledge acquisition in the context of developing an expert system for soybean disease diagnosis. Journal of Policy Analysis and Information Systems. 4:1980;126-161.
24. MICHALSKI R., MOZETIC I., HONG J., LAVRAC N. The multi-purpose incremental learning system AQ15 and its testing application to three medical domains. Proceedings of National Conference on Artificial Intelligence. 1986;Morgan Kaufmann. p. 1041-1045.
25. MOONEY R. J. Encouraging experimental results on learning CNF. Machine Learning. 19:1995;79-92.
26. MURPHY P., PAZZANI M. Exploring the decision forest: An empirical investigation of OCCAM's razor in decision tree induction. Journal of Artificial Intelligence Research. 1:1994;257-275.
27. MURPHY R., BOLAND M. Pattern analysis meets cell biology. Microstructures and Microanalysis, Suppl. 2: Proceedings. 5:1999;510-511.
28. PANKHURST R. An improved algorithm for finding diagnostic taxonomic descriptions. Mathematical Biosciences. 65:1983;209-218.
29. PERICLIEV, V. VALDÉS-PÉREZ, R. E. 1997, A discovery system for componential analysis of kinship terminologies, Proceedings of the 16th International Congress of Linguists.
30. PERICLIEV V., VALDÉS-PÉREZ R. E. Automatic componential analysis of kinship semantics with a proposed structural solution to the problem of multiple models. Anthropological Linguistics. 40:1998a;272-317.
31. PERICLIEV V., VALDÉS-PÉREZ R. E. A procedure for multi-class discrimination and some linguistic applications. Proceedings of Coling-ACL: 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics. 1998b;. p. 1034-1040.
32. QUINLAN J. Learning logical definitions from relations. Machine Learning. 5:1990;239-266.
33. QUINLAN J. C4.5: Programs for Machine Learning. 1993;Morgan Kaufman, LOS Altos.
34. RIVEST R. Learning decision lists. Machine Learning. 2:1987;229-246.
35. SAITTA L., NERI F. Learning in the "Real World" Machine Learning. 30:1998;133-163.
36. VALDÉS-PÉREZ R. E. Algebraic reasoning about reactions: Discovery of conserved properties in particle physics. Machine Learning. 17:1994a;47-68.
37. VALDÉS-PÉREZ R. E. Conjecturing hidden entities via simplicity and conservation laws: Machine discovery in chemistry. Artificial Intelligence. 65:1994b;247-280.
38. VALDÉS-PÉREZ R. E. Principles of human computer collaboration for knowledge discovery in science. Artificial Intelligence. 107:1999;335-346.
39. VALDÉS-PÉREZ R. E., ZYTKOW J. M. Systematic generation of constituent models of particle families. Physical Review E. 54:1996;2102-2110.
40. WEBB G. I. OPUS: an efficient admissible algorithm for unordered search. Journal of Artificial Intelligence Research. 3:1995;431-465.
41. ZEIGARNIK A. V., VALDÉS-PÉREZ R. E., PESENTI J. Comparative properties of transition metal catalysts inferred from activation energies of elementary steps of catalytic reactions. Journal of Physical Chemistry. 104:2000;997-1008.