{"title":"基于半监督学习的多文档子主题聚类研究","authors":"Xiaodan Xu","doi":"10.1109/DBTA.2010.5659111","DOIUrl":null,"url":null,"abstract":"Sub-topic detecting is an important step in the abstracting of multi-documents.This paper describes a new method for sub-topic detecting based on semi-supervised learning:it firstly gets the primal sets of topics by hierarchy clustering,and labels the sentences which have high scores in the topics,then use the method of constrained-kMeans to decide the number of topics(k),and finally get the topic sets by k-Means clustering.The experiment result indicates that its value is stable.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Study on Sub Topic Clustering of Multi-Documents Based on Semi-Supervised Learning\",\"authors\":\"Xiaodan Xu\",\"doi\":\"10.1109/DBTA.2010.5659111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sub-topic detecting is an important step in the abstracting of multi-documents.This paper describes a new method for sub-topic detecting based on semi-supervised learning:it firstly gets the primal sets of topics by hierarchy clustering,and labels the sentences which have high scores in the topics,then use the method of constrained-kMeans to decide the number of topics(k),and finally get the topic sets by k-Means clustering.The experiment result indicates that its value is stable.\",\"PeriodicalId\":320509,\"journal\":{\"name\":\"2010 2nd International Workshop on Database Technology and Applications\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Workshop on Database Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DBTA.2010.5659111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Workshop on Database Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DBTA.2010.5659111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Study on Sub Topic Clustering of Multi-Documents Based on Semi-Supervised Learning
Sub-topic detecting is an important step in the abstracting of multi-documents.This paper describes a new method for sub-topic detecting based on semi-supervised learning:it firstly gets the primal sets of topics by hierarchy clustering,and labels the sentences which have high scores in the topics,then use the method of constrained-kMeans to decide the number of topics(k),and finally get the topic sets by k-Means clustering.The experiment result indicates that its value is stable.