{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:00:07Z","timestamp":1772042407985,"version":"3.50.1"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T00:00:00Z","timestamp":1300060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSOFT Softw. Eng. Notes"],"published-print":{"date-parts":[[2011,3,14]]},"abstract":"<jats:p>Software fault prediction area is subject to problems like non availability of fault data which makes the application of supervised techniques difficult. In such cases unsupervised approaches like clustering are helpful. In this paper, K-Medoids clustering approach has been applied for software fault prediction. To overcome the inherent computational complexity of KMedoids algorithm a data structure called Kd-Tree has been used to identify data agents in the datasets. Partitioning Around Medoids is applied on these data agents and this results in a set of medoids. All the remaining data points are assigned to the nearest medoids thus obtained to get the final clusters. Software fault prediction error analysis results show that our approach outperforms all unsupervised approaches in the case of one given real dataset and gives best values for the evaluation parameters. For other real datasets, our results are comparable to other techniques. Performance evaluation of our technique with other techniques has been done. Results show that our technique reduces the total number of distance calculations drastically since the number of data agents is much less than the number of data points.<\/jats:p>","DOI":"10.1145\/1943371.1943381","type":"journal-article","created":{"date-parts":[[2011,3,15]],"date-time":"2011-03-15T16:38:06Z","timestamp":1300207086000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Application of K-Medoids with Kd-Tree for Software Fault Prediction"],"prefix":"10.1145","volume":"36","author":[{"given":"P. S.","family":"Bishnu","sequence":"first","affiliation":[{"name":"Birla Institute of Technology, Ranchi, India"}]},{"given":"V.","family":"Bhattacherjee","sequence":"additional","affiliation":[{"name":"Birla Institute of Technology, Ranchi, India"}]}],"member":"320","published-online":{"date-parts":[[2011,5,5]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"144","volume-title":"proceedings of the 20th VLDB Conference Santiago","author":"Ng R. T.","year":"1994"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"L. Kaufman and P. J. Rousseeuw (1990): Finding Groups in Data: An introduction to Cluster Analysis John Wiley and Sons.  L. Kaufman and P. J. Rousseeuw (1990): Finding Groups in Data: An introduction to Cluster Analysis John Wiley and Sons.","DOI":"10.1002\/9780470316801"},{"key":"e_1_2_1_3_1","first-page":"9","volume-title":"proc. Of HPCA","author":"Bishnu P. S.","year":"2009"},{"issue":"1","key":"e_1_2_1_4_1","first-page":"001","article-title":"Complexity Metrics for Analogy Based Effort Estimation","volume":"6","author":"Bhattacherjee V.","year":"2009","journal-title":"Journal of Theoretical and applied Information Technology"},{"key":"e_1_2_1_5_1","first-page":"149","volume-title":"Proc. of 11th Int. Conf. on Information Systems.","author":"Vicinanza S.","year":"1990"},{"key":"e_1_2_1_6_1","volume-title":"ACCT","author":"Kumar S.","year":"2011"},{"key":"e_1_2_1_7_1","first-page":"149","volume-title":"Proc. of the 8th Int. Symp. on High Assurance Systems Engineering","author":"Zhong S.","year":"2004"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2004.1274907"},{"key":"e_1_2_1_9_1","first-page":"365","volume-title":"Proc. of the 4th Int. Conf. on Tools with AI, Washington DC","author":"Seliya N.","year":"2002"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/HASE.2005.4"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2009.12"},{"key":"e_1_2_1_12_1","first-page":"101","volume-title":"Proc. of National Conference on Computing and Systems","author":"Bhattacherjee V.","year":"2010"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(00)00079-0"},{"key":"e_1_2_1_14_1","first-page":"404","volume-title":"Morgan Kaufmann Publishers","author":"Han J.","year":"2007"},{"key":"e_1_2_1_15_1","first-page":"265","volume-title":"Brazilian Symposium on Databases (SBBD)","author":"Barioni M. C. N.","year":"2006"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69812-8_42"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.01.001"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.08.015"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"M. d. Berg O. Cheong M. Kreveld and M. Overmars (2008): Computational geometry algorithms and applications Springer 3rd edition pp. 309--315.   M. d. Berg O. Cheong M. Kreveld and M. Overmars (2008): Computational geometry algorithms and applications Springer 3rd edition pp. 309--315.","DOI":"10.1007\/978-3-540-77974-2"},{"key":"e_1_2_1_20_1","first-page":"139","volume-title":"Pearson Education","author":"Dunhum M. H.","year":"2006"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018431.1021443"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021394316112"},{"key":"e_1_2_1_23_1","volume-title":"ICPQROM","author":"Bhattacherjee V.","year":"2011"}],"container-title":["ACM SIGSOFT Software Engineering Notes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1943371.1943381","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1943371.1943381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:21Z","timestamp":1750249401000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1943371.1943381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,14]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3,14]]}},"alternative-id":["10.1145\/1943371.1943381"],"URL":"https:\/\/doi.org\/10.1145\/1943371.1943381","relation":{},"ISSN":["0163-5948"],"issn-type":[{"value":"0163-5948","type":"print"}],"subject":[],"published":{"date-parts":[[2011,3,14]]},"assertion":[{"value":"2011-05-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}