Advanced Search

Show simple item record

dc.contributor.authorIshaq, Waqar
dc.contributor.authorBüyükkaya, Eliya
dc.contributor.authorAli, Mushtaq
dc.contributor.authorKhan, Zakir
dc.date.accessioned2021-04-23T15:23:11Z
dc.date.available2021-04-23T15:23:11Z
dc.date.issued2021-01
dc.identifier.issn1932-6203en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12469/3994
dc.description.abstractThe vertical collaborative clustering aims to unravel the hidden structure of data (similarity) among different sites, which will help data owners to make a smart decision without sharing actual data. For example, various hospitals located in different regions want to investigate the structure of common disease among people of different populations to identify latent causes without sharing actual data with other hospitals. Similarly, a chain of regional educational institutions wants to evaluate their students' performance belonging to different regions based on common latent constructs. The available methods used for finding hidden structures are complicated and biased to perform collaboration in measuring similarity among multiple sites. This study proposes vertical collaborative clustering using a bit plane slicing approach (VCC-BPS), which is simple and unique with improved accuracy, manages collaboration among various data sites. The VCC-BPS transforms data from input space to code space, capturing maximum similarity locally and collaboratively at a particular bit plane. The findings of this study highlight the significance of those particular bits which fit the model in correctly classifying class labels locally and collaboratively. Thenceforth, the data owner appraises local and collaborative results to reach a better decision. The VCC-BPS is validated by Geyser, Skin and Iris datasets and its results are compared with the composite dataset. It is found that the VCC-BPS outperforms existing solutions with improved accuracy in term of purity and Davies-Boulding index to manage collaboration among different data sites. It also performs data compression by representing a large number of observations with a small number of data symbols.en_US
dc.language.isoengen_US
dc.publisherPUBLIC LIBRARY SCIENCEen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectN/Aen_US
dc.titleVCC-BPS: Vertical Collaborative Clustering using Bit Plane Slicingen_US
dc.typearticleen_US
dc.relation.journalPLOS ONEen_US
dc.identifier.issue1en_US
dc.identifier.volume16en_US
dc.identifier.wosWOS:000630036100020en_US
dc.identifier.doi10.1371/journal.pone.0244691en_US
dc.identifier.scopus2-s2.0-85099895227en_US
dc.institutionauthorIshaq, Waqaren_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.identifier.pmid33428649en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record