default search action
Jun'ichi Takeuchi
Person information
- affiliation: Kyushu University, Fukuoka, Graduate School of Information Science and Electrical Engineering
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c48]Yoshinari Takeishi, Jun'ichi Takeuchi:
Risk Bound on MDL Estimator for Simple ReLU Networks. ISIT 2024: 256-261 - [i6]Jun'ichi Takeuchi, Andrew R. Barron:
Asymptotically Minimax Regret by Bayes Mixtures. CoRR abs/2406.17929 (2024) - [i5]Yoshinari Takeishi, Jun'ichi Takeuchi:
Risk Bounds on MDL Estimators for Linear Regression Models with Application to Simple ReLU Neural Networks. CoRR abs/2407.03854 (2024) - 2023
- [j23]Tianxiang He
, Chansu Han
Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering. IEEE Access 11: 8240-8253 (2023) - [j22]Kohei Miyamoto
Consolidating Packet-Level Features for Effective Network Intrusion Detection: A Novel Session-Level Approach. IEEE Access 11: 132792-132810 (2023) - [j21]Koji Nakao, Katsunari Yoshioka, Takayuki Sasaki, Rui Tanabe, Xuping Huang, Takeshi Takahashi, Akira Fujita, Jun'ichi Takeuchi, Noboru Murata
Mitigate: Toward Comprehensive Research and Development for Analyzing and Combating IoT Malware. IEICE Trans. Inf. Syst. 106(9): 1302-1315 (2023) - [j20]Tania Sultana, Sho Kurosaki, Yutaka Jitsumatsu, Shigehide Kuhara, Jun'ichi Takeuchi:
Brain Tumor Classification using Under-Sampled k-Space Data: A Deep Learning Approach. IEICE Trans. Inf. Syst. 106(11): 1831-1841 (2023) - [j19]Yoshinari Takeishi
Approximate spectral decomposition of Fisher information matrix for simple ReLU networks. Neural Networks 164: 691-706 (2023) - [c47]Shota Kawanaka, Yoshikatsu Kashiwabara, Kohei Miyamoto, Masazumi Iida, Chansu Han, Tao Ban, Takeshi Takahashi, Jun'ichi Takeuchi:
Packet-Level Intrusion Detection Using LSTM Focusing on Personal Information and Payloads. AsiaJCIS 2023: 88-94 - [c46]Tianxiang He
Work in Progress: New Seed Set Selection Method of the Scalable Method for Constructing Phylogenetic Trees. CF 2023: 364-365 - [c45]Kei Oshio, Satoshi Takada, Tianxiang He, Chansu Han, Akira Tanaka, Takeshi Takahashi, Jun'ichi Takeuchi:
Towards Functional Analysis of IoT Malware Using Function Call Sequence Graphs and Clustering. COMPSAC 2023: 1552-1557 - [c44]Chansu Han, Akira Tanaka, Jun'ichi Takeuchi, Takeshi Takahashi, Tomohiro Morikawa, Tsung-Nan Lin:
Towards Long-Term Continuous Tracing of Internet-Wide Scanning Campaigns Based on Darknet Analysis. ICISSP 2023: 617-625 - [i4]Kohei Miyamoto, Andrew R. Barron, Jun'ichi Takeuchi:
Improved MDL Estimators Using Fiber Bundle of Local Exponential Families for Non-exponential Families. CoRR abs/2311.03852 (2023) - 2022
- [j18]Chansu Han
Dark-TRACER: Early Detection Framework for Malware Activity Based on Anomalous Spatiotemporal Patterns. IEEE Access 10: 13038-13058 (2022) - [j17]Ryosuke Ishibashi, Kohei Miyamoto
Generating Labeled Training Datasets Towards Unified Network Intrusion Detection Systems. IEEE Access 10: 53972-53986 (2022) - [c43]Kei Oshio, Satoshi Takada, Chansu Han, Akira Tanaka, Jun'ichi Takeuchi:
Poster: Flexible Function Estimation of IoT Malware Using Graph Embedding Technique. ISCC 2022: 1-3 - [c42]Masazumi Iida, Yoshinari Takeishi, Jun'ichi Takeuchi:
On Fisher Information Matrix for Simple Neural Networks with Softplus Activation. ISIT 2022: 3001-3006 - [c41]Kohei Miyamoto, Hiroki Goto, Ryosuke Ishibashi, Chansu Han, Tao Ban, Takeshi Takahashi, Jun'ichi Takeuchi:
Malicious Packet Classification Based on Neural Network Using Kitsune Features. ISPR 2022: 306-314 - 2021
- [j16]Bo Sun, Tao Ban
Leveraging Machine Learning Techniques to Identify Deceptive Decoy Documents Associated With Targeted Email Attacks. IEEE Access 9: 87962-87971 (2021) - [c40]Ryosuke Ishibashi, Hiroki Goto, Chansu Han, Tao Ban, Takeshi Takahashi, Jun'ichi Takeuchi:
Which Packet Did They Catch? Associating NIDS Alerts with Their Communication Sessions. AsiaJCIS 2021: 9-16 - [c39]Tianxiang He, Chansu Han, Takeshi Takahashi, Shuji Kijima, Jun'ichi Takeuchi:
Scalable and Fast Hierarchical Clustering of IoT Malware Using Active Data Selection. FMEC 2021: 1-6 - [c38]Takeshi Takahashi, Yuki Umemura, Chansu Han, Tao Ban, Keisuke Furumoto, Ohnori Nakamura, Katsunari Yoshioka, Jun'ichi Takeuchi, Noboru Murata
Designing Comprehensive Cyber Threat Analysis Platform: Can We Orchestrate Analysis Engines? PerCom Workshops 2021: 376-379 - [c37]Reo Kawasoe, Chansu Han, Ryoichi Isawa, Takeshi Takahashi, Jun'ichi Takeuchi:
Investigating behavioral differences between IoT malware via function call sequence graphs. SAC 2021: 1674-1682 - [c36]Chansu Han, Jun'ichi Takeuchi, Takeshi Takahashi, Daisuke Inoue:
Automated Detection of Malware Activities Using Nonnegative Matrix Factorization. TrustCom 2021: 548-556 - [i3]Yoshinari Takeishi, Masazumi Iida, Jun'ichi Takeuchi:
Approximate Spectral Decomposition of Fisher Information Matrix for Simple ReLU Networks. CoRR abs/2111.15256 (2021) - 2020
- [j15]Chansu Han
Real-Time Detection of Global Cyberthreat Based on Darknet by Estimating Anomalous Synchronization Using Graphical Lasso. IEICE Trans. Inf. Syst. 103-D(10): 2113-2124 (2020) - [j14]Masanori Kawakita
Minimum Description Length Principle in Supervised Learning With Application to Lasso. IEEE Trans. Inf. Theory 66(7): 4245-4269 (2020) - [c35]Kohei Miyamoto, Jun'ichi Takeuchi:
On MDL Estimation for Simple Contaminated Gaussian Location Families. ISITA 2020: 587-591
2010 – 2019
- 2019
- [c34]Tianxiang He, Chansu Han
A Fast Algorithm for Constructing Phylogenetic Trees with Application to IoT Malware Clustering. ICONIP (1) 2019: 766-778 - [c33]Kohei Miyamoto
Improved MDL Estimators Using Local Exponential Family Bundles Applied to Mixture Families. ISIT 2019: 1442-1446 - [c32]Kazushi Mimura, Jun'ichi Takeuchi:
Dynamics of Damped Approximate Message Passing Algorithms. ITW 2019: 1-5 - [c31]Chansu Han
Real-Time Detection of Malware Activities by Analyzing Darknet Traffic Using Graphical Lasso. TrustCom/BigDataSE 2019: 144-151 - 2018
- [j13]Norikazu Takahashi
A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization. Comput. Optim. Appl. 71(1): 221-250 (2018) - [c30]Munenori Eto, Masanori Kawakita, Jun'ichi Takeuchi:
Asymptotic Behavior of Typical Sets and the Smallest High Probability Set. ISITA 2018: 717-721 - [i2]Yoshinari Takeishi, Jun'ichi Takeuchi:
An Improved Analysis of Least Squares Superposition Codes with Bernoulli Dictionary. CoRR abs/1801.02930 (2018) - 2017
- [j12]Masanori Kawakita
A note on model selection for small sample regression. Mach. Learn. 106(11): 1839-1862 (2017) - [c29]Jun'ichi Takeuchi, Hiroshi Nagaoka:
Information geometry of the family of Markov kernels defined by a context tree. ITW 2017: 429-433 - 2016
- [c28]Masanori Kawakita, Jun'ichi Takeuchi:
Barron and Cover's Theory in Supervised Learning and its Application to Lasso. ICML 2016: 1958-1966 - [c27]Chansu Han
Botnet Detection Using Graphical Lasso with Graph Density. ICONIP (1) 2016: 537-545 - [c26]Shoma Tanaka, Yuki Kawamura, Masanori Kawakita, Noboru Murata
MDL Criterion for NMF with Application to Botnet Detection. ICONIP (1) 2016: 570-578 - [c25]Yoshinari Takeishi, Jun'ichi Takeuchi:
An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary. ISIT 2016: 1168-1172 - [i1]Masanori Kawakita, Jun'ichi Takeuchi:
Minimum Description Length Principle in Supervised Learning with Application to Lasso. CoRR abs/1607.02914 (2016) - 2014
- [j11]Masanori Kawakita, Jun'ichi Takeuchi:
Safe semi-supervised learning based on weighted likelihood. Neural Networks 53: 146-164 (2014) - [j10]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) - [c24]Jun'ichi Takeuchi, Andrew R. Barron:
Asymptotically minimax regret for models with hidden variables. ISIT 2014: 3037-3041 - [c23]Jun'ichi Takeuchi, Andrew R. Barron:
Stochastic Complexity for tree models. ITW 2014: 222-226 - 2013
- [j9]Yaokai Feng, Yoshiaki Hori, Kouichi Sakurai, Jun'ichi Takeuchi:
A Behavior-based Method for Detecting Distributed Scan Attacks in Darknets. Inf. Media Technol. 8(3): 843-854 (2013) - [j8]Yaokai Feng, Yoshiaki Hori, Kouichi Sakurai, Jun'ichi Takeuchi:
A Behavior-based Method for Detecting Distributed Scan Attacks in Darknets. J. Inf. Process. 21(3): 527-538 (2013) - [j7]Jun'ichi Takeuchi, Tsutomu Kawabata, Andrew R. Barron:
Properties of Jeffreys Mixture for Markov Sources. IEEE Trans. Inf. Theory 59(1): 438-457 (2013) - [c22]Jiro Katayama, Norikazu Takahashi, Jun'ichi Takeuchi:
Boundedness of modified multiplicative updates for nonnegative matrix factorization. CAMSAP 2013: 252-255 - [c21]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 - [c20]Jun'ichi Takeuchi, Andrew R. Barron:
Asymptotically minimax regret by Bayes mixtures for non-exponential families. ITW 2013: 1-5 - 2012
- [c19]Kotaro Yamaguchi, Masanori Kawakita, Norikazu Takahashi
Information Theoretic Limit of Single-Frame Super-Resolution. EST 2012: 82-85 - [c18]Sayaka Yamauchi, Masanori Kawakita, Jun'ichi Takeuchi:
Botnet Detection Based on Non-negative Matrix Factorization and the MDL Principle. ICONIP (5) 2012: 400-409 - [c17]Mariko Tsurusaki, Jun'ichi Takeuchi:
Constant Markov Portfolio and its application to universal portfolio with side information. ISIT 2012: 1623-1627 - [c16]Yaokai Feng, Yoshiaki Hori, Kouichi Sakurai, Jun'ichi Takeuchi:
A Behavior-Based Detection Method for Outbreaks of Low-Rate Attacks. SAINT 2012: 267-272 - 2011
- [c15]Mariko Tsurusaki, Jun'ichi Takeuchi:
Stochastic interpretation of universal portfolio and generalized target classes. ISIT 2011: 390-394 - [c14]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
- [c13]Masanori Kawakita, Yoko Oie, Jun'ichi Takeuchi:
A note on model selection for small sample regression. ISITA 2010: 112-117
2000 – 2009
- 2009
- [c12]Jun'ichi Takeuchi:
Fisher information determinant and stochastic complexity for Markov models. ISIT 2009: 1894-1898 - 2008
- [c11]Daisuke Inoue, Katsunari Yoshioka
An Incident Analysis System NICTER and Its Analysis Engines Based on Data Mining Techniques. ICONIP (1) 2008: 579-586 - 2007
- [c10]Jun'ichi Takeuchi, Tsutomu Kawabata:
Exponential Curvature of Markov Models. ISIT 2007: 2891-2895 - 2006
- [j6]Jun'ichi Takeuchi, Kenji Yamanishi:
A Unifying Framework for Detecting Outliers and Change Points from Time Series. IEEE Trans. Knowl. Data Eng. 18(4): 482-492 (2006) - 2005
- [j5]Jun'ichi Takeuchi, Shun-ichi Amari:
α-parallel prior and its properties. IEEE Trans. Inf. Theory 51(3): 1011-1023 (2005) - 2004
- [j4]Kenji Yamanishi, Jun'ichi Takeuchi, Graham J. Williams, Peter Milne:
On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms. Data Min. Knowl. Discov. 8(3): 275-300 (2004) - [c9]Takayuki Nakata, Jun'ichi Takeuchi:
Mining traffic data from probe-car system for travel time prediction. KDD 2004: 817-822 - 2003
- [c8]Satoshi Morinaga, Kenji Yamanishi, Jun'ichi Takeuchi:
Distributed cooperative mining for information consortia. KDD 2003: 619-624 - 2002
- [c7]Kenji Yamanishi, Jun'ichi Takeuchi:
A unifying framework for detecting outliers and change points from non-stationary time series data. KDD 2002: 676-681 - 2001
- [c6]Kenji Yamanishi, Jun'ichi Takeuchi:
Discovering outlier filtering rules from unlabeled data: combining a supervised learner with an unsupervised learner. KDD 2001: 389-394 - 2000
- [j3]Jun'ichi Takeuchi, Naoki Abe, Shun-ichi Amari:
The Lob-Pass Problem. J. Comput. Syst. Sci. 61(3): 523-557 (2000) - [c5]Kenji Yamanishi, Jun'ichi Takeuchi, Graham J. Williams, Peter Milne:
On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms. KDD 2000: 320-324
1990 – 1999
- 1998
- [j2]Atsuyoshi Nakamura, Jun'ichi Takeuchi, Naoki Abe:
Efficient Distribution-Free Population Learning of Simple Concepts. Ann. Math. Artif. Intell. 23(1-2): 53-82 (1998) - 1995
- [j1]Jun'ichi Takeuchi:
Improved Sample Complexity Bounds for Parameter Estimation. IEICE Trans. Inf. Syst. 78-D(5): 526-531 (1995) - 1994
- [c4]Atsuyoshi Nakamura, Naoki Abe, Jun'ichi Takeuchi:
Efficient Distribution-free Population Learning of Simple Concepts. AII/ALT 1994: 500-515 - 1993
- [c3]Naoki Abe, Jun'ichi Takeuchi:
The "lob-pass" Problem and an On-line Learning Model of Rational Choice. COLT 1993: 422-428 - 1992
- [c2]Jun'ichi Takeuchi:
Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model. ALT 1992: 208-219 - 1991
- [c1]Naoki Abe, Manfred K. Warmuth, Jun'ichi Takeuchi:
Polynomial Learnability of Probabilistic Concepts with Respect to the Kullback-Leibler Divergence. COLT 1991: 277-289
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-10-13 18:02 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: