default search action
Masanori Kawakita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j6]Masanori Kawakita, Jun'ichi Takeuchi:
Minimum Description Length Principle in Supervised Learning With Application to Lasso. IEEE Trans. Inf. Theory 66(7): 4245-4269 (2020)
2010 – 2019
- 2019
- [c10]Chansu Han, Jumpei Shimamura, Takeshi Takahashi, Daisuke Inoue, Masanori Kawakita, Jun'ichi Takeuchi, Koji Nakao:
Real-Time Detection of Malware Activities by Analyzing Darknet Traffic Using Graphical Lasso. TrustCom/BigDataSE 2019: 144-151 - 2018
- [c9]Munenori Eto, Masanori Kawakita, Jun'ichi Takeuchi:
Asymptotic Behavior of Typical Sets and the Smallest High Probability Set. ISITA 2018: 717-721 - 2017
- [j5]Masanori Kawakita, Jun'ichi Takeuchi:
A note on model selection for small sample regression. Mach. Learn. 106(11): 1839-1862 (2017) - 2016
- [c8]Masanori Kawakita, Jun'ichi Takeuchi:
Barron and Cover's Theory in Supervised Learning and its Application to Lasso. ICML 2016: 1958-1966 - [c7]Chansu Han, Kento Kono, Shoma Tanaka, Masanori Kawakita, Jun'ichi Takeuchi:
Botnet Detection Using Graphical Lasso with Graph Density. ICONIP (1) 2016: 537-545 - [c6]Shoma Tanaka, Yuki Kawamura, Masanori Kawakita, Noboru Murata, Jun'ichi Takeuchi:
MDL Criterion for NMF with Application to Botnet Detection. ICONIP (1) 2016: 570-578 - [i1]Masanori Kawakita, Jun'ichi Takeuchi:
Minimum Description Length Principle in Supervised Learning with Application to Lasso. CoRR abs/1607.02914 (2016) - 2014
- [j4]Masanori Kawakita, Jun'ichi Takeuchi:
Safe semi-supervised learning based on weighted likelihood. Neural Networks 53: 146-164 (2014) - [j3]Yoshinari Takeishi, Masanori Kawakita, Jun'ichi Takeuchi:
Least Squares Superposition Codes With Bernoulli Dictionary are Still Reliable at Rates up to Capacity. IEEE Trans. Inf. Theory 60(5): 2737-2750 (2014) - 2013
- [j2]Masanori Kawakita, Takafumi Kanamori:
Semi-supervised learning with density-ratio estimation. Mach. Learn. 91(2): 189-209 (2013) - [c5]Yoshinari Takeishi, Masanori Kawakita, Jun'ichi Takeuchi:
Least squares superposition codes with Bernoulli dictionary are still reliable at rates up to capacity. ISIT 2013: 1396-1400 - 2012
- [c4]Kotaro Yamaguchi, Masanori Kawakita, Norikazu Takahashi, Jun'ichi Takeuchi:
Information Theoretic Limit of Single-Frame Super-Resolution. EST 2012: 82-85 - [c3]Sayaka Yamauchi, Masanori Kawakita, Jun'ichi Takeuchi:
Botnet Detection Based on Non-negative Matrix Factorization and the MDL Principle. ICONIP (5) 2012: 400-409 - 2011
- [c2]Masanori Kawakita, Ryota Izumi, Jun'ichi Takeuchi, Yi Hu, Tetsuya Takamori, Hirokazu Kameyama:
Acceleration technique for boosting classification and its application to face detection. ACML 2011: 335-349 - 2010
- [c1]Masanori Kawakita, Yoko Oie, Jun'ichi Takeuchi:
A note on model selection for small sample regression. ISITA 2010: 112-117
2000 – 2009
- 2008
- [j1]Masanori Kawakita, Shinto Eguchi:
Boosting Method for Local Learning in Statistical Pattern Recognition. Neural Comput. 20(11): 2792-2838 (2008)
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-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint