{"title":"Clustering sentences to discover events from multiple news articles using Buckshot and Fractionation","authors":"D. Saravanapriya, Dr M Karthikeyan","doi":"10.1109/ICCIC.2014.7238566","DOIUrl":null,"url":null,"abstract":"Sentence Clustering is performed based on the key terms in sentences within a document or group of documents. A sentence may come under different topics in a single document with different word of similar meaning which will not be clustered correctly by using hierarchical clustering methods. Hierarchical clustering methods are robust. They are not very efficient as its time complexity is O (n2). To overcome this problem, K-means type algorithms are used, but it handles only few documents. A proposed algorithm uses both hierarchical and partitional clustering method alternatively. It increases the accuracy and reduces the time complexity for multiple news articles. It is applied to group the text spans from multiple news articles that refer to the same event.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Computational Intelligence and Computing Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIC.2014.7238566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Sentence Clustering is performed based on the key terms in sentences within a document or group of documents. A sentence may come under different topics in a single document with different word of similar meaning which will not be clustered correctly by using hierarchical clustering methods. Hierarchical clustering methods are robust. They are not very efficient as its time complexity is O (n2). To overcome this problem, K-means type algorithms are used, but it handles only few documents. A proposed algorithm uses both hierarchical and partitional clustering method alternatively. It increases the accuracy and reduces the time complexity for multiple news articles. It is applied to group the text spans from multiple news articles that refer to the same event.