An improved self organizing map using jaccard new measure for textual bugs data clustering

Ahmed, Attika (2018) An improved self organizing map using jaccard new measure for textual bugs data clustering. Masters thesis, Universiti Tun Hussein Onn Malaysia.

Preview	Text 24p ATTIKA AHMED.pdf Download (19MB) | Preview
	Text (Copyright Declaration) ATTIKA AHMED COPYRIGHT DECLARATION.pdf Restricted to Repository staff only Download (1MB) | Request a copy
	Text (Full Text) ATTIKA AHMED WATERMARK.pdf Restricted to Registered users only Download (100MB) | Request a copy

Abstract

In software projects there is a data repository which contains the bug reports. These bugs are required to carefully analyze to resolve the problem. Handling these bugs humanly is extremely time consuming process, and it can result the delaying in addressing some important bugs resolutions. To overcome this problem researchers have been introduced many techniques. One of the techniques is the bug clustering. For the purpose of clustering, a variety of clustering algorithms available. One of the commonly used algorithm for bug clustering is K-means, which is considered a simplest unsupervised learning algorithm for clustering, yet it tends to produce smaller number of cluster. Considering the unsupervised learning algorithms, Self­Organizing Map (SOM) considers the equally compatible algorithm for clustering, as both algorithms are closely related but different in way they were used in data mining. This research attempts a comparative analysis of both the clustering algorithms and for attaining the results, a series of experiment has been conducted using Mozilla bugs data set. To address the data sparseness issue, the experiment has been perfonned on textual bugs' data by using two different distance measure which are Euclidean distance and Jaccard New Measure. The research results suggested that SOM has a limitation of poor perfonnance on sparse data set. Thus, the research introduced the improved SOM algorithm by using a Jaccard NM (SOM-JNM). The SOM-JNM produced significantly better results therefore; it can be consider a challenging approach to address the sparse data problems.

Item Type:	Thesis (Masters)
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA1-43 General
Divisions:	Faculty of Computer Science and Information Technology > Department of Information Security
Depositing User:	Mrs. Sabarina Che Mat
Date Deposited:	21 Aug 2022 01:45
Last Modified:	21 Aug 2022 01:45
URI:	http://eprints.uthm.edu.my/id/eprint/7554

Actions (login required)

View Item