Masaharu Munetomo

Masaharu Munetomo

Auto-generated profile, based on publicly available information

Masaharu Munetomo

Information Initiative Center, Hokkaido University, Sapporo, Japan

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 February 2024 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
Rui ZhongRui Zhong
Rui Zhong
JYJun Yu
Jun Yu
CZChao Zhang
Chao Zhang
MMMasaharu Munetomo
Masaharu Munetomo

5 January 2025 in Advanced Engineering Informatics
Verified
Journal Article
Closed access
Rui ZhongRui Zhong
Rui Zhong
Abdelazim HussienAbdelazim Hussien
Abdelazim Hussien
JYJun Yu
Jun Yu
MMMasaharu Munetomo
Masaharu Munetomo

20 October 2009 in Genetic Programming and Evolvable Machines
Verified
Journal Article
Closed access
PDF file
AMAsim Munawar
Asim Munawar
MWMohamed Wahib
Mohamed Wahib
MMMasaharu Munetomo
Masaharu Munetomo
KAKiyoshi Akama
Kiyoshi Akama

22 December 2023 in Alexandria Engineering Journal
Verified
Journal Article
Open access
Rui ZhongRui Zhong
Rui Zhong
FPFei Peng
Fei Peng
JYJun Yu
Jun Yu
MMMasaharu Munetomo
Masaharu Munetomo

30 January 2018 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
LFLuca FARAMONDI
Luca FARAMONDI
GOGabriele Oliva
Gabriele Oliva
SPStefano Panzieri
Stefano Panzieri
Federica PascucciFederica Pascucci
Federica Pascucci
MSMartin Schlueter
Martin Schlueter
RSRoberto Setola
Roberto Setola
In this paper, we provide a novel framework to assess the vulnerability/robustness of a network with respect to pair-wise nodes' connectivity. In particular, we consider attackers that aim, at the same time, at dealing the maximum possible damage to the network in terms of the residual connectivity after the attack and at keeping the cost of the attack (e.g., the number of attacked nodes) at a minimum. Differently from the previous literature, we consider the attacker perspective using a multiobjective formulation and, rather than making hypotheses on the mindset of the attacker in terms of a particular tradeoff between the objectives, we consider the entire Pareto front of nondominated solutions. Based on that, we define novel global and local robustness/vulnerability indicators and we show that such indices can be the base for the implementation of effective protection strategies. Specifically, we propose two different problem formulations and we assess their performances. We conclude this paper by analyzing, as case studies, the IEEE118 power network and the U.S. Airline Network as it was in 1997, comparing the proposed approach against centrality measures.

26 October 2023 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
Rui ZhongRui Zhong
Rui Zhong
JYJun Yu
Jun Yu
CZChao Zhang
Chao Zhang
MMMasaharu Munetomo
Masaharu Munetomo
This paper proposes a novel surrogate ensemble-assisted hyper-heuristic algorithm (SEA-HHA) to solve expensive optimization problems (EOPs). A representative HHA consists of two parts: the low-level and the high-level components. In the low-level component, we regard the surrogate-assisted technique as a type of search strategy and design the four search strategy archives: exploration strategy archive, exploitation strategy archive, surrogate-assisted estimation archive, and mutation strategy archive as low-level heuristics (LLHs), each archive contains one or more search strategies. Once the surrogate-assisted estimation archive is activated to generate the offspring individual, SEA-HHA first selects the dataset for model construction from three principles: All Data, Recent Data, and Neighbor, which correspond to the global and the local surrogate model, respectively. Then, the dataset is randomly divided into training and validation data, and the most accurate model built by polynomial regression (PR), support vector regression (SVR), and Gaussian process regression (GPR) cooperates with the infill sampling criterion is employed for solution estimation. In the high-level component, we design a random selection function based on the pre-defined probabilities to manipulate a set of LLHs. In numerical experiments, we compare SEA-HHA with six optimization techniques on 5-D, 10-D, and 30-D CEC2013 benchmark functions and three engineering optimization problems with only 1000 fitness evaluation times (FEs). The experimental and statistical results show that our proposed SEA-HHA has broad prospects for dealing with EOPs.