An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical.
Jean-Marc ChamparnaudJean-Philippe DubernardHadrien JeannePublished in: Int. J. Found. Comput. Sci. (2009)
Keyphrases
- times faster
- learning algorithm
- preprocessing
- memory efficient
- computational cost
- experimental evaluation
- highly efficient
- improved algorithm
- theoretical analysis
- high accuracy
- k means
- multi objective
- non binary
- computational complexity
- optimization algorithm
- computationally efficient
- genetic algorithm
- objective function
- optimal solution
- language learning
- data structure
- natural language
- expectation maximization
- linear programming
- association rules
- machine learning
- cost function
- significant improvement