Pietro Cottone
ABSTRACT
In this paper, we present a new open-source software library, Gl-learning, for grammatical inference. The rise of new application scenarios in recent years has required optimized methods to address knowledge extraction from huge amounts of data and to model highly complex systems. Our library implements the main state-of-the-art algorithms in the grammatical inference field (RPNI, EDSM, L*), redesigned through the OpenMP library for a parallel execution that drastically decreases execution times. To our best knowledge, it is also the first comprehensive library including a noise tolerance learning algorithm, such as Blue*, that significantly broadens the range of the potential application scenarios for grammar models. The modular design of our C++ library makes it an efficient and extensible framework for the design of further novel algorithms.
- Hasan Ibne Akram et al. "Grammatical Inference Algorithms in MATLAB". In: Proc. of the 10th Int. Conf. on Grammatical Inference. ICGI'10. Valencia, Spain, 2010. Google Scholar
Digital Library
- Alessandra De Paola, Marco La Cascia, Giuseppe Lo Re, Marco Morana, Marco Ortolani. "Mimicking biological mechanisms for sensory information fusion". In: Biologically Inspired Cognitive Architectures 3 (2013), pp. 27--38.Google ScholarCross Ref
- Alessandra De Paola, Salvatore Gaglio, Giuseppe Lo Re, Fabrizio Milazzo, Marco Ortolani. "Adaptive Distributed Outlier Detection for WSNs". In: IEEE Transactions on Cybernetics PP.99 (2014), pp. 1--12.Google Scholar
- Alfonso Farruggia, Giuseppe Lo Re, Marco Ortolani. "Detecting faulty wireless sensor nodes through Stochastic classification". In: IEEE Int. Conf. on Pervasive Computing and Communications Workshops. Mar. 2011, pp. 148--153.Google ScholarCross Ref
- Dana Angluin. "Learning Regular Sets from Queries and Counterexamples". In: Information and Computation (Nov. 1987). Google ScholarDigital Library
- Dana Angluin. "Queries and concept learning". In: Machine learning 2.4 (1988). Google ScholarDigital Library
- A. W. Biermann et al. "On the Synthesis of Finite-State Machines from Samples of Their Behavior. In: IEEE Trans. Comput. 21.6 (June 1972). Google ScholarDigital Library
- Benedikt Bollig et al. "libalf: The Automata Learning Framework". In: Computer Aided Verification: 22nd International Conference, Edinburgh, UK. Springer, 2010. Google ScholarDigital Library
- Miguel Bugalho et al. "Inference of Regular Languages Using State Merging Algorithms with Search". In: Pattern Recogn. 38.9 (Sept. 2005). Google ScholarDigital Library
- Matthew S. Collins et al. "Efficient Induction of Finite State Automata". In: Proc. of the 13th Conf. on Uncertainty in Artificial Intelligence. 1997. Google ScholarDigital Library
- Leonardo Dagum et al. "OpenMP: An Industry-Standard API for Shared-Memory Programming". In: IEEE Comput. Sci. Eng. (Jan. 1998). Google ScholarDigital Library
- Lee Giles et al. "Noisy time series prediction using recurrent neural networks and grammatical inference". In: Machine learning (2001). Google ScholarDigital Library
- E. Mark Gold. "Language identification in the limit". In: Information and control (1967).Google Scholar
- Andreas Hagerer et al. "Model generation by moderated regular extrapolation". In: Fundamental Approaches to Software Engineering. Springer, 2002. Google ScholarDigital Library
- Colin de la Higuera. Grammatical Inference: Learning Automata and Grammars. New York, NY, USA: Cambridge University Press, 2010. Google ScholarDigital Library
- Hopcroft et al. Introduction to Automata Theory, Languages, and Computation. 2007. Google ScholarDigital Library
- Ramon Janssen et al. Learning a state diagram of TCP using abstraction. 2013.Google Scholar
- George H John et al. "Irrelevant features and the subset selection problem". In: Machine learning: eleventh international conference. 1994.Google Scholar
- Kevin J. Lang et al. "Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm". In: Proc. of the 4th Intl Colloquium on Grammatical Inference. ICGI '98. Google ScholarDigital Library
- Tim Oates et al. "Motif discovery in spatial trajectories using grammar inference". In: Proc. of ACM Int. Conf. on Information & Knowledge management. 2013, pp. 465--468. Google ScholarDigital Library
- Jose Oncina et al. "Identifying Regular Languages In Polynomial Time". In: advances in structural and syntactic pattern recognition. World Scientific, 1992.Google Scholar
- Pietro Cottone, Salvatore Gaglio, Giuseppe Lo Re, Marco Ortolani. "A machine learning approach for user localization exploiting connectivity data". In: Engineering Applications of Artificial Intelligence 50 (2016), pp. 125--134. Google ScholarDigital Library
- Pietro Cottone, Salvatore Gaglio, Giuseppe Lo Re, Marco Ortolani. "User activity recognition for energy saving in smart homes". In: Pervasive and Mobile Computing 16, Part A (2015), pp. 156--170. Google ScholarDigital Library
- Harald Raffelt et al. "LearnLib: A Library for Automata Learning and Experimentation". In: Fund. Approaches to Software Engineering. Springer, 2006. Google ScholarDigital Library
- R. L. Rivest et al. "Inference of Finite Automata Using Homing Sequences". In: Proc. of the 21st ACM Symposium on Theory of Computing. ACM, 1989. Google ScholarDigital Library
- Salvatore Gaglio, Giuseppe Lo Re, Marco Morana. "A Framework for Real-time Twitter Data Analysis". In: Computer Communications (Jan. 2016), pp. 236--242. Google ScholarDigital Library
- Marc Sebban et al. BLUE: a Blue-Fringe Procedure for Learning DFA with Noisy Data.Google Scholar
Recommendations
MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming
The bulk synchronous parallel (BSP) model, as well as parallel programming interfaces based on BSP, classically target distributed-memory parallel architectures. In earlier work, Yzelman and Bisseling designed a MulticoreBSP for Java library ...
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference
The goal of this paper is to develop the parallel algorithms that, on input of a learning sample, identify a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative ...
pCMALib: a parallel fortran 90 library for the evolution strategy with covariance matrix adaptation
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationWe present pCMALib, a parallel software library that implements the Evolution Strategy with Covariance Matrix Adaptation (CMA-ES). The library is written in Fortran 90/95 and uses the Message Passing Interface (MPI) for efficient parallelization on ...
Comments