From synapses to rules |
| |
| Institution: | 1. University of Zaragoza, Zaragoza, Spain;2. National Research Council, IRPI, Bari, Italy;3. Department of Biological, Geological and Environmental Sciences, Italian Institute of Speleology, University of Bologna, Italy;4. University of Montpellier II, France;1. Uppsala University, Department of Engineering Sciences, Ångströmlab, Lägerhyddsvägen 1, 751 21 Uppsala, Sweden;2. Poznań University of Economics and Business, Department of International Marketing, al. Niepodleglosci 10, 61-875 Poznań, Poland;1. Istituto Nazionale di Geofisica e Vulcanologia, Sezione di Catania — Osservatorio Etneo, Catania 95125, Italy;2. Department of Geology, University of Leicester, Leicester LE1 7RH, United Kingdom;3. British Geological Survey, Keyworth, Nottingham NG12 5CG, United Kingdom;1. Cardiff Catalysis Institute, School of Chemistry, Cardiff University, Cardiff CF10 3AT, UK;2. UK Catalysis Hub, Research Complex at Harwell (RCaH), Rutherford Appleton Laboratory, Harwell, Oxon OX11 0FA, UK;3. School of Chemistry, University of Manchester, Oxford Road, Manchester M13 9PL, UK |
| |
| Abstract: | We consider an integrated subsymbolic–symbolic procedure for extracting symbolically explained classification rules from data. A multilayer perceptron maps features into propositional variables and a set of subsequent layers operated by a PAC-like algorithm learns boolean expressions on these variables. The peculiarities of the whole procedure are: (i) we do not know a priori the class of formulas these expressions belong to, rather from time to time we get some information about the class and reduce uncertainty about the current hypothesis; (ii) the mapping from features to variables varies also over time to improve the suitability of the desired classification rules; and (iii) the final shape of the learnt expressions is determined by the learner who can express his preferences both in terms of an error function to be backpropagated along all layers of the proposed architecture and through the choice of a set of free parameters. We review the bases of the first point and then analyze the others in depth. The theoretical tools supporting the analysis are: (1) a new statistical framework that we call algorithmic inference; (2) a special functionality of the sampled points in respect to the formulas, denoted sentineling; and (3) entropy measures and fuzzy set methods governing the whole learning process. Preliminary numerical results highlight the value of the procedure. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
