default search action
Yoshitatsu Matsuda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i2]Yoshitatsu Matsuda, Kazunori Yamaguch:
Efficient Estimation of Unique Components in Independent Component Analysis by Matrix Representation. CoRR abs/2408.17118 (2024) - 2022
- [c37]Takayuki Sekiya, Yoshitatsu Matsuda, Kazunori Yamaguchi
:
Improvements of a Hybrid Syllabus Search Tool by Syllabus-related Heuristics. FIE 2022: 1-8 - [c36]Kazunori Yamaguchi
Averaging Solution of Differential Equations as Value for Argumentation Graph with Similarity. KES 2022: 614-623 - 2021
- [c35]Takayuki Sekiya, Tomohiro Tatejima, Yoshitatsu Matsuda, Kazunori Yamaguchi
A Proposal for a Hybrid Syllabus Search Tool that Combines Keyword Search and Content Based Classification. EDUCON 2021: 398-403 - [c34]Kazunori Yamaguchi
Cost-based Framework for Natural Language Argumentation Analysis. ITHET 2021: 1-10 - [c33]Taisuke Kawamata
Analysis of Computer Science Textbooks by Topic Modeling and Dynamic Time Warping. TALE 2021: 865-870 - 2020
- [c32]Yoshitatsu Matsuda:
Optimization of Search Space for Finding Very Short Lattice Vectors. IWSEC 2020: 149-161
2010 – 2019
- 2019
- [c31]Yoshitatsu Matsuda, Tadanori Teruya, Kenji Kashiwabara:
Efficient Estimation of Number of Short Lattice Vectors in Search Space under Randomness Assumption. APKC@AsiaCCS 2019: 13-22 - [c30]Takayuki Sekiya, Yoshitatsu Matsuda, Kazunori Yamaguchi
Investigation on University Websites for Semi-automated Syllabus Crawling. FIE 2019: 1-7 - 2018
- [j9]Yoshitatsu Matsuda, Takayuki Sekiya, Kazunori Yamaguchi
Curriculum Analysis of Computer Science Departments by Simplified, Supervised LDA. J. Inf. Process. 26: 497-508 (2018) - [j8]Yoshitatsu Matsuda
A Unifying Objective Function of Independent Component Analysis for Ordering Sources by Non-Gaussianity. IEEE Trans. Neural Networks Learn. Syst. 29(11): 5630-5642 (2018) - [i1]Yoshitatsu Matsuda, Tadanori Teruya, Kenji Kashiwabara:
Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation. IACR Cryptol. ePrint Arch. 2018: 815 (2018) - 2017
- [c29]Takayuki Sekiya, Yoshitatsu Matsuda, Kazunori Yamaguchi
A web-based curriculum engineering tool for investigating syllabi in topic space of standard computer science curricula. FIE 2017: 1-9 - [c28]Yoshitatsu Matsuda, Kazunori Yamaguchi
Efficient Optimization of the Adaptive ICA Function with Estimating the Number of Non-Gaussian Sources. LVA/ICA 2017: 469-478 - [c27]Yoshitatsu Matsuda, Takayuki Sekiya, Kazunori Yamaguchi
Discovery of Interconnection Among Knowledge Areas of Standard Computer Science Curricula by a Data Science Approach. ICONIP (5) 2017: 186-195 - 2016
- [c26]Yoshitatsu Matsuda, Kazunori Yamaguchi
Gram-Schmidt Orthonormalization to the Adaptive ICA Function for Fixing the Permutation Ambiguity. ICONIP (2) 2016: 152-159 - [c25]Yoshitatsu Matsuda, Kazunori Yamaguchi
Adaptive objective function of ICA by Gaussian approximation in second-order polynomial feature space. IJCNN 2016: 2382-2389 - [c24]Ken-ichiro Nishioka, Yoshitatsu Matsuda, Kazunori Yamaguchi
User Location Prediction by Diffusion-Type Estimation Using Location-Based SNS Check-in Data. iThings/GreenCom/CPSCom/SmartData 2016: 14-19 - 2015
- [j7]Yoshitatsu Matsuda, Kazunori Yamaguchi
Discovery of Regular and Irregular Spatio-Temporal Patterns from Location-Based SNS by Diffusion-Type Estimation. IEICE Trans. Inf. Syst. 98-D(9): 1675-1682 (2015) - [c23]Yoshitatsu Matsuda, Kazunori Yamaguchi
Objective Function of ICA with Smooth Estimation of Kurtosis. ICONIP (3) 2015: 164-171 - [c22]Ken-ichiro Nishioka, Yoshitatsu Matsuda, Kazunori Yamaguchi
Discovery of localized spatio-temporal patterns from location-based SNS by clustering users. IJCNN 2015: 1-8 - [c21]Takayuki Sekiya, Yoshitatsu Matsuda, Kazunori Yamaguchi
Curriculum analysis of CS departments based on CS2013 by simplified, supervised LDA. LAK 2015: 330-339 - 2014
- [c20]Yoshitatsu Matsuda, Kazunori Yamaguchi
Discovery of Spatio-Temporal Patterns from Foursquare by Diffusion-type Estimation and ICA. ICANN 2014: 765-772 - [c19]Ikumi Horie, Kazunori Yamaguchi
Improvement of difficulty estimation of personalized teaching material generator by JACET. ITHET 2014: 1-8 - 2013
- [c18]Yoshitatsu Matsuda, Kazunori Yamaguchi
Ensemble Joint Approximate Diagonalization by an Information Theoretic Approach. ICONIP (3) 2013: 309-316 - 2012
- [j6]Yoshitatsu Matsuda, Kazunori Yamaguchi
Global Mapping Analysis: Stochastic Gradient Algorithm in Multidimensional Scaling. IEICE Trans. Inf. Syst. 95-D(2): 596-603 (2012) - [c17]Yoshitatsu Matsuda, Kazunori Yamaguchi
A Robust Objective Function of Joint Approximate Diagonalization. ICANN (2) 2012: 205-212 - 2011
- [j5]Yoshitatsu Matsuda, Kazunori Yamaguchi
An adaptive threshold in joint approximate diagonalization by assuming exponentially distributed errors. Neurocomputing 74(11): 1994-2001 (2011) - [c16]Yoshitatsu Matsuda, Kazunori Yamaguchi
An Information Theoretic Approach to Joint Approximate Diagonalization. ICONIP (1) 2011: 20-27 - 2010
- [c15]Yoshitatsu Matsuda, Kazunori Yamaguchi
Partial Extraction of Edge Filters by Cumulant-Based ICA under Highly Overcomplete Model. ICONIP (2) 2010: 633-640 - [c14]Yoshitatsu Matsuda, Kazunori Yamaguchi
A probabilistic framework for joint approximate diagonalization. IJCNN 2010: 1-6 - [c13]Takayuki Sekiya, Yoshitatsu Matsuda, Kazunori Yamaguchi
Analysis of computer science related curriculum on LDA and Isomap. ITiCSE 2010: 48-52
2000 – 2009
- 2009
- [j4]Yoshitatsu Matsuda, Kazunori Yamaguchi
Linear Multilayer ICA Using Adaptive PCA. Neural Process. Lett. 30(2): 133-144 (2009) - [c12]Yoshitatsu Matsuda, Kazunori Yamaguchi
Joint Approximate Diagonalization Utilizing AIC-Based Decision in the Jacobi Method. ICANN (2) 2009: 135-144 - [c11]Yoshitatsu Matsuda, Kazunori Yamaguchi
An Adaptive Threshold in Joint Approximate Diagonalization by the Information Criterion. ICONIP (1) 2009: 204-211 - [c10]Yoshitatsu Matsuda, Kazunori Yamaguchi
A simple overcomplete ICA algorithm by non-orthogonal pair optimizations. IJCNN 2009: 2027-2031 - 2008
- [c9]Yoshitatsu Matsuda, Kazunori Yamaguchi
An Overcomplete ICA Algorithm by InfoMax and InfoMin. ICANN (1) 2008: 136-144 - [c8]Yoshitatsu Matsuda, Kazunori Yamaguchi
A connection-limited neural network by InfoMax and InfoMin. IJCNN 2008: 2531-2537 - 2007
- [j3]Yoshitatsu Matsuda, Kazunori Yamaguchi
Linear Multilayer ICA Generating Hierarchical Edge Detectors. Neural Comput. 19(1): 218-230 (2007) - [c7]Yoshitatsu Matsuda, Kazunori Yamaguchi
Extraction of Approximate Independent Components from Large Natural Scenes. ICONIP (1) 2007: 635-642 - 2006
- [c6]Yoshitatsu Matsuda, Kazunori Yamaguchi
The InfoMin Principle for ICA and Topographic Mappings. ICA 2006: 958-965 - [c5]Yoshitatsu Matsuda, Kazunori Yamaguchi
A Fixed-Point Algorithm of Topographic ICA. ICANN (2) 2006: 587-594 - 2005
- [j2]Yoshitatsu Matsuda, Kazunori Yamaguchi:
An efficient MDS-based topographic mapping algorithm. Neurocomputing 64: 285-299 (2005) - [c4]Yoshitatsu Matsuda, Kazunori Yamaguchi
An Efficient MDS Algorithm for the Analysis of Massive Document Collections. KES (2) 2005: 1015-1021 - 2004
- [c3]Yoshitatsu Matsuda, Kazunori Yamaguchi
Linear Multilayer Independent Component Analysis Using Stochastic Gradient Algorithm. ICA 2004: 303-310 - [c2]Yoshitatsu Matsuda, Kazunori Yamaguchi:
Linear Multilayer Independent Component Analysis for Large Natural Scenes. NIPS 2004: 897-904 - 2003
- [c1]Yoshitatsu Matsuda, Kazunori Yamaguchi
The InfoMin Criterion: An Information Theoretic Unifying Objective Function for Topographic Mappings. ICANN 2003: 401-408 - 2001
- [j1]Yoshitatsu Matsuda, Kazunori Yamaguchi:
Global Mapping Analysis: Stochastic Approximation for Multidimensional Scaling. Int. J. Neural Syst. 11(5): 419-426 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: