Jayanta Poray, Christoph Schommer


Mind-graphs define an associative-adaptive concept of managing information streams, like for example words within a conversation. Being composed of vertices (or cells; representing external stimuli like words) and undirected edges (or connections), mind-graphs adaptively reflect the strength of simultaneously occurring stimuli and allow a self-regulation through the interplay of an artificial ‘fever’ and ‘coldness’ (capacity problem). With respect to this, an interesting application scenario is the merge of information streams that derive from a conversation of k conversing partners. In such a case, each conversational partner has an own knowledge and a knowledge that (s)he shares with other. Merging the own (inside) and the other’s (outside) knowledge leads to a situation, where things like e.g. trust can be decided. In this paper, we extend this concept by proposing extended mind-graph operations, dealing with the merge of sub-mind-graphs and the extraction of mind-graph skeletons.


  1. Bunke, H. and Shearer, K. (1998). A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett., 19:255-259.
  2. Clark, A. and Chalmers, D. (1998). The extended mind. In Analysis, volume 58, pages 7-19.
  3. Haghighi, A. D., Ng, A. Y., and Manning, C. D. (2005). Robust textual inference via graph matching. In Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing, HLT 7805, pages 387-394. Association for Computational Linguistics.
  4. Hensman, S. (2004). Construction of conceptual graph representation of texts. In Proceedings of the Student Research Workshop at HLT-NAACL 2004, HLT-SRWS 7804, pages 49-54. Association for Computational Linguistics.
  5. Ikonomakis, M., Kotsiantis, S., and Tampakas, V. (2005). Text classification: a recent overview. In Proceedings of the 9th WSEAS International Conference on Computers, pages 125:1-125:6.
  6. Jin, W. and Srihari, R. K. (2007). Graph-based text representation and knowledge discovery. In Proceedings of the 2007 ACM symposium on Applied computing, SAC 7807, pages 807-811. ACM.
  7. Poray, J. and Schommer, C. (2009). A cognitive mind-map framework to foster trust. In Proceedings of the 2009 Fifth International Conference on Natural Computation - Volume 05, ICNC 7809. IEEE Computer Society.
  8. Poray, J. and Schommer, C. (2010). Managing conversational streams by explorative mind-maps. In Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010. IEEE Computer Society.
  9. Radev, D. R. (2004). Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research, 22.
  10. Schenker, A., Last, M., Bunke, H., and Kandel, A. (2003). Classification of web documents using a graph model. In Seventh International Conference on Document Analysis and Recognition, pages 240-244.
  11. Sebastiani, F. (2002). Machine learning in automated text categorization. ACM Comput. Surv., 34:1-47.
  12. Tuulos, V. and Tirri, H. (2004). Combining topic models and social networks for chat data mining. In Web Intelligence, 2004. WI 2004. Proceedings. IEEE/WIC/ACM International Conference, pages 206 - 213.
  13. Ziegler, C.-N. and Golbeck, J. (2006). Investigating interactions of trust and interest similarity. Decision Support Systems, 43(2):460 - 475.

Paper Citation

in Harvard Style

Poray J. and Schommer C. (2012). OPERATIONS ON CONVERSATIONAL MIND-GRAPHS . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 511-514. DOI: 10.5220/0003749905110514

in Bibtex Style

author={Jayanta Poray and Christoph Schommer},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},

in EndNote Style

JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
SN - 978-989-8425-95-9
AU - Poray J.
AU - Schommer C.
PY - 2012
SP - 511
EP - 514
DO - 10.5220/0003749905110514