HARAGUCHI Kazuya

Faculty
Department of Information and Management Science
PositionAssociate ProfessorMail
BirthdayWebsite
TEL(代表)0134-27-5206
Message
Last Updated :2020/02/15

Researcher Profile and Settings

Education

  •   1997 04  - 2001 03 , Kyoto University, Faculty of Engineering

Degree

  • 博士(情報学)(京都大学)

Association Memberships

  • THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS
  • THE OPERATIONS RESEARCH SOCIETY OF JAPAN

Academic & Professional Experience

  •   2013 10 ,  - 現在, Otaru University of Commerce, Faculty of Commerce
  •   2012 04 ,  - 2013 09 , Ishinomaki Senshu University, School of Science and Engineering
  •   2007 04 ,  - 2012 03 , Ishinomaki Senshu University, School of Science and Engineering

Research Activities

Research Areas

  • Informatics, Mathematical informatics

Research Interests

    Combinatorial optimization

Published Papers

  • COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
    Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi, Journal of Graph Algorithms and Applications, Journal of Graph Algorithms and Applications, 23, (2) 434 - 458, 07 , Refereed, DOI
  • Recycling Solutions for Vertex Coloring Heuristics
    Yasutaka Uchida, Kazuya Haraguchi, Proceedings of International Symposium on Scheduling 2019 (ISS2019), Proceedings of International Symposium on Scheduling 2019 (ISS2019), 07 , Refereed
  • An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem
    Kazuya Haraguchi, Hideki Hashimoto, Junji Itoyanagi, Mutsunori Yagiura, International Transactions in Operational Research, International Transactions in Operational Research, 26, (4) 1244 - 1268, 07 , Refereed, DOI
  • A Polynomial-delay Algorithm for Enumerating Connectors under Various Connectivity Conditions
    Kazuya Haraguchi, Hiroshi Nagamochi, Proceedings of The 30th International Symposium on Algorithms and Computation (ISAAC 2019), Proceedings of The 30th International Symposium on Algorithms and Computation (ISAAC 2019), Refereed
  • An Efficient Local Search for the Minimum Independent Dominating Set Problem
    Kazuya Haraguchi, Proceedings of 17th International Symposium on Experimental Algorithms (SEA2018), Proceedings of 17th International Symposium on Experimental Algorithms (SEA2018), 06 , Refereed, DOI
  • An Efficient Local Search for the Constrained Symmetric Latin Square Construction Problem
    Kazuya Haraguchi, Journal of Operations Research Society of Japan, Journal of Operations Research Society of Japan, 60, (4) 439 - 460, 10 , Refereed, DOI
  • Building Puzzle Is Still Hard Even in the Single Lined Version
    Kazuya Haraguchi, Ryoya Tanaka, Journal of Information Processing, Journal of Information Processing, 25, 730 - 734, 08 , Refereed, DOI
  • Iterated Local Search with Trellis-Neighborhood for the Partial Latin Square Extension Problem
    Kazuya Haraguchi, Journal of Heuristics, Journal of Heuristics, 22, (5) 727 - 757, Refereed, DOI
  • On A Generalization of "Eight Blocks to Madness" puzzle
    Kazuya Haraguchi, Discrete Mathematics, Discrete Mathematics, 339, (4) 1400 - 1409, Refereed, DOI
  • An Efficient Local Search for Partial Latin Square Extension Problem
    Kazuya Haraguchi, Integration of AI and OR Techniques in Constraint Programming - 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings, Integration of AI and OR Techniques in Constraint Programming - 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings, 182 - 198, Refereed, DOI
  • How Simple Algorithms Can Solve Latin Square Completion-Type Puzzles Approximately.
    Kazuya Haraguchi, Hirotaka Ono, Journal of Information Processing, Journal of Information Processing, 23, (3) 276 - 283, Refereed, DOI
  • Approximability of Latin Square Completion-Type Puzzles.
    Kazuya Haraguchi, Hirotaka Ono, Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings, Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings, 218 - 229, Refereed, DOI
  • A Maximum Matching Based Heuristic Algorithm for Partial Latin Square Extension Problem.
    Kazuya Haraguchi, Masaki Ishigaki, Akira Maruoka, Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, Kraków, Poland, September 8-11, 2013., Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, Kraków, Poland, September 8-11, 2013., 347 - 354, Refereed
  • A Constructive Algorithm for Partial Latin Square Extension Problem that Solves Hardest Instances Effectively.
    Kazuya Haraguchi, Recent Advances in Computational Optimization - Results of the Workshop on Computational Optimization WCO 2013 [FedCSIS 2013, Kraków, Poland], Recent Advances in Computational Optimization - Results of the Workshop on Computational Optimization WCO 2013 [FedCSIS 2013, Kraków, Poland], 67 - 84, DOI
  • The Number of Inequality Signs in the Design of Futoshiki Puzzle.
    Kazuya Haraguchi, Journal of Information Processing, Journal of Information Processing, 21, (1) 26 - 32, Refereed, DOI
  • BLOCKSUM is NP-Complete.
    Kazuya Haraguchi, Hirotaka Ono, IEICE Transactions on Information and Systems, IEICE Transactions on Information and Systems, 96-D, (3) 481 - 488, Refereed, DOI
  • How to Produce BlockSum Instances with Various Levels of Difficulty.
    Kazuya Haraguchi, Yasutaka Abe, Akira Maruoka, Journal of Information Processing, Journal of Information Processing, 20, (3) 727 - 737, Refereed, DOI
  • Sampling Site Location Problem in Lake Monitoring Having Multiple Purposes and Constraints
    Haraguchi Kazuya, Sato Yuichi, Journal of the Operations Research Society of Japan, Journal of the Operations Research Society of Japan, 53, (4) 289 - 304, 12 , Refereed, DOI
  • Multiclass Visual Classifier Based on Bipartite Graph Representation of Decision Tables.
    Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi, Learning and Intelligent Optimization, 4th International Conference, LION 4, Venice, Italy, January 18-22, 2010. Selected Papers, Learning and Intelligent Optimization, 4th International Conference, LION 4, Venice, Italy, January 18-22, 2010. Selected Papers, 169 - 183, Refereed, DOI
  • Bipartite Graph Representation of Multiple Decision Table Classifiers.
    Kazuya Haraguchi, Seok-Hee Hong, Hiroshi Nagamochi, Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings, Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 26-28, 2009. Proceedings, 46 - 60, Refereed, DOI
  • A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns.
    Kazuya Haraguchi, Mutsunori Yagiura, Endre Boros, Toshihide Ibaraki, IEICE Transactions on Information and Systems, IEICE Transactions on Information and Systems, 91-D, (3) 781 - 788, Refereed, DOI
  • Extension of ICF Classifiers to Real World Data Sets.
    Kazuya Haraguchi, Hiroshi Nagamochi, New Trends in Applied Artificial Intelligence, 20th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2007, Kyoto, Japan, June 26-29, 2007, Proceedings, New Trends in Applied Artificial Intelligence, 20th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2007, Kyoto, Japan, June 26-29, 2007, Proceedings, 776 - 785, Refereed, DOI
  • Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge.
    Kazuya Haraguchi, Toshihide Ibaraki, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 89-A, (5) 1284 - 1291, Refereed, DOI

Misc

Conference Activities & Talks

  • Experimental Comparison of Connector Enumeration Algorithms
    Kazuya Haraguchi, Hiroshi Nagamochi, WEPA 2019 (3rd International Workshop on Enumeration Problems & Applications),   2019 10 29
  • A polynomial-delay algorithm for enumerating connectors under various connectivity conditions
    Kazuya Haraguchi, Hiroshi Nagamochi,   2019 03 05
  • COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
    Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi, WEPA 2018 (2nd International Workshop on Enumeration Problems & Applications),   2018 11 07
  • COOMA: A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets
    Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi,   2018 05 26
  • The Word Allocation Problem on An nxn Grid
    Kazuya Haraguchi,   2017 03 06
  • A Collection of Efficient Local Searches for Partial Latin Square Extension Problem and Its Variants
    Kazuya Haraguchi,   2015 06 12
  • Sampling Site Location Problem in Lake Monitoring with Multiple Purposes and Constraints
    Kazuya Haraguchi, Yuichi Sato, aculty workshop (project SPAV - CZ.1.07/2.3.00/09.0050), University of West Bohemia,   2012 03 , 招待有り
  • Sampling site location problem in lake monitoring
    Kazuya Haraguchi, Yuichi Sato, KSMAP,   2011 10 29
  • How to Produce SumBlock Puzzle Instances
    Yasutaka Abe, Kazuya Haraguchi, Akira Maruoka, 研究報告ゲーム情報学(GI),   2011 02 26 , For given partition of n × n grid into blocks and assignment of integers to the blocks, SumBlock puzzle asks to assign integers from {1, 2, . . . ,n} to all cells in the grid so that the completion satisfies the Latin square condition and the subset sum condition. In this research, we develop an algorithm to yield a SumBlock puzzle instance. Types of generated instances are adjusted by inference rules built into the algorithm. Our experimental studies show that human players are more likely to fail to solve the instances generated with sophisticated inference rules than those generated with easy inference rules.
  • 琵琶湖における水質調査地点の配置問題
    HARAGUCHI KAZUYA, SATO YUICHI, 日本オペレーションズ・リサーチ学会春季研究発表会アブストラクト集,   2010 03 04
  • Learning classifier by edge crossing minimization
    K. Haraguchi, S.H. Hong, H. Nagamochi, International workshop on Multi-dimensional Visualization,   2010 02
  • Visualized multiple decision table classifiers without discretization
    K. Haraguchi, S.H. Hong, H. Nagamochi, Korea-Japan Workshop on Operations Research in Service Science,   2009 10
  • 琵琶湖の水質観測における最適サンプル点集合の決定
    HARAGUCHI KAZUYA, SATO YUICHI, 日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集,   2009 09 09
  • Visual anaysis of hierarchical data using 2.5D drawing with minimum occlusion
    K. Haraguchi, H. Nagamochi, S.H. Hong, 2008 IEEE Pacific Visualization Symposium,   2008 03
  • ルール生成に必要なデータ量に関するランダム性に基づいた解析
    HARAGUCHI KAZUYA, YAGIURA MUTSUNORI, BOROS ENDRE, IBARAKI TOSHIHIDE, 日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集,   2006 10
  • Classifiers based on iterative compositions of features
    原口和也, 茨木俊秀, Endre Boros, 第19回KIDS (Kyoto university Inter-Department Symposium on algorithms) 研究会,   2004 09
  • データ分類におけるノイズ量の評価について
    HARAGUCHI KAZUYA, IBARAKI TOSHIHIDE, 日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集,   2002 09 11
  • データからの知識獲得における常識ルールと例外ルールについて
    HARAGUCHI KAZUYA, IBARAKI TOSHIHIDE, 日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集,   2001 09 12

Works

  • KidsMath SpeedStar
    Ryota Sekiya, Kazuya Haraguchi, ソフトウェア
  • Colorculate!
    Kazuya Haraguchi, ソフトウェア
  • ColorfulSum
    Kazuya Haraguchi, ソフトウェア

Awards & Honors

  •   2019 07 , ISS2019, Best paper award for scheduling theory, Recycling Solutions for Vertex Coloring Heuristics
  •   2017 02 , IEEE Sapporo Section, Student Paper Contest Encouraging prize
  •   2008 03 , IEEE VGTC Pacific Visualization Symposium 2008, best poster award

Research Grants & Projects

  • Practical approach to self-constructive learning on subjects on computer science
    Ministry of Education, Culture, Sports, Science and Technology, Grants-in-Aid for Scientific Research(基盤研究(C)),   2008  - 2010 , Among results we obtained in this project there exists a framework that yields instances of certain combinatorial puzzles. To explore such a framework, we focus on certain types of puzzles that ask an assignment of numbers to cells of nxn grids so that it satisfies certain constraints as well as the Latin square condition, that is, each row and column contains all of the numbers in {1, 2,…,n} Our algorithm based on the framework yields automatically puzzle instances whose difficulties to solve can be adjusted by means of puzzle inference rules built into the algorithm. We performed experiments to demonstrate that, as is expected, human solvers tend to solve puzzle instances correctly that are produced with easy inference rules, whereas they tend to fail to solve those produced with sophisticated rules.
  • A Novel Learning Method Based on Combinatorial Feature of Data
    Ministry of Education, Culture, Sports, Science and Technology, Grants-in-Aid for Scientific Research(若手研究(スタートアップ)),   2008  - 2009 , In this project, we have aimed at establishing a novel learning method based on combinatorial feature of data. For classification, an essential learning problem, we proposed a learning algorithm based on bipartite graph structure. In computational experiments, we observed that its learning ability is competitive with previous methods and is even superior in some special cases.


Copyright (c) MEDIA FUSION Co.,Ltd. All rights reserved.