Fluents are logical descriptions of situations that persist, and composite fluents are statistically significant temporal relationships between fluents. This paper presents an algorithm for learning composite fluents incrementally from categorical time series data. The algorithm is tested with a large dataset of mobile robot episodes. It is given no knowledge of the episodic structure of the dataset (i.e., it learns without supervision) yet it discovers fluents that correspond well with episodes.
CITATION STYLE
Cohen, P. R. (2001). Fluent learning: Elucidating the structure of episodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2189, pp. 268–277). Springer Verlag. https://doi.org/10.1007/3-540-44816-0_27
Mendeley helps you to discover research relevant for your work.