Khumaisa Nur'Aini, Ibtisami Najahaty, Lina Hidayati, H. Murfi, S. Nurrohmah
{"title":"奇异值分解与k均值聚类相结合的Twitter话题检测方法","authors":"Khumaisa Nur'Aini, Ibtisami Najahaty, Lina Hidayati, H. Murfi, S. Nurrohmah","doi":"10.1109/ICACSIS.2015.7415168","DOIUrl":null,"url":null,"abstract":"Online social media are growing very rapidly in recent years, such as Twitter. Even the interaction and communication in the social media can reflect on the events of the real world. This causes the value of the information increasing significantly. However, the huge amount of the information requires a method of automatically detecting topics, one of which is the K-means Clustering. Moreover, the large dimensions of data become obstacles. So, we used singular value decomposition (SVD) to reduce the dimension of the data prior to the learning process using the K-means Clustering. The accuracy of the combination of SVD and K-means Clustering methods showed comparative results, while the computation time required is likely to be faster than the method of K-means Clustering without any reduction in advance.","PeriodicalId":325539,"journal":{"name":"2015 International Conference on Advanced Computer Science and Information Systems (ICACSIS)","volume":"38 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":"{\"title\":\"Combination of singular value decomposition and K-means clustering methods for topic detection on Twitter\",\"authors\":\"Khumaisa Nur'Aini, Ibtisami Najahaty, Lina Hidayati, H. Murfi, S. Nurrohmah\",\"doi\":\"10.1109/ICACSIS.2015.7415168\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Online social media are growing very rapidly in recent years, such as Twitter. Even the interaction and communication in the social media can reflect on the events of the real world. This causes the value of the information increasing significantly. However, the huge amount of the information requires a method of automatically detecting topics, one of which is the K-means Clustering. Moreover, the large dimensions of data become obstacles. So, we used singular value decomposition (SVD) to reduce the dimension of the data prior to the learning process using the K-means Clustering. The accuracy of the combination of SVD and K-means Clustering methods showed comparative results, while the computation time required is likely to be faster than the method of K-means Clustering without any reduction in advance.\",\"PeriodicalId\":325539,\"journal\":{\"name\":\"2015 International Conference on Advanced Computer Science and Information Systems (ICACSIS)\",\"volume\":\"38 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"44\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Advanced Computer Science and Information Systems (ICACSIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACSIS.2015.7415168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Advanced Computer Science and Information Systems (ICACSIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACSIS.2015.7415168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Combination of singular value decomposition and K-means clustering methods for topic detection on Twitter
Online social media are growing very rapidly in recent years, such as Twitter. Even the interaction and communication in the social media can reflect on the events of the real world. This causes the value of the information increasing significantly. However, the huge amount of the information requires a method of automatically detecting topics, one of which is the K-means Clustering. Moreover, the large dimensions of data become obstacles. So, we used singular value decomposition (SVD) to reduce the dimension of the data prior to the learning process using the K-means Clustering. The accuracy of the combination of SVD and K-means Clustering methods showed comparative results, while the computation time required is likely to be faster than the method of K-means Clustering without any reduction in advance.