DocumentCode :
3248989
Title :
Unsupervised clustering of symbol strings and context recognition
Author :
Flanagan, John A. ; Mantyjarvi, Jani ; Himberg, Johan
Author_Institution :
Nokia Res. Center, Finland
fYear :
2002
fDate :
2002
Firstpage :
171
Lastpage :
178
Abstract :
The representation of information based on symbol strings has been applied to the recognition of context. A framework for approaching the context recognition problem has been described and interpreted in terms of symbol string recognition. The symbol string clustering map (SCM) is introduced as an efficient algorithm for the unsupervised clustering and recognition of symbol string data. The SCM can be implemented in an online manner using a computationally simple similarity measure based on a weighted average. It is shown how measured sensor data can be processed by the SCM algorithm to learn, represent and distinguish different user contexts without any user input.
Keywords :
computational complexity; data structures; online operation; pattern clustering; string matching; symbol manipulation; SCM; computationally simple similarity measure; context recognition; information representation; symbol string clustering map; symbol string recognition; unsupervised clustering; weighted average; Area measurement; Clustering algorithms; Context awareness; Data mining; Hidden Markov models; Keyboards; Man machine systems; Mobile computing; Multidimensional systems; Statistical analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Mining, 2002. ICDM 2003. Proceedings. 2002 IEEE International Conference on
Print_ISBN :
0-7695-1754-4
Type :
conf
DOI :
10.1109/ICDM.2002.1183900
Filename :
1183900
Link To Document :
بازگشت