Atsuyoshi Nakamura

CoRR, 2023

Differentially Private Streaming Data Release Under Temporal Correlations via Post-processing.

[BibT_eX]

[DOI]

Proceedings of the Data and Applications Security and Privacy XXXVII, 2023

Posterior Tracking Algorithm for Classification Bandits.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Gaussian Process Classification Bandits.

[BibT_eX]

[DOI]

CoRR, 2022

Simplification of Forest Classifiers and Regressors.

[BibT_eX]

[DOI]

Kento Sakurada

CoRR, 2022

Slimmable Pruned Neural Networks.

[BibT_eX]

[DOI]

Hideaki Kuratsu

CoRR, 2022

Efficient alignment-based average delay time estimation in fluctuating delayed propagation.

[BibT_eX]

[DOI]

Tatsuya Hayashi

Array, 2022

Boosting Utility of Differentially Private Streaming Data Release under Temporal Correlations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Big Data, 2022

An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored Graph.

[BibT_eX]

[DOI]

Kosuke Chinone

Proceedings of the AI 2021: Advances in Artificial Intelligence, 2022

2021

Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102, 400 nodes.

[BibT_eX]

[DOI]

Soft Comput., 2021

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2021

Classification Bandits: Classification Using Expected Rewards as Imperfect Discriminators.

[BibT_eX]

[DOI]

Tamiki Komatsuzaki

Proceedings of the Trends and Applications in Knowledge Discovery and Data Mining, 2021

2020

A bad arm existence checking problem: How to utilize asymmetric problem structure?

[BibT_eX]

[DOI]

Mach. Learn., 2020

Propagation Graph Estimation by Pairwise Alignment of Time Series Observation Sequences.

[BibT_eX]

[DOI]

Tatsuya Hayashi

Shinya Takamaeda-Yamazaki

CoRR, 2020

Hardware/Algorithm Co-optimization for Fully-Parallelized Compact Decision Tree Ensembles on FPGAs.

[BibT_eX]

[DOI]

Proceedings of the Applied Reconfigurable Computing. Architectures, Tools, and Applications, 2020

Data-Dependent Conversion to a Compact Integer-Weighted Representation of a Weighted Voting Classifier.

[BibT_eX]

[DOI]

Mitsuki Maekawa

Proceedings of The 12th Asian Conference on Machine Learning, 2020

Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String.

[BibT_eX]

[DOI]

Hiroshi Mamitsuka

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Good arm identification via bandit feedback.

[BibT_eX]

[DOI]

Mach. Learn., 2019

Mistake bounds on the noise-free multi-armed bandit game.

[BibT_eX]

[DOI]

David P. Helmbold

Manfred K. Warmuth

Inf. Comput., 2019

A Bad Arm Existence Checking Problem.

[BibT_eX]

[DOI]

CoRR, 2019

Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification.

[BibT_eX]

[DOI]

Aurélien Pélissier

Proceedings of the 2019 SIAM International Conference on Data Mining, 2019

An Algorithm for Reducing the Number of Distinct Branching Conditions in a Decision Forest.

[BibT_eX]

[DOI]

Kento Sakurada

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

2018

UCB-SC: A Fast Variant of KL-UCB-SC for Budgeted Multi-Armed Bandit Problem.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

FPGA-Based QBoost with Large-Scale Annealing Processor and Accelerated Hyperparameter Search.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Conference on ReConFigurable Computing and FPGAs, 2018

2017

KL-UCB-Based Policy for Budgeted Multi-Armed Bandits with Stochastic Action Costs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

An Efficient Approximate Algorithm for the 1-Median Problem on a Graph.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2017

On Practical Accuracy of Edit Distance Approximation Algorithms.

[BibT_eX]

[DOI]

Hiroyuki Hanada

CoRR, 2017

2016

Mining approximate patterns with frequent locally optimal occurrences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Noise Free Multi-armed Bandit Game.

[BibT_eX]

[DOI]

David P. Helmbold

Manfred K. Warmuth

Proceedings of the Language and Automata Theory and Applications, 2016

Sitting posture diagnosis using a pressure sensor mat.

[BibT_eX]

[DOI]

Shunsuke Suzuki

Proceedings of the IEEE International Conference on Identity, 2016

2015

An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem.

[BibT_eX]

[DOI]

Ryo Watanabe

Oper. Res. Lett., 2015

Diversity Measures and Margin Criteria in Multi-class Majority Vote Ensemble.

[BibT_eX]

[DOI]

Ayako Mikami

Proceedings of the Multiple Classifier Systems - 12th International Workshop, 2015

An Algorithm for Influence Maximization in a Two-Terminal Series Parallel Graph and its Application to a Real Network.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science - 18th International Conference, 2015

2014

Average-case linear-time similar substring searching by the q-gram distance.

[BibT_eX]

[DOI]

Hiroyuki Hanada

Theor. Comput. Sci., 2014

An efficient construction and application usefulness of rectangle greedy covers.

[BibT_eX]

[DOI]

Koji Ouchi

Pattern Recognit., 2014

A UCB-Like Strategy of Collaborative Filtering.

[BibT_eX]

[DOI]

Proceedings of the Sixth Asian Conference on Machine Learning, 2014

2013

Fast algorithms for finding a minimum repetition representation of strings and trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

2012

Frequent Approximate Substring Pattern Mining Using Locally Optimal Occurrence Counting.

[BibT_eX]

[DOI]

Hisashi Tosaka

Proceedings of the IIAI International Conference on Advanced Applied Informatics, 2012

Fast Approximation Algorithm for the 1-Median Problem.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science - 15th International Conference, 2012

2011

Construction of convex hull classifiers in high dimensions.

[BibT_eX]

[DOI]

Tetsuji Takahashi

Pattern Recognit. Lett., 2011

On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation.

[BibT_eX]

[DOI]

Takashi Saso

Kojiro Kobayashi

Inf. Process. Lett., 2011

Packing Alignment: Alignment for Sequences of Various Length Events.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2011

Efficient construction and usefulness of hyper-rectangle greedy covers.

[BibT_eX]

[DOI]

Koji Ouchi

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

A practical comparison of edit distance approximation algorithms.

[BibT_eX]

[DOI]

Hiroyuki Hanada

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

2010

Algorithms for Finding a Minimum Repetition Representation of a String.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Algorithms for Adversarial Bandit Problems with Multiple Plays.

[BibT_eX]

[DOI]

Taishi Uchiya

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Convex sets as prototypes for classifying patterns.

[BibT_eX]

[DOI]

Eng. Appl. Artif. Intell., 2009

Comparison of Bagging and Boosting Algorithms on Sample and Feature Weighting.

[BibT_eX]

[DOI]

Satoshi Shirai

Proceedings of the Multiple Classifier Systems, 8th International Workshop, 2009

Classifier Selection in a Family of Polyhedron Classifiers.

[BibT_eX]

[DOI]

Tetsuji Takahashi

Proceedings of the Progress in Pattern Recognition, 2009

2008

Classification Based on Consistent Itemset Rules.

[BibT_eX]

[DOI]

Trans. Mach. Learn. Data Min., 2008

Bagging, Random Subspace Method and Biding.

[BibT_eX]

[DOI]

Satoshi Shirai

Proceedings of the Structural, 2008

Classification by bagged consistent itemset rules.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

Classification by reflective convex hulls.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

What Sperner Family Concept Class is Easy to Be Enumerated?

[BibT_eX]

[DOI]

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007

CCIC: Consistent Common Itemsets Classifier.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2007

Mining Subtrees with Frequent Occurrence of Similar Subtrees.

[BibT_eX]

[DOI]

Hisashi Tosaka

Proceedings of the Discovery Science, 10th International Conference, 2007

2006

Learning-Related Complexity of Linear Ranking Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005

Extraction of Generalized Rules with Automated Attribute Abstraction.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Data Mining and knowledge Discovery, 2005

Inner Product Spaces for Bayesian Networks.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2005

An efficient query learning algorithm for ordered binary decision diagrams.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Improvements to the Linear Programming Based Scheduling of Web Advertisements.

[BibT_eX]

[DOI]

Electron. Commer. Res., 2005

Partitioning of Web graphs by community topology.

[BibT_eX]

[DOI]

Hidehiko Ino

Proceedings of the 14th international conference on World Wide Web, 2005

Mining Frequent Trees with Node-Inclusion Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005

The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2005

Empirical Study on Usefulness of Algorithm SACwRApper for Reputation Extraction from the WWW.

[BibT_eX]

[DOI]

Hiroyuki Hasegawa

Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2005

A Comparative Study of Algorithms for Finding Web Communities.

[BibT_eX]

[DOI]

Hidehiko Ino

Proceedings of the 21st International Conference on Data Engineering Workshops, 2005

Specific-Purpose Web Searches on the Basis of Structure and Contents.

[BibT_eX]

[DOI]

Proceedings of the Federation over the Web, 2005

2004

On the Minimum l<sub>1</sub>-Norm Signal Recovery in Underdetermined Source Separation.

[BibT_eX]

[DOI]

Proceedings of the Independent Component Analysis and Blind Signal Separation, 2004

Bayesian Networks and Inner Product Spaces.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

Collaborative Filtering Using Restoration Operators.

[BibT_eX]

[DOI]

Akira Tanaka

Proceedings of the Knowledge Discovery in Databases: PKDD 2003, 2003

Collaborative Filtering Using Projective Restoration Operators.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 6th International Conference, 2003

2002

Online Learning of Binary and n-ary Relations over Clustered Domains.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Improvements in practical aspects of optimally scheduling web advertising.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International World Wide Web Conference, 2002

2000

Query learning of bounded-width OBDDs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Automatic recording agent for digital video server.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM International Conference on Multimedia 2000, Los Angeles, CA, USA, October 30, 2000

1999

Unintrusive Customization Techniques for Web Advertising.

[BibT_eX]

[DOI]

Comput. Networks, 1999

Learning to Optimally Schedule Internet Banner Advertisements.

[BibT_eX]

Proceedings of the Sixteenth International Conference on Machine Learning (ICML 1999), Bled, Slovenia, June 27, 1999

Learning Specialist Decision Lists.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

Efficient Distribution-Free Population Learning of Simple Concepts.

[BibT_eX]

[DOI]

Jun'ichi Takeuchi

Ann. Math. Artif. Intell., 1998

Collaborative Filtering Using Weighted Majority Prediction Algorithms.

[BibT_eX]

Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), 1998

Empirical Comparison of Competing Query Learning Methods.

[BibT_eX]

[DOI]

Hiroshi Mamitsuka

Proceedings of the Discovery Science, 1998

1997

An Efficient Exact Learning Algorithm for Ordered Binary Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1995

Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms.

[BibT_eX]

[DOI]

Hang Li

Proceedings of the Machine Learning, 1995

On-line Learning of Binary and <i>n</i>-ary Relations over Multi-dimensional Clusters.

[BibT_eX]

[DOI]

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

Learning Sparse Linear Combinations of Basis Functions over a Finite Domain.

[BibT_eX]

[DOI]