Kazuhide Nakata
Orcid: 0000-0002-5479-100X
According to our database1,
Kazuhide Nakata
authored at least 42 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Trend Analysis with Interpretability and Cold-Start Problems for Recommender Systems.
Rev. Socionetwork Strateg., November, 2024
Oper. Res. Forum, June, 2024
Approximation hierarchies for copositive cone over symmetric cone and their comparison.
J. Glob. Optim., April, 2024
Distribution-Aligned Sequential Counterfactual Explanation with Local Outlier Factor.
Proceedings of the PRICAI 2024: Trends in Artificial Intelligence, 2024
Proceedings of the PRICAI 2024: Trends in Artificial Intelligence, 2024
Proceedings of the Twelfth International Conference on Learning Representations, 2024
Zero-Inflated Poisson Tensor Factorization for Sparse Purchase Data in E-Commerce Markets.
Proceedings of the Industrial Engineering and Applications - Europe, 2024
Proceedings of the IEEE International Conference on Big Data, 2024
2023
Eur. J. Oper. Res., 2023
SCOPE-RL: A Python Library for Offline Reinforcement Learning and Off-Policy Evaluation.
CoRR, 2023
Decision Tree Clustering for Time Series Data: An Approach for Enhanced Interpretability and Efficiency.
Proceedings of the PRICAI 2023: Trends in Artificial Intelligence, 2023
Temporal Positive Collective Matrix Factorization for Interpretable Trend Analysis in Recommender Systems.
Proceedings of the IEEE International Conference on Data Mining, 2023
2022
Rev. Socionetwork Strateg., 2022
Optim. Lett., 2022
A deep bi-directional long-short term memory neural network-based methodology to enhance short-term electricity load forecasting for residential applications.
Comput. Ind. Eng., 2022
Predicting response probability by embedding questions in online question recommendation.
Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2022
2021
Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization.
J. Glob. Optim., 2021
INFORMS J. Appl. Anal., 2021
Solving Large Break Minimization Problems in a Mirrored Double Round-robin Tournament Using Quantum Annealing.
CoRR, 2021
Constrained Generalized Additive 2 Model with Consideration of High-Order Interactions.
CoRR, 2021
Proceedings of the Advances in Artificial Intelligence, 2021
Proceedings of the 2021 International Conference on Data Mining, 2021
2020
Technical Progress Analysis Using a Dynamic Topic Model for Technical Terms to Revise Patent Classification Codes.
CoRR, 2020
Proceedings of the WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, 2020
Cost-Effective and Stable Policy Optimization Algorithm for Uplift Modeling with Multiple Treatments.
Proceedings of the 2020 SIAM International Conference on Data Mining, 2020
2019
A hybrid evolutionary-simplex search method to solve nonlinear constrained optimization problems.
Soft Comput., 2019
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor.
J. Glob. Optim., 2019
Doubly Robust Prediction and Evaluation Methods Improve Uplift Modeling for Observational Data.
Proceedings of the 2019 SIAM International Conference on Data Mining, 2019
2018
Solving the patient appointment scheduling problem in outpatient chemotherapy clinics using clustering and mathematical programming.
Comput. Ind. Eng., 2018
2015
Optim. Methods Softw., 2015
2014
IEEE Signal Process. Lett., 2014
Optim. Lett., 2014
2012
Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix.
ACM Trans. Math. Softw., 2012
2007
Comput. Optim. Appl., 2007
2006
A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion.
Parallel Comput., 2006
Optim. Methods Softw., 2006
2003
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results.
Math. Program., 2003
2001
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework.
SIAM J. Optim., 2001
1997
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming.
Math. Program., 1997