4,242 research outputs found
Kernel matrix regression
We address the problem of filling missing entries in a kernel Gram matrix,
given a related full Gram matrix. We attack this problem from the viewpoint of
regression, assuming that the two kernel matrices can be considered as
explanatory variables and response variables, respectively. We propose a
variant of the regression model based on the underlying features in the
reproducing kernel Hilbert space by modifying the idea of kernel canonical
correlation analysis, and we estimate the missing entries by fitting this model
to the existing samples. We obtain promising experimental results on gene
network inference and protein 3D structure prediction from genomic datasets. We
also discuss the relationship with the em-algorithm based on information
geometry
Grafting for Combinatorial Boolean Model using Frequent Itemset Mining
This paper introduces the combinatorial Boolean model (CBM), which is defined
as the class of linear combinations of conjunctions of Boolean attributes. This
paper addresses the issue of learning CBM from labeled data. CBM is of high
knowledge interpretability but na\"{i}ve learning of it requires exponentially
large computation time with respect to data dimension and sample size. To
overcome this computational difficulty, we propose an algorithm GRAB (GRAfting
for Boolean datasets), which efficiently learns CBM within the
-regularized loss minimization framework. The key idea of GRAB is to
reduce the loss minimization problem to the weighted frequent itemset mining,
in which frequent patterns are efficiently computable. We employ benchmark
datasets to empirically demonstrate that GRAB is effective in terms of
computational efficiency, prediction accuracy and knowledge discovery
- …