1
|
Hypernetwork Representation Learning with Common Constraints of the Set and Translation. Symmetry (Basel) 2022. [DOI: 10.3390/sym14081745] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
Different from conventional networks with only pairwise relationships among the nodes, there are also complex tuple relationships, namely the hyperedges among the nodes in the hypernetwork. However, most of the existing network representation learning methods cannot effectively capture the complex tuple relationships. Therefore, in order to resolve the above challenge, this paper proposes a hypernetwork representation learning method with common constraints of the set and translation, abbreviated as HRST, which incorporates both the hyperedge set associated with the nodes and the hyperedge regarded as the interaction relation among the nodes through the translation mechanism into the process of hypernetwork representation learning to obtain node representation vectors rich in the hypernetwork topology structure and hyperedge information. Experimental results on four hypernetwork datasets demonstrate that, for the node classification task, our method outperforms the other best baseline methods by about 1%. As for the link prediction task, our method is almost entirely superior to other baseline methods.
Collapse
|
2
|
Abstract
Differential Evolution (DE) is a method of optimization used in symmetrical optimization problems and also in problems that are not even continuous, and are noisy and change over time. DE optimizes a problem with a population of candidate solutions and creates new candidate solutions per generation in combination with existing rules according to discriminatory rules. The present work proposes two variations for this method. The first significantly improves the termination of the method by proposing an asymptotic termination rule, which is based on the differentiation of the average of the function values in the population of DE. The second modification proposes a new scheme for a critical parameter of the method, which improves the method’s ability to better explore the search space of the objective function. The proposed variations have been tested on a number of problems from the current literature, and from the experimental results, it appears that the proposed modifications render the method quite robust and faster even in large-scale problems.
Collapse
|
3
|
Abstract
The moth-flame optimization (MFO) algorithm is an effective nature-inspired algorithm based on the chemical effect of light on moths as an animal with bilateral symmetry. Although it is widely used to solve different optimization problems, its movement strategy affects the convergence and the balance between exploration and exploitation when dealing with complex problems. Since movement strategies significantly affect the performance of algorithms, the use of multi-search strategies can enhance their ability and effectiveness to solve different optimization problems. In this paper, we propose a multi-trial vector-based moth-flame optimization (MTV-MFO) algorithm. In the proposed algorithm, the MFO movement strategy is substituted by the multi-trial vector (MTV) approach to use a combination of different movement strategies, each of which is adjusted to accomplish a particular behavior. The proposed MTV-MFO algorithm uses three different search strategies to enhance the global search ability, maintain the balance between exploration and exploitation, and prevent the original MFO’s premature convergence during the optimization process. Furthermore, the MTV-MFO algorithm uses the knowledge of inferior moths preserved in two archives to prevent premature convergence and avoid local optima. The performance of the MTV-MFO algorithm was evaluated using 29 benchmark problems taken from the CEC 2018 competition on real parameter optimization. The gained results were compared with eight metaheuristic algorithms. The comparison of results shows that the MTV-MFO algorithm is able to provide competitive and superior results to the compared algorithms in terms of accuracy and convergence rate. Moreover, a statistical analysis of the MTV-MFO algorithm and other compared algorithms was conducted, and the effectiveness of our proposed algorithm was also demonstrated experimentally.
Collapse
|
4
|
DMFO-CD: A Discrete Moth-Flame Optimization Algorithm for Community Detection. ALGORITHMS 2021. [DOI: 10.3390/a14110314] [Citation(s) in RCA: 10] [Impact Index Per Article: 3.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 12/13/2022]
Abstract
In this paper, a discrete moth–flame optimization algorithm for community detection (DMFO-CD) is proposed. The representation of solution vectors, initialization, and movement strategy of the continuous moth–flame optimization are purposely adapted in DMFO-CD such that it can solve the discrete community detection. In this adaptation, locus-based adjacency representation is used to represent the position of moths and flames, and the initialization process is performed by considering the community structure and the relation between nodes without the need of any knowledge about the number of communities. Solution vectors are updated by the adapted movement strategy using a single-point crossover to distance imitating, a two-point crossover to calculate the movement, and a single-point neighbor-based mutation that can enhance the exploration and balance exploration and exploitation. The fitness function is also defined based on modularity. The performance of DMFO-CD was evaluated on eleven real-world networks, and the obtained results were compared with five well-known algorithms in community detection, including GA-Net, DPSO-PDM, GACD, EGACD, and DECS in terms of modularity, NMI, and the number of detected communities. Additionally, the obtained results were statistically analyzed by the Wilcoxon signed-rank and Friedman tests. In the comparison with other comparative algorithms, the results show that the proposed DMFO-CD is competitive to detect the correct number of communities with high modularity.
Collapse
|
5
|
Abstract
The real world can be characterized as a complex network sto in symmetric matrix. Community discovery (or community detection) can effectively reveal the common features of network groups. The communities are overlapping since, in fact, one thing often belongs to multiple categories. Hence, overlapping community discovery has become a new research hotspot. Since the results of the existing community discovery algorithms are not robust enough, this paper proposes an effective algorithm, named Two Expansions of Seeds (TES). TES adopts the topological feature of network nodes to find the local maximum nodes as the seeds which are based on the gravitational degree, which makes the community discovery robust. Then, the seeds are expanded by the greedy strategy based on the fitness function, and the community cleaning strategy is employed to avoid the nodes with negative fitness so as to improve the accuracy of community discovery. After that, the gravitational degree is used to expand the communities for the second time. Thus, all nodes in the network belong to at least one community. Finally, we calculate the distance between the communities and merge similar communities to obtain a less- undant community structure. Experimental results demonstrate that our algorithm outperforms other state-of-the-art algorithms.
Collapse
|
6
|
Osaba E, Del Ser J, Camacho D, Bilbao MN, Yang XS. Community detection in networks using bio-inspired optimization: Latest developments, new results and perspectives with a selection of recent meta-heuristics. Appl Soft Comput 2020. [DOI: 10.1016/j.asoc.2019.106010] [Citation(s) in RCA: 41] [Impact Index Per Article: 10.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/02/2023]
|
7
|
Abstract
This book contains the successful invited submissions [...]
Collapse
|
8
|
Yolcu U, Bas E, Egrioglu E. A new fuzzy inference system for time series forecasting and obtaining the probabilistic forecasts via subsampling block bootstrap. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2018. [DOI: 10.3233/jifs-17782] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/15/2022]
Affiliation(s)
- Ufuk Yolcu
- Department of Econometrics, Faculty of Economic and Administrative Sciences, Forecast Research Laboratory, Giresun University, Giresun, Turkey
| | - Eren Bas
- Department of Statistics, Faculty of Arts and Sciences, Forecast Research Laboratory, Giresun University, Giresun, Turkey
| | - Erol Egrioglu
- Department of Statistics, Faculty of Arts and Sciences, Forecast Research Laboratory, Giresun University, Giresun, Turkey
| |
Collapse
|
9
|
Polar Bear Optimization Algorithm: Meta-Heuristic with Fast Population Movement and Dynamic Birth and Death Mechanism. Symmetry (Basel) 2017. [DOI: 10.3390/sym9100203] [Citation(s) in RCA: 54] [Impact Index Per Article: 7.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
|