Skip to main content

A Platform for Matching Context in Real Time

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9121))

Abstract

Context-awareness is a key feature of Ambient Intelligence and future intelligent systems. In order to achieve context-aware behavior, applications must be able to detect context information, recognize situations and correctly decide on context-aware action. The representation of context information and the manner in which context is detected are central issues. Based on our previous work in which we used graphs to represent context and graph matching to detect situations, in this paper we present a platform that completely handles context matching, and does so in real time, in the background, by deferring matching to a component that acts incrementally, relying on previous matching results. The platform has been implemented and tested on an AAL-inspired scenario.

This work has been funded by the Sectoral Operational Programme Human Resources Development 2007-2013 of the Ministry of European Funds through the Financial Agreement POSDRU/159/1.5/S/134398.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    See more details at http://aimas.cs.pub.ro/amicity.

  2. 2.

    The implementation is freely available under a GPLv3 license at https://github.com/andreiolaru-ro/net.xqhs.Graphs.

References

  1. Akkoyunlu, E.: The enumeration of maximal cliques of large graphs. SIAM J. Comput. 2(1), 1–6 (1973)

    MATH  MathSciNet  Google Scholar 

  2. Balas, E., Yu, C.S.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054–1068 (1986)

    MATH  MathSciNet  Google Scholar 

  3. Bengoetxea, E., Larrañaga, P., Bloch, I., Perchant, A., Boeres, C.: Inexact graph matching by means of estimation of distribution algorithms. Pattern Recogn. 35(12), 2867–2880 (2002)

    MATH  Google Scholar 

  4. Bettini, C., Brdiczka, O., Henricksen, K., Indulska, J., Nicklas, D., Ranganathan, A., Riboni, D.: A survey of context modelling and reasoning techniques. Pervasive Mob. Comput. 6(2), 161–180 (2010)

    Google Scholar 

  5. Bolchini, C., Curino, C., Quintarelli, E., Schreiber, F., Tanca, L.: A data-oriented survey of context models. ACM SIGMOD Rec. 36(4), 19–26 (2007)

    Google Scholar 

  6. Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)

    MATH  Google Scholar 

  7. Caetano, T., McAuley, J., Cheng, L., Le, Q., Smola, A.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048–1058 (2009)

    Google Scholar 

  8. Chen, H., Finin, T., Joshi, A.: The SOUPA ontology for pervasive computing. In: Cranefield, S., Finin, W.T., Willmott, S., Tamma, V. (eds.) Ontologies for Agents: Theory and Experiences, pp. 233–258. Birkhäuser Basel, Basel (2005)

    Chapter  Google Scholar 

  9. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3), 265–298 (2004)

    Google Scholar 

  10. Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367–1372 (2004)

    Google Scholar 

  11. Dobrescu, A., Olaru, A.: Graph matching for context recognition. In: Dumitrache, I., Florea, A.M., Pop, F. (eds.) In: Proceedings of CSCS 19, 19th International Conference on Control Systems and Computer Science, pp. 479–486. IEEE Xplore, Romania, 29–13 May 2013

    Google Scholar 

  12. Durand, P.J., Pasari, R., Baker, J.W.: An efficient algorithm for similarity analysis of molecules. Internet J. Chem. 2(17), 1–16 (1999)

    Google Scholar 

  13. Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recog. Artif. Intell. 28(01), 1554–1585 (2014)

    MathSciNet  Google Scholar 

  14. Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoret. Comput. Sci. 250(1), 1–30 (2001)

    MATH  MathSciNet  Google Scholar 

  15. Luo, B., Hancock, E.: Structural graph matching using the EM algorithm and singular value decomposition. IEEE Trans. Pattern Anal. Mach. Intell. 35, 1120–1136 (2001)

    Google Scholar 

  16. McGregor, J.J.: Backtrack search algorithms and the maximal common subgraph problem. Softw. Pract. Experience 12(1), 23–34 (1982)

    MATH  Google Scholar 

  17. Messmer, B., Bunke, H.: Efficient subgraph isomorphism detection: a decomposition approach. IEEE Trans. Knowl. Data Eng. 12(2), 307–323 (2000)

    Google Scholar 

  18. Olaru, A.: Context matching for ambient intelligence applications. In: Björner, N., Negru, V., Ida, T., Jebelean, T., Petcu, D., Watt, S., Zaharie, D. (eds.) In: Proceedings of SYNASC 2013, 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 265–272. IEEE CPS, Romania, 23–26 September 2013

    Google Scholar 

  19. Olaru, A., Florea, A.M., El Fallah Seghrouchni, A.: A context-aware multi-agent system as a middleware for ambient intelligence. Mob. Netw. Appl. 18(3), 429–443 (2013)

    Google Scholar 

  20. Perera, C., Zaslavsky, A., Christen, P., Georgakopoulos, D.: Context aware computing for the internet of things: a survey. IEEE Commun. Surv. Tutorials 16(1), 414–454 (2013)

    Google Scholar 

  21. Sadri, F.: Ambient intelligence: a survey. ACM Comput. Surv. 43(4), 36 (2011)

    Google Scholar 

  22. Turner, R.M.: Context-mediated behavior. In: Brézillon, p, Gonzalez, A.J. (eds.) Context in Computing, pp. 523–539. Springer, New York (2014)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrei Olaru .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Olaru, A., Florea, A.M. (2015). A Platform for Matching Context in Real Time. In: Onieva, E., Santos, I., Osaba, E., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2015. Lecture Notes in Computer Science(), vol 9121. Springer, Cham. https://doi.org/10.1007/978-3-319-19644-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19644-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19643-5

  • Online ISBN: 978-3-319-19644-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics