{"title":"符号串的无监督聚类与上下文识别","authors":"J. A. Flanagan, Jani Mäntyjärvi, J. Himberg","doi":"10.1109/ICDM.2002.1183900","DOIUrl":null,"url":null,"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.","PeriodicalId":405340,"journal":{"name":"2002 IEEE International Conference on Data Mining, 2002. Proceedings.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":"{\"title\":\"Unsupervised clustering of symbol strings and context recognition\",\"authors\":\"J. A. Flanagan, Jani Mäntyjärvi, J. Himberg\",\"doi\":\"10.1109/ICDM.2002.1183900\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":405340,\"journal\":{\"name\":\"2002 IEEE International Conference on Data Mining, 2002. Proceedings.\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"39\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 IEEE International Conference on Data Mining, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDM.2002.1183900\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE International Conference on Data Mining, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM.2002.1183900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Unsupervised clustering of symbol strings and context recognition
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.