Please use this identifier to cite or link to this item:
|Title:||Information theoretic feature selection for Weisfeiler-Lehman graph kernels||Authors:||Tan, M.||Issue Date:||2013||Source:||5th International Conference on Bioinformatics and Computational Biology 2013, BICoB 2013, 4 March 2013 through 6 March 2013, Honolulu, HI, 99133||Abstract:||Classification of structured data has gained importance recently. One important problem that exploits structured data is to computationally estimate some properties of small molecules. Among the algorithms for graph classification, kernel machines constitute a large portion. Although there are a number of graph kernels proposed in the literature, feature selection has only recently been considered in this domain. In this paper, we propose a feature selection method based on permutation tests, which not only improves the classification performance, but also provides space efficiency by eliminating uninformative features at the beginning. We demonstrate the performance of the method on a number of data sets in chemical compound classification.||URI:||https://hdl.handle.net/20.500.11851/5787||ISBN:||9781622769711|
|Appears in Collections:||Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering|
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Show full item record
checked on Dec 26, 2022
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.