Constructive learning with continuous-values attributes
Proceedings of the 2nd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems on Uncertainty and intelligent systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Flattening and Saturation: Two Representation Changes for Generalization
Machine Learning - Special issue on evaluating and changing representation
Refining Numerical Constants in First Order Logic Theories
Machine Learning - Special issue on multistrategy learning
Machine Learning for Intelligent Processing of Printed Documents
Journal of Intelligent Information Systems - Special issue on methodologies for intelligent information systems
Analysis of Symbolic Data: Exploratory Methods for Extracting Statistical Information from Complex Data
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Order Structure of Symbolic Assertion Objects
IEEE Transactions on Knowledge and Data Engineering
Learning Logical Definitions from Relations
Machine Learning
Learning Nonrecursive Definitions of Relations with LINUS
EWSL '91 Proceedings of the European Working Session on Machine Learning
ECML '93 Proceedings of the European Conference on Machine Learning
Handling Real Numbers in ILP: A Step Towards Better Behavioural Clones (Extended Abstract)
ECML '95 Proceedings of the 8th European Conference on Machine Learning
FONN: Combining First Order Logic with Connectionist Learning
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Learning Quantitative Features in a Symbolic Environment
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
Learning Structurally Indeterminate Clauses
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Learning Recursive Theories in the Normal ILP Setting
Fundamenta Informaticae
Handling continuous-valued attributes in incremental first-order rules learning
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
Learning Recursive Theories in the Normal ILP Setting
Fundamenta Informaticae
Hi-index | 0.00 |
Numerical induction from data is one of the statistical data analysis tasks, which uses a tabular model, with almost exclusively numerical features, as data representation formalism. The output representations are different: from functions to probability distributions, from surface equations to tables of indexes. One approach to extend the classical data analysis techniques to symbolic objects is the Symbolic Data Analysis: the input and the output of classical techniques are expressed in a symbolic way, so guaranteeing the comprehensibility of both the observations and the results, while the processing techniques, although appropriately adapted, maintain the efficiency of the classical statistical inferential models. Also in the field of Machine Learning several methods have been proposed to extend some inductive approaches from statistical data analysis to data represented as attribute-value couples. Sometimes these approaches transform ideas and principles coming from numerical induction to handle propositional calculus descriptions, otherwise they combine different techniques in order to treat numerical-continuous data and algebraic-symbolic data differently. The aim here is to improve the efficiency and to preserve the expressive power of the representations during the learning process, and to save the accuracy and flexibility of the numerical techniques during the recognition phase. This kind of integration is more and more complex when using first-order computational learning models, which are useful for handling object descriptions in structured domains, when not only the properties of objects but also the relations between different objects must be considered. The necessity arises from integrating different computational strategies, different knowledge representations and different processing methods in a naive combination of classifiers or, more meaningfully, in a real integration within a unique theoretical framework. When building machine learning systems increasing attention is given to handling symbolic and numerical information inside the same system. In the paper, we face the problem of handling both numerical and symbolic data in first-order models, distinguishing the phase of model generation from examples, and the phase of model recognition by means of a flexible probabilistic subsumption test.