Hiroshi Mamitsuka

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On convex clustering: convexity, bounding balls and characteristics Machine Learning	2026-03-26	Paper
Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels Machine Learning	2022-01-28	Paper
Machine learning for metabolic identification Creative Complex Systems	2022-01-18	Paper
Reshaped tensor nuclear norms for higher order tensor completion Machine Learning	2021-11-24	Paper
Convex coupled matrix and tensor completion Neural Computation	2021-10-12	Paper
Convex coupled matrix and tensor completion Neural Computation	2021-10-12	Paper
Scaled Coupled Norms and Coupled Higher-Order Tensor Completion Neural Computation	2020-11-02	Paper
Gene-proximity models for genome-wide association studies The Annals of Applied Statistics	2017-09-15	Paper
Some properties of a dissimilarity measure for labeled graphs	2017-07-24	Paper
Adaptive edge weighting for graph-based learning algorithms Machine Learning	2017-06-30	Paper
Mining approximate patterns with frequent locally optimal occurrences Discrete Applied Mathematics	2016-01-21	Paper
Fast algorithms for finding a minimum repetition representation of strings and trees Discrete Applied Mathematics	2014-04-16	Paper
A new dissimilarity measure for comparing labeled graphs Linear Algebra and its Applications	2013-02-22	Paper
Efficiently mining \(\delta \)-tolerance closed frequent subgraphs Machine Learning	2012-05-08	Paper
Efficient semi-supervised learning on locally informative multiple graphs Pattern Recognition	2011-12-07	Paper
On network-based kernel methods for protein-protein interactions with applications in protein functions prediction Journal of Systems Science and Complexity	2011-04-05	Paper
A spectral approach to clustering numerical vectors as nodes in a network Pattern Recognition	2010-12-23	Paper
Finding the maximum common subgraph of a partial \(k\)-tree and a graph with a polynomially bounded number of spanning trees Information Processing Letters	2009-08-27	Paper
Algorithms and Computation Lecture Notes in Computer Science	2009-08-07	Paper
Selecting features in microarray classification using roc curves Pattern Recognition	2006-11-15	Paper
EFFICIENT UNSUPERVISED MINING FROM NOISY CO-OCCURRENCE DATA New Mathematics and Natural Computation	2005-06-21	Paper
scientific article; zbMATH DE number 2086335 (Why is no real title available?)	2004-08-11	Paper
scientific article; zbMATH DE number 1934568 (Why is no real title available?)	2003-06-25	Paper

Research outcomes over time

This page was built for person: Hiroshi Mamitsuka