{"_id":"hWwidtiCoyWmm9yuv","bibbaseid":"khot-clusteringtwitterfeedsusingwordcooccurrencecs769projectreport","downloads":0,"creationDate":"2018-02-07T16:22:57.283Z","title":"Clustering Twitter Feeds using Word Co-occurrence CS769 Project Report","author_short":["Khot, T."],"year":null,"bibtype":"article","biburl":null,"bibdata":{"title":"Clustering Twitter Feeds using Word Co-occurrence CS769 Project Report","type":"article","websites":"http://pages.cs.wisc.edu/~tushar/projects/cs769.pdf","id":"2b9d7ecf-dda5-37a2-b999-d2a6f41aa3cc","created":"2018-02-05T17:30:24.237Z","accessed":"2018-02-05","file_attached":"true","profile_id":"371589bb-c770-37ff-8193-93c6f25ffeb1","group_id":"f982cd63-7ceb-3aa2-ac7e-a953963d6716","last_modified":"2018-02-05T17:30:26.270Z","read":false,"starred":false,"authored":false,"confirmed":false,"hidden":false,"private_publication":false,"abstract":"For very large number of documents, normal clustering meth-ods would take O(document 2) time. When the number of documents are very large but short such as tweets, it may make sense to actually cluster the words. We present a method that clusters the words using the word co-occurrence as a similarity measure. We use spectral clustering for cre-ating word clusters and do a \" search \" to get the actual doc-uments. The resulting word clusters and tweets make sense most of the times.","bibtype":"article","author":"Khot, Tushar","bibtex":"@article{\n title = {Clustering Twitter Feeds using Word Co-occurrence CS769 Project Report},\n type = {article},\n websites = {http://pages.cs.wisc.edu/~tushar/projects/cs769.pdf},\n id = {2b9d7ecf-dda5-37a2-b999-d2a6f41aa3cc},\n created = {2018-02-05T17:30:24.237Z},\n accessed = {2018-02-05},\n file_attached = {true},\n profile_id = {371589bb-c770-37ff-8193-93c6f25ffeb1},\n group_id = {f982cd63-7ceb-3aa2-ac7e-a953963d6716},\n last_modified = {2018-02-05T17:30:26.270Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {For very large number of documents, normal clustering meth-ods would take O(document 2) time. When the number of documents are very large but short such as tweets, it may make sense to actually cluster the words. We present a method that clusters the words using the word co-occurrence as a similarity measure. We use spectral clustering for cre-ating word clusters and do a \" search \" to get the actual doc-uments. The resulting word clusters and tweets make sense most of the times.},\n bibtype = {article},\n author = {Khot, Tushar}\n}","author_short":["Khot, T."],"urls":{"Paper":"http://bibbase.org/service/mendeley/371589bb-c770-37ff-8193-93c6f25ffeb1/file/61c029ff-748e-8d17-51d1-a8c807b54707/Clustering_Twitter_Feeds_using_Word_Co-occurrence_CS769_Project_Report.pdf.pdf","Website":"http://pages.cs.wisc.edu/~tushar/projects/cs769.pdf"},"bibbaseid":"khot-clusteringtwitterfeedsusingwordcooccurrencecs769projectreport","role":"author","downloads":0},"search_terms":["clustering","twitter","feeds","using","word","occurrence","cs769","project","report","khot"],"keywords":[],"authorIDs":[]}