Unsupervised clustering of context data and learning user requirements for a mobile device

9Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The K-SCM is an unsupervised learning algorithm, designed to cluster symbol string data in an on-line mariner. Unlike many other learning algorithms there are no time dependent gain factors. Context recognition based on the fusion of information sources is formulated as the clustering of symbol string data. Applied to real measured context data it is shown how the clusters can be associated with higher level contexts. This unsupervised learning approach is fundamentally different to the approach based, for example, on ontologies or supervised learning. Unsupervised learning requires no intervention from an outside expert. Using the example of menu adaptation in a mobile device, and a second learning stage, it is shown how user requirements in a given context can be associated with the learned contexts. This approach can be used to facilitate user interaction with the device. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Flanagan, J. A. (2005). Unsupervised clustering of context data and learning user requirements for a mobile device. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3554 LNAI, pp. 155–168). Springer Verlag. https://doi.org/10.1007/11508373_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free