default search action
Shin Matsushima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Masatoshi Kobayashi, Kohei Miyaguchi, Shin Matsushima:
Detection of Unobserved Common Causes based on NML Code in Discrete, Mixed, and Continuous Variables. CoRR abs/2403.06499 (2024) - 2022
- [c17]Masatoshi Kobayashi, Kohei Miyaguchi, Shin Matsushima:
Detection of Unobserved Common Cause in Discrete Data Based on the MDL Principle. IEEE Big Data 2022: 45-54 - [i7]Toyotaro Suzumura, Akiyoshi Sugiki, Hiroyuki Takizawa, Akira Imakura, Hiroshi Nakamura
, Kenjiro Taura, Tomohiro Kudoh, Toshihiro Hanawa, Yuji Sekiya, Hill Hiroki Kobayashi, Shin Matsushima, Yohei Kuga, Ryo Nakamura, Renhe Jiang, Junya Kawase, Masatoshi Hanai, Hiroshi Miyazaki, Tsutomu Ishizaki, Daisuké Shimotoku, Daisuke Miyamoto, Kento Aida, Atsuko Takefusa, Takashi Kurimoto, Koji Sasayama, Naoya Kitagawa, Ikki Fujiwara, Yusuke Tanimura, Takayuki Aoki, Toshio Endo, Satoshi Ohshima, Keiichiro Fukazawa, Susumu Date
mdx: A Cloud Platform for Supporting Data Science and Cross-Disciplinary Research Collaborations. CoRR abs/2203.14188 (2022) - 2020
- [j4]Taito Lee
Grafting for combinatorial binary model using frequent itemset mining. Data Min. Knowl. Discov. 34(1): 101-123 (2020) - [c16]Shota Hayashi, Mahito Sugiyama, Shin Matsushima:
Coordinate Descent Method for Log-linear Model on Posets. DSAA 2020: 99-108
2010 – 2019
- 2019
- [j3]Yunhui Fu, Shin Matsushima
Model Selection for Non-Negative Tensor Factorization with Minimum Description Length. Entropy 21(7): 632 (2019) - [c15]Parameswaran Raman, Sriram Srinivasan, Shin Matsushima, Xinhua Zhang, Hyokun Yun, S. V. N. Vishwanathan:
Scaling Multinomial Logistic Regression via Hybrid Parallelism. KDD 2019: 1460-1470 - [c14]Shin Matsushima, Maria Brbic:
Selective Sampling-based Scalable Sparse Subspace Clustering. NeurIPS 2019: 12416-12425 - 2018
- [j2]Koichi Moriya, Shin Matsushima
Traffic Risk Mining From Heterogeneous Road Statistics. IEEE Trans. Intell. Transp. Syst. 19(11): 3662-3675 (2018) - [i6]Shin Matsushima:
Statistical Learnability of Generalized Additive Models based on Total Variation Regularization. CoRR abs/1802.03001 (2018) - 2017
- [c13]Tatsuru Kobayashi, Shin Matsushima, Taito Lee, Kenji Yamanishi
Discovering potential traffic risks in Japan using a supervised learning approach. IEEE BigData 2017: 948-955 - [c12]Shin Matsushima, Hyokun Yun, Xinhua Zhang, S. V. N. Vishwanathan:
Distributed Stochastic Optimization of Regularized Risk via Saddle-Point Problem. ECML/PKDD (1) 2017: 460-476 - [c11]Kohei Miyaguchi, Shin Matsushima, Kenji Yamanishi
Sparse Graphical Modeling via Stochastic Complexity. SDM 2017: 723-731 - [i5]Taito Lee, Shin Matsushima, Kenji Yamanishi:
Grafting for Combinatorial Boolean Model using Frequent Itemset Mining. CoRR abs/1711.02478 (2017) - 2016
- [c10]Akihiro Demachi, Shin Matsushima, Kenji Yamanishi
Web Behavior Analysis Using Sparse Non-Negative Matrix Factorization. DSAA 2016: 574-583 - [c9]Taito Lee, Shin Matsushima, Kenji Yamanishi
Traffic Risk Mining Using Partially Ordered Non-Negative Matrix Factorization. DSAA 2016: 622-631 - [c8]Shihao Ji
WordRank: Learning Word Embeddings via Robust Ranking. EMNLP 2016: 658-668 - [c7]Shin Matsushima:
Asynchronous Feature Extraction for Large-Scale Linear Predictors. ECML/PKDD (1) 2016: 604-618 - [i4]Parameswaran Raman, Shin Matsushima, Xinhua Zhang, Hyokun Yun, S. V. N. Vishwanathan:
DS-MLR: Exploiting Double Separability for Scaling up Distributed Multinomial Logistic Regression. CoRR abs/1604.04706 (2016) - 2015
- [c6]Koichi Moriya, Shin Matsushima, Kenji Yamanishi
Traffic risk mining from heterogeneous road statistics. DSAA 2015: 1-10 - [i3]Vasil S. Denchev, Nan Ding, Shin Matsushima, S. V. N. Vishwanathan, Hartmut Neven:
Totally Corrective Boosting with Cardinality Penalization. CoRR abs/1504.01446 (2015) - [i2]Shihao Ji, Hyokun Yun, Pinar Yanardag, Shin Matsushima, S. V. N. Vishwanathan:
WordRank: Learning Word Embeddings via Robust Ranking. CoRR abs/1506.02761 (2015) - 2014
- [j1]Hidekazu Oiwa, Shin Matsushima, Hiroshi Nakagawa:
Feature-aware regularization for sparse online learning. Sci. China Inf. Sci. 57(5): 1-21 (2014) - [i1]Shin Matsushima, Hyokun Yun, S. V. N. Vishwanathan:
Distributed Stochastic Optimization of the Regularized Risk. CoRR abs/1406.4363 (2014) - 2012
- [c5]Hidekazu Oiwa, Shin Matsushima, Hiroshi Nakagawa:
Healing Truncation Bias: Self-Weighted Truncation Framework for Dual Averaging. ICDM 2012: 575-584 - [c4]Shin Matsushima, S. V. N. Vishwanathan, Alexander J. Smola:
Linear support vector machines via dual cached loops. KDD 2012: 177-185 - 2011
- [c3]Hidekazu Oiwa, Shin Matsushima, Hiroshi Nakagawa:
Frequency-Aware Truncated Methods for Sparse Online Learning. ECML/PKDD (2) 2011: 533-548 - 2010
- [c2]Minoru Yoshida, Shin Matsushima, Shingo Ono, Issei Sato, Hiroshi Nakagawa:
ITC-UT: Tweet Categorization by Query Categorization for On-line Reputation Management. CLEF (Notebook Papers/LABs/Workshops) 2010 - [c1]Shin Matsushima, Nobuyuki Shimizu, Kazuhiro Yoshida, Takashi Ninomiya, Hiroshi Nakagawa:
Exact Passive-Aggressive Algorithm for Multiclass Classification Using Support Class. SDM 2010: 303-314
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 2025-01-09 12:49 CET 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: