Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Statistical Pattern Recognition: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM Computing Surveys (CSUR)
Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Some applications of tree-based modelling to speech and language
HLT '89 Proceedings of the workshop on Speech and Natural Language
Some logical and numerical aspects of pattern recognition and artificial intelligence
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Modelling early language acquisition skills: towards a general statistical learning mechanism
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop
Domain-Driven Data Mining: Challenges and Prospects
IEEE Transactions on Knowledge and Data Engineering
Syntactic pattern recognition from observations: a hybrid technique
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Linguistic Summarization Using IF–THEN Rules and Interval Type-2 Fuzzy Sets
IEEE Transactions on Fuzzy Systems
On neurobiological, neuro-fuzzy, machine learning, and statistical pattern recognition techniques
IEEE Transactions on Neural Networks
Syntactic pattern recognition from observations: a hybrid technique
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Hi-index | 0.00 |
This paper presents a novel technique for automated learning from observations. The technique arranges in a row four traditional pattern recognition approaches (numeric, logic, statistical and finally syntactic) within a unifying framework. Each processing step is conceived as a transformation of the input dataset from one state to another. The proposed technique considers measurable observations as inputs and produces a set of formal rules, i.e., a grammar, as final output. To this end, a four-state grammar induction process is described in detail by means of a step-by-step example. As a proof-of-concept for the feasibility of the proposal, references to early experimental validations are given. Finally, possible comparison with other well-known approaches are discussed.