| dc.contributor.author | Cataltepe, Zehra | |
| dc.contributor.author | Sonmez, Abdullah | |
| dc.contributor.author | Bax, Eric | |
| dc.contributor.author | Li, James | |
| dc.date.accessioned | 2021-03-02T22:53:32Z | |
| dc.date.available | 2021-03-02T22:53:32Z | |
| dc.identifier.citation | Li J., Sonmez A., Cataltepe Z., Bax E., "Validation of Network Classifiers", Joint IAPR International Workshop on Structural and Syntactic Pattern Recognition (SSPR) / International Workshop on Statistical Techniques in Pattern Recognition (SPR), Hiroshima, Japonya, 7 - 09 Kasım 2012, cilt.7626, ss.448-457 | |
| dc.identifier.other | vv_1032021 | |
| dc.identifier.other | av_0f4844f9-758c-4b9d-b02a-5afdf2a4248f | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12627/15812 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-642-34166-3_49 | |
| dc.description.abstract | This paper develops PAC (probably approximately correct) error bounds for network classifiers in the transductive setting, where the network node inputs and links are all known, the training nodes class labels are known, and the goal is to classify a working set of nodes that have unknown class labels. The bounds are valid for any model of network generation. They require working nodes to be selected independently, but not uniformly at random. For example, they allow different regions of the network to have different densities of unlabeled nodes. | |
| dc.language.iso | eng | |
| dc.subject | Biyoenformatik | |
| dc.subject | Mühendislik ve Teknoloji | |
| dc.subject | Bilgisayar Bilimleri | |
| dc.subject | Algoritmalar | |
| dc.subject | BİLGİSAYAR BİLİMİ, TEORİ VE YÖNTEM | |
| dc.subject | Mühendislik, Bilişim ve Teknoloji (ENG) | |
| dc.subject | Bilgisayar Bilimi | |
| dc.subject | BİLGİSAYAR BİLİMİ, YAPAY ZEKA | |
| dc.title | Validation of Network Classifiers | |
| dc.type | Bildiri | |
| dc.contributor.department | Cornell University , , | |
| dc.identifier.volume | 7626 | |
| dc.contributor.firstauthorID | 139087 | |
