𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learning concepts from data

✍ Scribed by Donald Michie


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
444 KB
Volume
15
Category
Article
ISSN
0957-4174

No coin nor oath required. For personal study only.

✦ Synopsis


Current data-mining practice employs relatively low-level machine learning algorithms-statistical, neural-net, genetic, decision-tree, etc.-to trawl large data-sets for new classifiers. Usefulness of classifiers is then assessed according to accuracy in classifying new data, e.g. for stockmarket prediction or for assigning causes in medical diagnosis. User-transparency is often a secondary consideration. But in some applications the priorities are reversed. (1) In the ''designer drug'' industry, predictive classifiers are more valuable if they also provide chemists with new leads, while minimizing the frequency of the false positives. Screening fossil fuel emissions for hazardous components, on the other hand, requires minimization of false negatives. The high user-transparencies required in both cases are obtainable only with relational descriptions and rule languages, going beyond attribute-value representations. (2) In the simulator training of aircraft pilots, and of operators of other real-time devices, predictive control laws can provide a basis for machine-generated real-time advice to trainees. Study of human simulator-based control learning indicates a subgoal structure. It also suggests that both acquisition by the learner of new subgoals, and reorganization of perceived causal links among problem elements are involved in real-time skill learning. Design implications for automated coaches are worthy of consideration.


πŸ“œ SIMILAR VOLUMES


Intrinsic complexity of learning geometr
✍ Sanjay Jain; Efim Kinber πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 666 KB

Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy learning such geometrical concepts can be viewed as a sequence of primitive basic strategies. Thus, the length of such a se

Learning from imperfect data
✍ Pitoyo Hartono; Shuji Hashimoto πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 583 KB
Learning indistinguishability from data
✍ F. HΓΆppner; F. Klawonn; P. Eklund πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 294 KB
Incremental Learning from Positive Data
✍ Steffen Lange; Thomas Zeugmann πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 835 KB

The present paper deals with a systematic study of incremental learning algorithms. The general scenario is as follows. Let c be any concept; then every infinite sequence of elements exhausting c is called positive presentation of c. An algorithmic learner successively takes as input one element of

Learning Fuzzy Rules from Data
✍ G.D. Finn πŸ“‚ Article πŸ“… 1999 πŸ› Springer-Verlag 🌐 English βš– 135 KB