Contribution of Probabilistic Grammar Inference with k-Testable Language for Knowledge Modeling - Application on Aging People

Catherine Combes, Jean Azéma

Abstract

We investigate the contribution of unsupervised learning and regular grammatical inference to respectively identify profiles of elderly people and their development over time in order to evaluate care needs (human, financial and physical resources). The proposed approach is based on k-Testable Languages in the Strict Sense Inference algorithm in order to infer a probabilistic automaton from which a Markovian model which has a discrete (finite or countable) state-space has been deduced. In simulating the corresponding Markov chain model, it is possible to obtain information on population ageing. We have verified if our observed system conforms to a unique long term state vector, called the stationary distribution and the steady-state.

References

  1. Alur, R., Courcoubetis, C., Dill, D., 1990. Model-checking for real-time systems. In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, 414- 425.
  2. Alur, R., Courcoubetis, C., Dill, D., 1991. Model-checking for probabilistic real-time systems. In Automata, Languages and programming: Proceedings of the 18th ICALP, Lecture Note in Computer Science 510.
  3. Alur, R., Dill, D., 1994. A theory of timed automata. Theoritical Computer Science, 126, 183-235.
  4. Angluin, D., Smith, C. H., 1983. Inductive inference: Theory and methods, ACM Computing Surveys 15 (3), 237-269.
  5. Angluin, D., 1987. Learning regular sets from queries and counterexamples. Information and Computation, 75, 87-106.
  6. Balczar, J. L., Daz, J., Gavald R., 1997. Algorithms for learning finite automata from queries: A unified view. In Advances in Algorithms, Languages, and Complexity, 53-72.
  7. Bugalho, M., Oliveira, A., 2005. Inference of regular languages using state merging algorithms with search. Pattern Recognition, 38(9), 1457-1467.
  8. Combes, C., Azéma, J., Dussauchoy, A., 2008. Coupling Markov model - optimization: an application in medico-social care, 7e International Conference MOSIM'08 - march 31th - April 2th, Paris - France, 1310-1319.
  9. Combes, C., Azéma, J., 2013. Clustering using principal component analysis applied to autonomy-disability of elderly people. Decision Support System, http://dx.doi.org/10.1016/j.dss2012.10.016.
  10. Dupont, P., Denis, F., Esposito Y. 2005. Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms. Patterns Recognition, 38(9), 1349-1371.
  11. Garcia, P., Vidal, E., 1990a. Inference of k-testable languages in the strict sense and applications to syntactic pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12 (9), 920-925.
  12. Garcia, P., Vidal, E., Oncina, J., 1990b. Learning Locally Testable Language In Strict Sense. In Proceedings of the Workshop on Algorithmic Learning Theory, by Japanese Society for Artificial Intelligence. (http://users.dsic.upv.es/grupos/tlcc/papers/fullpapers/ GVO90.pdf).
  13. Grinchtein, O., Jonsson, B., Leucker, M., 2005. Inference of Timed Transition Systems. In Proceedings of International Workshop on Verification of Infinite State Systems, Electronic Notes in TheoreticalComputer Science, 138(3):87-99.
  14. Khachaturian, Z. S., 2007. A chapter in the development of Alzheimer's disease research: a case study of public policies on the development and funding of research programs. Alzheimer's & dementia: the journal of the Alzheimer's Association 3(3), 243-258.
  15. Parekh, R., Honavar, V., 2001. Learning DFA from simple examples. Machine Learning, 44(1/2), 9-35.
  16. Parekh, R., Nichitiu C. M., Honavar, V., 1998. A polynominal time incremental algorithm for learning DFA. In Proceeding of International Colloquium on Grammatical Inference: Algorithms and Applications, 37-49.
  17. Rico-Juan, J., Calera-Rubio, J., Carrasco, R., 2000, Probabilistic k-testable tree languages, In A. Oliveira (Ed.), Proceedings of 5th International Colloquium, ICGI, Lisbon (Portugal), Lecture Notes in Computer Science, vol. 1891, Springer, 221-228.
  18. Rivest, R.L., Schapire. R.E., 1993. Inference of finite automata using homing sequences. Information and Computation, 103, 299-347.
  19. Verwer, S., de Weerdt M., Witteveen, C., 2007. An algorithm for learning real-time automata. In proceedings of the 18th Benelearn, P. Adriaans, M. van Someren, S. Katrenko (eds.).
  20. Verwer, S., de Weerdt M., Witteveen, C., 2011. The efficiency of identifying timed automata and the power of clocks. Information and Computation, 209 (3), 606-625.
  21. Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., Carrasco, R.C., 2005. Probabilistic Finite-States Machine, IEEE Transactions on Patterns Analysis and Machine Intelligence, 27 (7), 1013-1039.
Download


Paper Citation


in Harvard Style

Combes C. and Azéma J. (2013). Contribution of Probabilistic Grammar Inference with k-Testable Language for Knowledge Modeling - Application on Aging People . In Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: LAFLang, (ICAART 2013) ISBN 978-989-8565-38-9, pages 451-460. DOI: 10.5220/0004356804510460


in Bibtex Style

@conference{laflang13,
author={Catherine Combes and Jean Azéma},
title={Contribution of Probabilistic Grammar Inference with k-Testable Language for Knowledge Modeling - Application on Aging People},
booktitle={Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: LAFLang, (ICAART 2013)},
year={2013},
pages={451-460},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004356804510460},
isbn={978-989-8565-38-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Agents and Artificial Intelligence - Volume 1: LAFLang, (ICAART 2013)
TI - Contribution of Probabilistic Grammar Inference with k-Testable Language for Knowledge Modeling - Application on Aging People
SN - 978-989-8565-38-9
AU - Combes C.
AU - Azéma J.
PY - 2013
SP - 451
EP - 460
DO - 10.5220/0004356804510460