6,646 research outputs found

    Classifying Network Data with Deep Kernel Machines

    Full text link
    Inspired by a growing interest in analyzing network data, we study the problem of node classification on graphs, focusing on approaches based on kernel machines. Conventionally, kernel machines are linear classifiers in the implicit feature space. We argue that linear classification in the feature space of kernels commonly used for graphs is often not enough to produce good results. When this is the case, one naturally considers nonlinear classifiers in the feature space. We show that repeating this process produces something we call "deep kernel machines." We provide some examples where deep kernel machines can make a big difference in classification performance, and point out some connections to various recent literature on deep architectures in artificial intelligence and machine learning

    catena-Poly[[[aqua­chlorido­manganese(II)]-bis­[μ-1,1′-(oxydi-p-phenyl­ene)di-1H-imidazole-κ2 N 3:N 3′]] chloride dimethyl­formamide mono­solvate monohydrate]

    Get PDF
    The title coordination polymer, {[MnCl(C18H14N4O)2(H2O)]Cl·C3H7NO·H2O}n, obtained by the solvothermal reaction of BIDPE and manganese(II) salt in H2O/DMF (DMF is dimethyl­formamide), is composed of a chain of [Mn2(BIDPE)2] [BIDPE is 1,1′-(oxydi-p-phenyl­ene)di-1H-imidazole] metallocyclic rings that exhibit inversion symmetry. The coordination about the Mn(II) ions is distorted octahedral with a MnClN4O coordination set. In the crystal, the polymeric chains are linked by O—H⋯Cl hydrogen bonds, forming a two-dimensional network parallel to (100). A number of C—H⋯Cl and C—H⋯O inter­actions are also present
    • …
    corecore