𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learning indistinguishability from data

✍ Scribed by F. Höppner; F. Klawonn; P. Eklund

Publisher
Springer
Year
2002
Tongue
English
Weight
294 KB
Volume
6
Category
Article
ISSN
1432-7643

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

cover
Indistinguishable from Magic
✍ David A. McIntee 📂 Fiction 📅 2011 🏛 Pocket Books;Simon & Schuster 🌐 English ⚖ 287 KB 👁 2 views

The most talented Starfleet engineers of two generations unite to solve a two-hundred-year-old technological mystery that turns out to be only the beginning of a wider quest. With the support of Guinan and Nog, as well as the crew of the _U.S.S. Challenger_ , Geordi La Forge and Montgomery Scott s

Learning from imperfect data
Learning from imperfect data
✍ Pitoyo Hartono; Shuji Hashimoto 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 583 KB
Learning concepts from data
Learning concepts from data
✍ Donald Michie 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 444 KB

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 pre

Generating indistinguishability operator
Generating indistinguishability operators from prototypes
✍ E. Hernández; J. Recasens 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

Given a T-indistinguishability operator E defined between some fuzzy subsets of a universe of discourse X, this paper studies three ways to generate an indistinguishability operator on X compatible with E inspired by the tools used in approximate reasoning and on the duality principle. Of special in

Incremental Learning from Positive Data
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