Affordances and Emergence of Concepts

Date

2010-11-05

Author

Atıl, Ilkay
Dağ, Nilgün
Kalkan, Sinan
Şahin, Erol

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

65
views

0
downloads

In this paper, we used the affordance formalization framework (Sahin et al; Adaptive Behavior, 15(4), 447-472, 2007) to link the concepts represented by verbs and nouns in language to the affordance relations that a robot acquires through its interaction with the environment. First, we argued that a verb is linked not to a specific behavior of the robot, but to a specific effect that different behaviors may generate. We showed how demonstrations made by a human can allow the robot to learn an effect prototype in its own sensorymotor space, and use this to command the robot to achieve desired goals. Second, we investigated how the affordance relations of objects can be used to create noun concepts (to name objects) and how multi-task learning can utilize the learned object concepts to facilitate the learning of new affordances. The results are demonstrated on an iCub humanoid robot platform.

URI

https://dblp.org/db/conf/epirob/epirob2010.html
https://hdl.handle.net/11511/96647

Conference Name

Proceedings of the Tenth International Conference on Epigenetic Robotics

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Modeling and implementation of local volatility surfaces in Bayesian framework Animoku, Abdulwahab; Uğur, Ömür; Yolcu-Okur, Yeliz (2018-06-01) In this study, we focus on the reconstruction of volatility surfaces via a Bayesian framework. Apart from classical methods, such as, parametric and non-parametric models, we study the Bayesian analysis of the (stochastically) parametrized volatility structure in Dupire local volatility model. We systematically develop and implement novel mathematical tools for handling the classical methods of constructing local volatility surfaces. The most critical limitation of the classical methods is obtaining negativ...
Semantic information-based alternative plan generation for multiple query optimization Polat, Faruk; Alhajj, R (Elsevier BV, 2001-09-01) This paper addresses the impact of semantic information about queries on alternative plan generation (APG) for multiple query optimization (MQO). MQO covers optimizing the execution of a set of queries together where each query in the set to be optimized has several alternative execution plans. A multiple query optimizer selects an alternative plan for each query to obtain an optimal global execution plan. Our approach uses information such as common relations, common possible joins and common conditions to...
On the Krall-type polynomials on q-quadratic lattices Alvarez-Nodarse, R.; Adiguzel, R. Sevinik (Elsevier BV, 2011-08-01) In this paper, we study the Krall-type polynomials on non-uniform lattices. For these polynomials the second order linear difference equation, q-basic series representation and three-term recurrence relations are obtained. In particular, the q-Racah-Krall polynomials obtained via the addition of two mass points to the weight function of the non-standard q-Racah polynomials at the ends of the interval of orthogonality are considered in detail. Some important limit cases are also discussed. (C) 2011 Royal Net...
Recent results on Bayesian Cramér-Rao bounds for jump Markov systems Fritsche, Carsten; Orguner, Umut; Svensson, Lennart; Gustafsson, Fredrik (2016-07-08) In this paper, recent results on the evaluation of the Bayesian Cramer-Rao bound for jump Markov systems are presented. In particular, previous work is extended to jump Markov systems where the discrete mode variable enters into both the process and measurement equation, as well as where it enters exclusively into the measurement equation. Recursive approximations are derived with finite memory requirements as well as algorithms for checking the validity of these approximations are established. The tightnes...
Exploiting Index Pruning Methods for Clustering XML Collections Altıngövde, İsmail Sengör; Ulusoy, Ozgur (2010-01-01) In this paper, we first employ the well known Cover-Coefficient Based Clustering Methodology (C3 M) for clustering XML documents. Next, we apply index pruning techniques from the literature to reduce the size of the document vectors. Our experiments show that for certain cases, it is possible to prune up to 70% of the collection (or, more specifically, underlying document vectors) and still generate a clustering structure that yields the same quality with that of the original collection, in terms of a set o...

Citation Formats

I. Atıl, N. Dağ, S. Kalkan, and E. Şahin, “Affordances and Emergence of Concepts,” presented at the Proceedings of the Tenth International Conference on Epigenetic Robotics, Lund, İsveç, 2010, Accessed: 00, 2022. [Online]. Available: https://dblp.org/db/conf/epirob/epirob2010.html.