Jun'ichi Takeuchi

Orcid: 0000-0002-5819-3082

Affiliations:
  • Kyushu University, Fukuoka, Graduate School of Information Science and Electrical Engineering


According to our database1, Jun'ichi Takeuchi authored at least 68 papers between 1991 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Brain Tumor Classification using Under-Sampled k-Space Data: A Deep Learning Approach.
IEICE Trans. Inf. Syst., November, 2023

Mitigate: Toward Comprehensive Research and Development for Analyzing and Combating IoT Malware.
IEICE Trans. Inf. Syst., September, 2023

Approximate spectral decomposition of Fisher information matrix for simple ReLU networks.
Neural Networks, July, 2023

Improved MDL Estimators Using Fiber Bundle of Local Exponential Families for Non-exponential Families.
CoRR, 2023

Consolidating Packet-Level Features for Effective Network Intrusion Detection: A Novel Session-Level Approach.
IEEE Access, 2023

Scalable and Fast Algorithm for Constructing Phylogenetic Trees With Application to IoT Malware Clustering.
IEEE Access, 2023

Towards Long-Term Continuous Tracing of Internet-Wide Scanning Campaigns Based on Darknet Analysis.
Proceedings of the 9th International Conference on Information Systems Security and Privacy, 2023

Towards Functional Analysis of IoT Malware Using Function Call Sequence Graphs and Clustering.
Proceedings of the 47th IEEE Annual Computers, Software, and Applications Conference, 2023

Work in Progress: New Seed Set Selection Method of the Scalable Method for Constructing Phylogenetic Trees.
Proceedings of the 20th ACM International Conference on Computing Frontiers, 2023

Packet-Level Intrusion Detection Using LSTM Focusing on Personal Information and Payloads.
Proceedings of the 18th Asia Joint Conference on Information Security, 2023

2022
Generating Labeled Training Datasets Towards Unified Network Intrusion Detection Systems.
IEEE Access, 2022

Dark-TRACER: Early Detection Framework for Malware Activity Based on Anomalous Spatiotemporal Patterns.
IEEE Access, 2022

Malicious Packet Classification Based on Neural Network Using Kitsune Features.
Proceedings of the Intelligent Systems and Pattern Recognition, 2022

On Fisher Information Matrix for Simple Neural Networks with Softplus Activation.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Poster: Flexible Function Estimation of IoT Malware Using Graph Embedding Technique.
Proceedings of the IEEE Symposium on Computers and Communications, 2022

2021
Leveraging Machine Learning Techniques to Identify Deceptive Decoy Documents Associated With Targeted Email Attacks.
IEEE Access, 2021

Automated Detection of Malware Activities Using Nonnegative Matrix Factorization.
Proceedings of the 20th IEEE International Conference on Trust, 2021

Investigating behavioral differences between IoT malware via function call sequence graphs.
Proceedings of the SAC '21: The 36th ACM/SIGAPP Symposium on Applied Computing, 2021

Designing Comprehensive Cyber Threat Analysis Platform: Can We Orchestrate Analysis Engines?
Proceedings of the 19th IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events, 2021

Scalable and Fast Hierarchical Clustering of IoT Malware Using Active Data Selection.
Proceedings of the Sixth International Conference on Fog and Mobile Edge Computing, 2021

Which Packet Did They Catch? Associating NIDS Alerts with Their Communication Sessions.
Proceedings of the 16th Asia Joint Conference on Information Security, 2021

2020
Minimum Description Length Principle in Supervised Learning With Application to Lasso.
IEEE Trans. Inf. Theory, 2020

Real-Time Detection of Global Cyberthreat Based on Darknet by Estimating Anomalous Synchronization Using Graphical Lasso.
IEICE Trans. Inf. Syst., 2020

On MDL Estimation for Simple Contaminated Gaussian Location Families.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

2019
Real-Time Detection of Malware Activities by Analyzing Darknet Traffic Using Graphical Lasso.
Proceedings of the 18th IEEE International Conference On Trust, 2019

Dynamics of Damped Approximate Message Passing Algorithms.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Improved MDL Estimators Using Local Exponential Family Bundles Applied to Mixture Families.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A Fast Algorithm for Constructing Phylogenetic Trees with Application to IoT Malware Clustering.
Proceedings of the Neural Information Processing - 26th International Conference, 2019

2018
An Improved Analysis of Least Squares Superposition Codes with Bernoulli Dictionary.
CoRR, 2018

A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization.
Comput. Optim. Appl., 2018

Asymptotic Behavior of Typical Sets and the Smallest High Probability Set.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

2017
A note on model selection for small sample regression.
Mach. Learn., 2017

Information geometry of the family of Markov kernels defined by a context tree.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

2016
An improved upper bound on block error probability of least squares superposition codes with unbiased Bernoulli dictionary.
Proceedings of the IEEE International Symposium on Information Theory, 2016

MDL Criterion for NMF with Application to Botnet Detection.
Proceedings of the Neural Information Processing - 23rd International Conference, 2016

Botnet Detection Using Graphical Lasso with Graph Density.
Proceedings of the Neural Information Processing - 23rd International Conference, 2016

Barron and Cover's Theory in Supervised Learning and its Application to Lasso.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2014
Least Squares Superposition Codes With Bernoulli Dictionary are Still Reliable at Rates up to Capacity.
IEEE Trans. Inf. Theory, 2014

Safe semi-supervised learning based on weighted likelihood.
Neural Networks, 2014

Stochastic Complexity for tree models.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Asymptotically minimax regret for models with hidden variables.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Properties of Jeffreys Mixture for Markov Sources.
IEEE Trans. Inf. Theory, 2013

A Behavior-based Method for Detecting Distributed Scan Attacks in Darknets.
J. Inf. Process., 2013

Asymptotically minimax regret by Bayes mixtures for non-exponential families.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Boundedness of modified multiplicative updates for nonnegative matrix factorization.
Proceedings of the 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2013

2012
A Behavior-Based Detection Method for Outbreaks of Low-Rate Attacks.
Proceedings of the 12th IEEE/IPSJ International Symposium on Applications and the Internet, 2012

Constant Markov Portfolio and its application to universal portfolio with side information.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Botnet Detection Based on Non-negative Matrix Factorization and the MDL Principle.
Proceedings of the Neural Information Processing - 19th International Conference, 2012

Information Theoretic Limit of Single-Frame Super-Resolution.
Proceedings of the 2012 Third International Conference on Emerging Security Technologies, 2012

2011
Acceleration technique for boosting classification and its application to face detection.
Proceedings of the 3rd Asian Conference on Machine Learning, 2011

Stochastic interpretation of universal portfolio and generalized target classes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
A note on model selection for small sample regression.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2009
Fisher information determinant and stochastic complexity for Markov models.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
An Incident Analysis System NICTER and Its Analysis Engines Based on Data Mining Techniques.
Proceedings of the Advances in Neuro-Information Processing, 15th International Conference, 2008

2007
Exponential Curvature of Markov Models.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
A Unifying Framework for Detecting Outliers and Change Points from Time Series.
IEEE Trans. Knowl. Data Eng., 2006

2005
α-parallel prior and its properties.
IEEE Trans. Inf. Theory, 2005

2004
On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms.
Data Min. Knowl. Discov., 2004

Mining traffic data from probe-car system for travel time prediction.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

2003
Distributed cooperative mining for information consortia.
Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24, 2003

2002
A unifying framework for detecting outliers and change points from non-stationary time series data.
Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2002

2001
Discovering outlier filtering rules from unlabeled data: combining a supervised learner with an unsupervised learner.
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, 2001

2000
The Lob-Pass Problem.
J. Comput. Syst. Sci., 2000

1998
Efficient Distribution-Free Population Learning of Simple Concepts.
Ann. Math. Artif. Intell., 1998

1995
Improved Sample Complexity Bounds for Parameter Estimation.
IEICE Trans. Inf. Syst., 1995

1993
The "lob-pass" Problem and an On-line Learning Model of Rational Choice.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993

1992
Some Improved Sample Complexity Bounds in the Probabilistic PAC Learning Model.
Proceedings of the Algorithmic Learning Theory, Third Workshop, 1992

1991
Polynomial Learnability of Probabilistic Concepts with Respect to the Kullback-Leibler Divergence.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991


  Loading...