Travelled to:
1 × Australia
1 × Spain
2 × Germany
4 × USA
Collaborated with:
∅ M.Minoh T.Toda T.Kudo H.Kashima H.Saigo N.Krämer A.Inokuchi S.Senda K.Ikeda C.Xiao J.Qin W.Wang Y.Ishikawa K.Sadakane Y.Baba Y.Nohara E.Kai P.P.Ghosh R.I.Maruf A.Ahmed M.Kuroda S.Inoue T.Hiramatsu M.Kimura S.Shimizu K.Kobayashi M.Sugiyama M.Blondel N.Ueda M.Kitsuregawa N.Nakashima
Talks about:
graph (4) regular (2) cluster (2) effici (2) mine (2) substructur (1) nonparametr (1) autocomplet (1) hypergraph (1) distribut (1)
Person: Koji Tsuda
DBLP: Tsuda:Koji
Contributed to:
Wrote 10 papers:
- KDD-2015-BabaKNKGIAKIHKS #low cost #predict
- Predictive Approaches for Low-Cost Preventive Medicine Program in Developing Countries (YB, HK, YN, EK, PPG, RIM, AA, MK, SI, TH, MK, SS, KK, KT, MS, MB, NU, MK, NN), pp. 1681–1690.
- SAC-2015-TodaT #performance #satisfiability
- BDD construction for all solutions SAT and efficient caching mechanism (TT, KT), pp. 1880–1886.
- VLDB-2013-XiaoQ0ITS #performance #query
- Efficient Error-tolerant Query Autocompletion (CX, JQ, WW, YI, KT, KS), pp. 373–384.
- KDD-2008-SaigoKT #graph #mining
- Partial least squares regression for graph mining (HS, NK, KT), pp. 578–586.
- ICML-2007-Tsuda #graph
- Entire regularization paths for graph data (KT), pp. 919–926.
- ICML-2006-TsudaK #clustering #graph #mining
- Clustering graphs by weighted substructure mining (KT, TK), pp. 953–960.
- ICML-2005-Tsuda
- Propagating distributions on a hypergraph by dual information regularization (KT), pp. 920–927.
- ICML-2003-KashimaTI #graph #kernel
- Marginalized Kernels Between Labeled Graphs (HK, KT, AI), pp. 321–328.
- ICDAR-1997-TsudaM #classification #parametricity
- A Nonparametric Density Model for Classification in a High Dimensional Space (KT, MM), pp. 1082–1087.
- ICDAR-v1-1995-TsudaSMI #clustering #database #documentation #image
- Clustering OCR-ed texts for browsing document image database (KT, SS, MM, KI), pp. 171–174.