Exact Learning of Linear Combinations of Monotone Terms from Function Value Queries. - Atsuyoshi Nakamura; Naoki Abe (ALT, 1993)

Efficient Distribution-free Population Learning of Simple Concepts. - Atsuyoshi Nakamura; Naoki Abe; Jun'ichi Takeuchi (AII/ALT, 1994)

Learning Sparse Linear Combinations of Basis Functions over a Finite Domain. - Atsuyoshi Nakamura; Shinji Miura (ALT, 1995)

On-line Learning of Binary and n-ary Relations over Multi-dimensional Clusters. - Atsuyoshi Nakamura; Naoki Abe (COLT, 1995)

On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms. - Naoki Abe; Hang Li 011; Atsuyoshi Nakamura (ICML, 1995)

Query Learning of Bounded-Width OBDDs. - Atsuyoshi Nakamura (ALT, 1996)

An Efficient Exact Learning Algorithm for Ordered Binary Decision Diagrams. - Atsuyoshi Nakamura (ALT, 1997)

Empirical Comparison of Competing Query Learning Methods. - Naoki Abe; Hiroshi Mamitsuka; Atsuyoshi Nakamura (Discovery Science, 1998)

Collaborative Filtering Using Weighted Majority Prediction Algorithms. - Atsuyoshi Nakamura; Naoki Abe (ICML, 1998)

Learning Specialist Decision Lists. - Atsuyoshi Nakamura (COLT, 1999)

Learning to Optimally Schedule Internet Banner Advertisements. - Naoki Abe; Atsuyoshi Nakamura (ICML, 1999)

Unintrusive Customization Techniques for Web Advertising. - Marc Langheinrich; Atsuyoshi Nakamura; Naoki Abe; Tomonari Kamba; Yoshiyuki Koseki (Comput. Networks, 1999)

Automatic recording agent for digital video server. - Atsuyoshi Nakamura; Naoki Abe; Hiroshi Matoba; Katsuhiro Ochiai (ACM Multimedia, 2000)

Improvements in practical aspects of optimally scheduling web advertising. - Atsuyoshi Nakamura (WWW, 2002)

Online Learning of Binary and n-ary Relations over Clustered Domains. - Atsuyoshi Nakamura; Naoki Abe (J. Comput. Syst. Sci., 2002)

Collaborative Filtering Using Projective Restoration Operators. - Atsuyoshi Nakamura; Mineichi Kudo; Akira Tanaka; Kazuhiko Tanabe (Discovery Science, 2003)

Collaborative Filtering Using Restoration Operators. - Atsuyoshi Nakamura; Mineichi Kudo; Akira Tanaka (PKDD, 2003)

Bayesian Networks and Inner Product Spaces. - Atsuyoshi Nakamura; Michael Schmitt 001; Niels Schmitt; Hans Ulrich Simon (COLT, 2004)

On the Minimum l1-Norm Signal Recovery in Underdetermined Source Separation. - Ichigaku Takigawa; Mineichi Kudo; Atsuyoshi Nakamura; Jun Toyama (ICA, 2004)

Specific-Purpose Web Searches on the Basis of Structure and Contents. - Mineichi Kudo; Atsuyoshi Nakamura (Federation over the Web, 2005)

A Comparative Study of Algorithms for Finding Web Communities. - Hidehiko Ino; Mineichi Kudo; Atsuyoshi Nakamura (ICDE Workshops, 2005)

Empirical Study on Usefulness of Algorithm SACwRApper for Reputation Extraction from the WWW. - Hiroyuki Hasegawa; Mineichi Kudo; Atsuyoshi Nakamura (KES (4), 2005)

The Convex Subclass Method: Combinatorial Classifier Based on a Family of Convex Sets. - Ichigaku Takigawa; Mineichi Kudo; Atsuyoshi Nakamura (MLDM, 2005)

Mining Frequent Trees with Node-Inclusion Constraints. - Atsuyoshi Nakamura; Mineichi Kudo (PAKDD, 2005)

Partitioning of Web graphs by community topology. - Hidehiko Ino; Mineichi Kudo; Atsuyoshi Nakamura (WWW, 2005)

Improvements to the Linear Programming Based Scheduling of Web Advertisements. - Atsuyoshi Nakamura; Naoki Abe (Electron. Commer. Res., 2005)

An efficient query learning algorithm for ordered binary decision diagrams. - Atsuyoshi Nakamura (Inf. Comput., 2005)

Inner Product Spaces for Bayesian Networks. - Atsuyoshi Nakamura; Michael Schmitt 001; Niels Schmitt; Hans Ulrich Simon (J. Mach. Learn. Res., 2005)

Extraction of Generalized Rules with Automated Attribute Abstraction. - Yohji Shidara; Mineichi Kudo; Atsuyoshi Nakamura (Foundations of Data Mining and knowledge Discovery, 2005)

Learning-Related Complexity of Linear Ranking Functions. - Atsuyoshi Nakamura (ALT, 2006)

Mining Subtrees with Frequent Occurrence of Similar Subtrees. - Hisashi Tosaka; Atsuyoshi Nakamura; Mineichi Kudo (Discovery Science, 2007)

CCIC: Consistent Common Itemsets Classifier. - Yohji Shidara; Atsuyoshi Nakamura; Mineichi Kudo (MLDM, 2007)

What Sperner Family Concept Class is Easy to Be Enumerated? - Atsuyoshi Nakamura; Mineichi Kudo (ICDM, 2008)

Classification by reflective convex hulls. - Mineichi Kudo; Atsuyoshi Nakamura; Ichigaku Takigawa (ICPR, 2008)

Classification by bagged consistent itemset rules. - Yohji Shidara; Mineichi Kudo; Atsuyoshi Nakamura (ICPR, 2008)

Bagging, Random Subspace Method and Biding. - Satoshi Shirai; Mineichi Kudo; Atsuyoshi Nakamura (SSPR/SPR, 2008)

Classification Based on Consistent Itemset Rules. - Yohji Shidara; Mineichi Kudo; Atsuyoshi Nakamura (Trans. Mach. Learn. Data Min., 2008)

Classifier Selection in a Family of Polyhedron Classifiers. - Tetsuji Takahashi; Mineichi Kudo; Atsuyoshi Nakamura (CIARP, 2009)

Comparison of Bagging and Boosting Algorithms on Sample and Feature Weighting. - Satoshi Shirai; Mineichi Kudo; Atsuyoshi Nakamura (MCS, 2009)

Convex sets as prototypes for classifying patterns. - Ichigaku Takigawa; Mineichi Kudo; Atsuyoshi Nakamura (Eng. Appl. Artif. Intell., 2009)

Algorithms for Adversarial Bandit Problems with Multiple Plays. - Taishi Uchiya; Atsuyoshi Nakamura; Mineichi Kudo (ALT, 2010)

Algorithms for Finding a Minimum Repetition Representation of a String. - Atsuyoshi Nakamura; Tomoya Saito; Ichigaku Takigawa; Hiroshi Mamitsuka; Mineichi Kudo (SPIRE, 2010)

A practical comparison of edit distance approximation algorithms. - Hiroyuki Hanada; Atsuyoshi Nakamura; Mineichi Kudo (GrC, 2011)

Efficient construction and usefulness of hyper-rectangle greedy covers. - Koji Ouchi; Atsuyoshi Nakamura; Mineichi Kudo (GrC, 2011)

Packing Alignment: Alignment for Sequences of Various Length Events. - Atsuyoshi Nakamura; Mineichi Kudo (PAKDD (2), 2011)

On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation. - Takashi Saso; Kojiro Kobayashi; Atsuyoshi Nakamura (Inf. Process. Lett., 2011)

Construction of convex hull classifiers in high dimensions. - Tetsuji Takahashi; Mineichi Kudo; Atsuyoshi Nakamura (Pattern Recognit. Lett., 2011)

Fast Approximation Algorithm for the 1-Median Problem. - Koji Tabata; Atsuyoshi Nakamura; Mineichi Kudo (Discovery Science, 2012)

Frequent Approximate Substring Pattern Mining Using Locally Optimal Occurrence Counting. - Atsuyoshi Nakamura; Hisashi Tosaka; Mineichi Kudo (IIAI-AAI, 2012)

Fast algorithms for finding a minimum repetition representation of strings and trees. - Atsuyoshi Nakamura; Tomoya Saito; Ichigaku Takigawa; Mineichi Kudo; Hiroshi Mamitsuka (Discret. Appl. Math., 2013)

A UCB-Like Strategy of Collaborative Filtering. - Atsuyoshi Nakamura (ACML, 2014)

An efficient construction and application usefulness of rectangle greedy covers. - Koji Ouchi; Atsuyoshi Nakamura; Mineichi Kudo (Pattern Recognit., 2014)

Average-case linear-time similar substring searching by the q-gram distance. - Hiroyuki Hanada; Mineichi Kudo; Atsuyoshi Nakamura (Theor. Comput. Sci., 2014)

An Algorithm for Influence Maximization in a Two-Terminal Series Parallel Graph and its Application to a Real Network. - Koji Tabata; Atsuyoshi Nakamura; Mineichi Kudo (Discovery Science, 2015)

Diversity Measures and Margin Criteria in Multi-class Majority Vote Ensemble. - Ayako Mikami; Mineichi Kudo; Atsuyoshi Nakamura (MCS, 2015)

An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem. - Ryo Watanabe; Atsuyoshi Nakamura; Mineichi Kudo (Oper. Res. Lett., 2015)

Sitting posture diagnosis using a pressure sensor mat. - Shunsuke Suzuki; Mineichi Kudo; Atsuyoshi Nakamura (ISBA, 2016)

Noise Free Multi-armed Bandit Game. - Atsuyoshi Nakamura; David P. Helmbold; Manfred K. Warmuth (LATA, 2016)

Mining approximate patterns with frequent locally optimal occurrences. - Atsuyoshi Nakamura; Ichigaku Takigawa; Hisashi Tosaka; Mineichi Kudo; Hiroshi Mamitsuka (Discret. Appl. Math., 2016)

On Practical Accuracy of Edit Distance Approximation Algorithms. - Hiroyuki Hanada; Mineichi Kudo; Atsuyoshi Nakamura (CoRR, 2017)

An Efficient Approximate Algorithm for the 1-Median Problem on a Graph. - Koji Tabata; Atsuyoshi Nakamura; Mineichi Kudo (IEICE Trans. Inf. Syst., 2017)

KL-UCB-Based Policy for Budgeted Multi-Armed Bandits with Stochastic Action Costs. - Ryo Watanabe; Junpei Komiyama; Atsuyoshi Nakamura; Mineichi Kudo (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

FPGA-Based QBoost with Large-Scale Annealing Processor and Accelerated Hyperparameter Search. - Takashi Takemoto; Normann Mertig; Masato Hayashi; Saki Susa-Tanaka; Hiroshi Teramoto; Atsuyoshi Nakamura; Ichigaku Takigawa; Shin-ichi Minato; Tamiki Komatsuzaki; Masanao Yamaoka (ReConFig, 2018)

Graph Minors from Simulated Annealing for Annealing Machines with Sparse Connectivity. - Yuya Sugie; Yuki Yoshida 002; Normann Mertig; Takashi Takemoto; Hiroshi Teramoto; Atsuyoshi Nakamura; Ichigaku Takigawa; Shin-ichi Minato; Masanao Yamaoka; Tamiki Komatsuzaki (TPNC, 2018)

UCB-SC: A Fast Variant of KL-UCB-SC for Budgeted Multi-Armed Bandit Problem. - Ryo Watanabe; Junpei Komiyama; Atsuyoshi Nakamura; Mineichi Kudo (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

An Algorithm for Reducing the Number of Distinct Branching Conditions in a Decision Forest. - Atsuyoshi Nakamura; Kento Sakurada (ECML/PKDD (1), 2019)

Feature selection as Monte-Carlo Search in Growing Single Rooted Directed Acyclic Graph by Best Leaf Identification. - Aurélien Pélissier; Atsuyoshi Nakamura; Koji Tabata (SDM, 2019)

A Bad Arm Existence Checking Problem. - Koji Tabata; Atsuyoshi Nakamura; Junya Honda; Tamiki Komatsuzaki (CoRR, 2019)

Mistake bounds on the noise-free multi-armed bandit game. - Atsuyoshi Nakamura; David P. Helmbold; Manfred K. Warmuth (Inf. Comput., 2019)

Good arm identification via bandit feedback. - Hideaki Kano; Junya Honda; Kentaro Sakamaki; Kentaro Matsuura; Atsuyoshi Nakamura; Masashi Sugiyama (Mach. Learn., 2019)

Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String. - Atsuyoshi Nakamura; Ichigaku Takigawa; Hiroshi Mamitsuka (AAAI, 2020)

Data-Dependent Conversion to a Compact Integer-Weighted Representation of a Weighted Voting Classifier. - Mitsuki Maekawa; Atsuyoshi Nakamura; Mineichi Kudo (ACML, 2020)

Hardware/Algorithm Co-optimization for Fully-Parallelized Compact Decision Tree Ensembles on FPGAs. - Taiga Ikeda; Kento Sakurada; Atsuyoshi Nakamura; Masato Motomura; Shinya Takamaeda-Yamazaki (ARC, 2020)

Propagation Graph Estimation by Pairwise Alignment of Time Series Observation Sequences. - Tatsuya Hayashi; Atsuyoshi Nakamura (CoRR, 2020)

A bad arm existence checking problem: How to utilize asymmetric problem structure? - Koji Tabata; Atsuyoshi Nakamura; Junya Honda; Tamiki Komatsuzaki (Mach. Learn., 2020)

Classification Bandits: Classification Using Expected Rewards as Imperfect Discriminators. - Koji Tabata; Atsuyoshi Nakamura; Tamiki Komatsuzaki (PAKDD (Workshops), 2021)

Foreword. - Atsuyoshi Nakamura (IEICE Trans. Inf. Syst., 2021)

Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102, 400 nodes. - Yuya Sugie; Yuki Yoshida 002; Normann Mertig; Takashi Takemoto; Hiroshi Teramoto; Atsuyoshi Nakamura; Ichigaku Takigawa; Shin-ichi Minato; Masanao Yamaoka; Tamiki Komatsuzaki (Soft Comput., 2021)

An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored Graph. - Kosuke Chinone; Atsuyoshi Nakamura (AI, 2022)

Boosting Utility of Differentially Private Streaming Data Release under Temporal Correlations. - Xuyang Cao; Yang Cao 011; Masatoshi Yoshikawa; Atsuyoshi Nakamura (IEEE Big Data, 2022)

Efficient alignment-based average delay time estimation in fluctuating delayed propagation. - Atsuyoshi Nakamura; Tatsuya Hayashi (Array, 2022)

Slimmable Pruned Neural Networks. - Hideaki Kuratsu; Atsuyoshi Nakamura (CoRR, 2022)

Simplification of Forest Classifiers and Regressors. - Atsuyoshi Nakamura; Kento Sakurada (CoRR, 2022)

Posterior Tracking Algorithm for Classification Bandits. - Koji Tabata; Junpei Komiyama; Atsuyoshi Nakamura; Tamiki Komatsuzaki (AISTATS, 2023)

Differentially Private Streaming Data Release Under Temporal Correlations via Post-processing. - Xuyang Cao; Yang Cao 011; Primal Pappachan; Atsuyoshi Nakamura; Masatoshi Yoshikawa (DBSec, 2023)

Pure exploration in multi-armed bandits with low rank structure using oblivious sampler. - Yaxiong Liu; Atsuyoshi Nakamura; Kohei Hatano; Eiji Takimoto (CoRR, 2023)

Facial Memorization of Diffusion Model. - Shiang Ma; Yang Cao; Atsuyoshi Nakamura (ADC, 2024)

Ensuring Fairness in Stochastic Multi-armed Bandit Problems for Effective Group Recommendations. - Rei Ozaki; Atsuyoshi Nakamura (AI (1), 2024)

Posterior Tracking Algorithm for Multi-objective Classification Bandits. - Riku Suzuki; Atsuyoshi Nakamura (AI (2), 2024)

Risk Diversification Strategy with Moving Average Reversion for Automatic Portfolio Optimization. - Yuki Hayashi; Atsuyoshi Nakamura (IEEE Big Data, 2024)

A Monte Carlo Tree Search for Budget-Constrained Combinatorial Optimal Facility Investment Problem with a Blackbox Objective Function. - Shoma Nameki; Atsuyoshi Nakamura; Yusuke Yasugahira; Hiroshi Uchigaito; Michiaki Hiramatsu; Takashi Takemoto (IEEE Big Data, 2024)

Long-term Detection System for Six Kinds of Abnormal Behavior of the Elderly Living Alone. - Kai Tanaka; Mineichi Kudo; Keigo Kimura; Atsuyoshi Nakamura (CoRR, 2024)

Query learning algorithm for ordered multi-terminal binary decision diagrams. - Atsuyoshi Nakamura (Discret. Appl. Math., 2024)

Gaussian process classification bandits. - Tatsuya Hayashi; Naoki Ito; Koji Tabata; Atsuyoshi Nakamura; Katsumasa Fujita; Yoshinori Harada; Tamiki Komatsuzaki (Pattern Recognit., 2024)

A Contextual Bandit Algorithm for Recommending Item Sets with High Sum Diversity. - Masaki Hashimoto; Atsuyoshi Nakamura (DS, 2025)

Privacy in Fine-Tuning Large Language Models: Attacks, Defenses, and Future Directions. - Hao Du; Shang Liu 001; Lele Zheng; Yang Cao 011; Atsuyoshi Nakamura; Lei Chen (PAKDD (4), 2025)

Multiple Wasserstein Gradient Descent Algorithm for Multi-Objective Distributional Optimization. - Dai Hai Nguyen; Hiroshi Mamitsuka; Atsuyoshi Nakamura (UAI, 2025)

Simplification of forest classifiers and regressors by sharing branching conditions. - Naoki Marui; Atsuyoshi Nakamura; Kento Sakurada (Mach. Learn., 2025)