AuthorWillmore, Christopher P.
Other ContributorsGoldberg, Mark;
AbstractThis thesis describes a new two-step algorithm for finding hidden groups from chat transcripts, that is, transcripts of communication where the recipient of a message is not known. The algorithm is presented in two steps: calculating a correlation value between every pair of users in the chat transcript, and finding clusters in the weighted undirected graph that results. The inter-user correlation can be calculated in a number of different ways, some of which are accomplished by projecting individual user transcripts into an inner product space. The clustering step uses the existing iterative-scan algorithm, with some new modifications. This approach is found to work under limited conditions.;
DescriptionMay 2008; School of Science
DepartmentDept. of Computer Science;
PublisherRensselaer Polytechnic Institute, Troy, NY
RelationshipsRensselaer Theses and Dissertations Online Collection;
AccessCC BY-NC-ND. Users may download and share copies with attribution in accordance with a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. No commercial use or derivatives are permitted without the explicit approval of the author.;